Slobodan Mitrović

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Locally computing edge orientations	2025	Slobodan Mitrović Ronitt Rubinfeld Mihir Singhal
+ PDF Chat	Faster Semi-streaming Matchings via Alternating Trees	2024	Slobodan Mitrović Anish Mukherjee Piotr Sankowski Wen-Horng Sheu
+ PDF Chat	Approximate counting of permutation patterns	2024	Omri Ben‐Eliezer Slobodan Mitrović Pranjal Srivastava
+ PDF Chat	Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling	2024	Laxman Dhulipala Michael Dinitz Jakub Łącki Slobodan Mitrović
+ PDF Chat	Differentially Private Gomory-Hu Trees	2024	Anders Aamand Justin Y. Chen Mina Dalirrooyfard Slobodan Mitrović Yuriy Nevmyvaka Sandeep Silwal Yinzhan Xu
+ PDF Chat	Dynamic PageRank: Algorithms and Lower Bounds	2024	Rajesh Jayaram Jakub Łącki Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+ PDF Chat	Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models	2024	Mina Dalirrooyfard Konstantin Makarychev Slobodan Mitrović
+	Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs	2023	Slobodan Mitrović Theodore Pan
+	Nearly Tight Bounds For Differentially Private Min $s$-$t$ and Multiway Cut	2023	Mina Dalirrooyfard Slobodan Mitrović Yuriy Nevmyvaka
+ PDF Chat	Massively Parallel Algorithms for b-Matching	2022	Mohsen Ghaffari Christoph Grunau Slobodan Mitrović
+	Near-Optimal Correlation Clustering with Privacy	2022	Vincent Cohen-Addad Chenglin Fan Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Nikos Parotsidis Jakub Tarnawski
+	Massively Parallel Algorithms for $b$-Matching	2022	Mohsen Ghaffari Christoph Grunau Slobodan Mitrović
+	Massively Parallel Algorithms for Distance Approximation and Spanners	2021	Amartya Shankha Biswas Michal Dory Mohsen Ghaffari Slobodan Mitrović Yasamin Nazari
+	Deterministic $(1+\varepsilon)$-Approximate Maximum Matching with $\mathsf{poly}(1/\varepsilon)$ Passes in the Semi-Streaming Model	2021	Manuela Fischer Slobodan Mitrović Jara Uitto
+	Correlation Clustering in Constant Many Parallel Rounds	2021	Vincent Cohen-Addad Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Nikos Parotsidis Jakub Tarnawski
+	Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model.	2021	Manuela Fischer Slobodan Mitrović Jara Uitto
+	Deterministic $(1+\varepsilon)$-Approximate Maximum Matching with $\mathsf{poly}(1/\varepsilon)$ Passes in the Semi-Streaming Model and Beyond	2021	Manuela Fischer Slobodan Mitrović Jara Uitto
+	Fully Dynamic Algorithm for Constrained Submodular Optimization	2020	Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Jakub Tarnawski Morteza Zadimoghaddam
+ PDF Chat	Fully Dynamic Algorithm for Constrained Submodular Optimization	2020	Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Jakub Tarnawski Morteza Zadimoghaddam
+	Walking randomly, massively, and efficiently	2020	Jakub Łącki Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Parallel Algorithms for Small Subgraph Counting.	2020	Amartya Shankha Biswas Talya Eden Quanquan C. Liu Slobodan Mitrović Ronitt Rubinfeld
+	Online Page Migration with ML Advice	2020	Piotr Indyk Frederik Mallmann-Trenn Slobodan Mitrović Ronitt Rubinfeld
+	Fairness in Streaming Submodular Maximization: Algorithms and Hardness	2020	Marwa El Halabi Slobodan Mitrović Ashkan Norouzi-Fard Jakab Tardos Jakub Tarnawski
+	Massively Parallel Algorithms for Small Subgraph Counting	2020	Amartya Shankha Biswas Talya Eden Quanquan C. Liu Slobodan Mitrović Ronitt Rubinfeld
+	New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling	2020	Spencer Compton Slobodan Mitrović Ronitt Rubinfeld
+	Fully Dynamic Algorithm for Constrained Submodular Optimization	2020	Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Jakub Tarnawski Morteza Zadimoghaddam
+	Massively Parallel Algorithms for Distance Approximation and Spanners	2020	Amartya Shankha Biswas Michal Dory Mohsen Ghaffari Slobodan Mitrović Yasamin Nazari
+ PDF Chat	Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples	2019	Michael Kapralov Slobodan Mitrović Ashkan Norouzi-Fard Jakab Tardos
+ PDF Chat	Improved Local Computation Algorithm for Set Cover via Sparsification	2019	Christoph Grunau Slobodan Mitrović Ronitt Rubinfeld Ali Vakilian
+ PDF Chat	Round Compression for Parallel Matching Algorithms	2019	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+ PDF Chat	Adversarially Robust Submodular Maximization under Knapsack Constraints	2019	Dmitrii Avdiukhin Slobodan Mitrović Grigory Yaroslavtsev Samson Zhou
+ PDF Chat	Weighted Matchings via Unweighted Augmentations	2019	Buddhima Gamlath Sagar Kale Slobodan Mitrović Ola Svensson
+	Walking Randomly, Massively, and Efficiently	2019	Jakub Łącki Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Identifying Maximal Non-Redundant Integer Cone Generators.	2019	Slobodan Mitrović Ružica Piskač Viktor Kunčak
+	Adversarially Robust Submodular Maximization under Knapsack Constraints	2019	Dmitrii Avdiukhin Slobodan Mitrović Grigory Yaroslavtsev Samson Zhou
+	Improved Local Computation Algorithm for Set Cover via Sparsification	2019	Christoph Grunau Slobodan Mitrović Ronitt Rubinfeld Ali Vakilian
+	Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples	2019	Michael Kapralov Slobodan Mitrović Ashkan Norouzi-Fard Jakab Tardos
+	Walking Randomly, Massively, and Efficiently	2019	Jakub Łącki Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Identifying Maximal Non-Redundant Integer Cone Generators	2019	Slobodan Mitrović Ružica Piskač Viktor Kunčak
+	Weighted Matchings via Unweighted Augmentations.	2018	Buddhima Gamlath Sagar Kale Slobodan Mitrović Ola Svensson
+	Beyond $1/2$-Approximation for Submodular Maximization on Massive Data Streams	2018	Ashkan Norouzi-Fard Jakub Tarnawski Slobodan Mitrović Amir Zandieh Aida Mousavifar Ola Svensson
+	Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover	2018	Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrović Ronitt Rubinfeld
+ PDF Chat	Round compression for parallel matching algorithms	2018	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Beyond $1/2$-Approximation for Submodular Maximization on Massive Data Streams	2018	Ashkan Norouzi-Fard Jakub Tarnawski Slobodan Mitrović Amir Zandieh Aida Mousavifar Ola Svensson
+	Weighted Matchings via Unweighted Augmentations	2018	Buddhima Gamlath Sagar Kale Slobodan Mitrović Ola Svensson
+	Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover	2018	Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrović Ronitt Rubinfeld
+	A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians	2017	Aleksander Ma̧dry Slobodan Mitrović Ludwig Schmidt
+	Round Compression for Parallel Matching Algorithms	2017	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach	2017	Slobodan Mitrović Ilija Bogunovic Ashkan Norouzi-Fard Jakub Tarnawski Volkan Cevher
+	A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians	2017	Aleksander Mądry Slobodan Mitrović Ludwig Schmidt
+	Round Compression for Parallel Matching Algorithms	2017	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski
+	Homometric sets in diameter-two and outerplanar graphs	2014	Slobodan Mitrović
+	Homometric sets in trees	2013	Radoslav Fulek Slobodan Mitrović
+	An algorithm for the approximation by cubic splines	1992	Slobodan Mitrović R. Bojanić

Common Coauthors

Coauthor	Papers Together
Ashkan Norouzi-Fard	11
Piotr Sankowski	9
Jakub Łącki	9
Ronitt Rubinfeld	9
Jakub Tarnawski	9
Krzysztof Onak	8
Aleksander Mądry	6
Mohsen Ghaffari	6
Silvio Lattanzi	5
Ola Svensson	5
Amartya Shankha Biswas	4
Christoph Grunau	4
Artur Czumaj	4
Buddhima Gamlath	3
Jara Uitto	3
Morteza Zadimoghaddam	3
Jakab Tardos	3
Mina Dalirrooyfard	3
Manuela Fischer	3
Grigory Yaroslavtsev	2
Viktor Kunčak	2
Yasamin Nazari	2
Amir Zandieh	2
Samson Zhou	2
Sagar Kale	2
Ružica Piskač	2
Michal Dory	2
Ali Vakilian	2
Christian Konrad	2
Themis Gouleakis	2
Nikos Parotsidis	2
Quanquan C. Liu	2
Vincent Cohen-Addad	2
Yuriy Nevmyvaka	2
Talya Eden	2
Michael Kapralov	2
Dmitrii Avdiukhin	2
Theodore Pan	1
Yinzhan Xu	1
Mihir Singhal	1
Wen-Horng Sheu	1
Pranjal Srivastava	1
Radoslav Fulek	1
Laxman Dhulipala	1
Anders Aamand	1
R. Bojanić	1
Ludwig Schmidt	1
Justin Y. Chen	1
Piotr Indyk	1
Aida Mousavifar	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Parallel algorithms for geometric graph problems	2014	Alexandr Andoni Aleksandar Nikolov Krzysztof Onak Grigory Yaroslavtsev	7
+ PDF Chat	Communication steps for parallel query processing	2013	Paul Beame Paraschos Koutris Dan Suciu	7
+ PDF Chat	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	7
+	Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover	2018	Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrović Ronitt Rubinfeld	7
+	A fast and simple randomized parallel algorithm for the maximal independent set problem	1986	Noga Alon László Babai Alon Itai	6
+ PDF Chat	Round compression for parallel matching algorithms	2018	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski	6
+ PDF Chat	Weighted Matchings via Unweighted Augmentations	2019	Buddhima Gamlath Sagar Kale Slobodan Mitrović Ola Svensson	5
+ PDF Chat	Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs	2019	Sepehr Assadi MohammadHossein Bateni Aaron Bernstein Vahab Mirrokni Clifford Stein	5
+	Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation	2019	Mohsen Ghaffari Jara Uitto	4
+ PDF Chat	Greedy and Local Ratio Algorithms in the MapReduce Model	2018	Nicholas J. A. Harvey Christopher Liaw Paul Liu	4
+ PDF Chat	Exponentially Faster Massively Parallel Maximal Matching	2019	Soheil Behnezhad Mohammad Taghi Hajiaghayi David G. Harris	4
+	Access to Data and Number of Iterations	2015	Kook Jin Ahn Sudipto Guha	4
+ PDF Chat	Randomized Composable Coresets for Matching and Vertex Cover	2017	Sepehr Assadi Sanjeev Khanna	4
+	Simple Round Compression for Parallel Vertex Cover	2017	Sepehr Assadi	4
+ PDF Chat	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang Peilin Zhong	4
+	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	3
+ PDF Chat	A New Framework for Distributed Submodular Maximization	2016	Rafael da Ponte Barbosa Alina Ene Huy L. Nguyễn Justin Ward	3
+	Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model	2018	Sebastian Brandt Manuela Fischer Jara Uitto	3
+	A (2 + ϵ)-approximation for maximum weight matching in the semi-streaming model	2017	Ami Paz Gregory Schwartzman	3
+	Approximating matching size from random streams	2014	Michael Kapralov Sanjeev Khanna Madhu Sudan	3
+	Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs	2019	Sepehr Assadi Xiaorui Sun Omri Weinstein	3
+	Communication Steps for Parallel Query Processing	2013	Paul Beame Paraschos Koutris Dan Suciu	3
+ PDF Chat	Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs	2013	Ashish Goel Michael Kapralov Sanjeev Khanna	2
+ PDF Chat	Distributed Random Walks	2013	Atish Das Sarma Danupon Nanongkai Gopal Pandurangan Prasad Tetali	2
+	Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time	2019	Alina Ene Huy L. Nguyễn	2
+	There Are No Further Counterexamples to S. Piccard's Theorem	2007	A. Bekir S. W. Golomb	2
+	Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching	2014	Sayan Bhattacharya Monika Henzinger Giuseppe F. Italiano	2
+ PDF Chat	Sublinear Algorithms for Local Graph Centrality Estimation	2018	Marco Bressan Enoch Peserico Luca Pretto	2
+	Introduction to Algorithms, third edition	2009	Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein	2
+	Weighted Matchings via Unweighted Augmentations.	2018	Buddhima Gamlath Sagar Kale Slobodan Mitrović Ola Svensson	2
+	Robust Submodular Maximization: A Non-Uniform Partitioning Approach	2017	Ilija Bogunovic Slobodan Mitrović Jonathan Scarlett Volkan Cevher	2
+	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Clifford Stein Zhao Song Zhengyu Wang Peilin Zhong	2
+	Lessons from the Congested Clique applied to MapReduce	2015	James W. Hegeman Sriram V. Pemmaraju	2
+	A counterexample to a theorem of S. Piccard	1977	Gary S. Bloom	2
+ PDF Chat	Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model	2011	Leah Epstein Asaf Levin Julián Mestre Danny Segev	2
+ PDF Chat	Testing Expansion in Bounded-Degree Graphs	2010	Artur Czumaj Christian Sohler	2
+ PDF Chat	Sublinear Estimation of Weighted Matchings in Dynamic Data Streams	2015	Marc Bury Chris Schwiegelshohn	2
+	Tight Bounds for Testing Bipartiteness in General Graphs	2004	Tali Kaufman Michael Krivelevich Dana Ron	2
+	The Markov chain Monte Carlo method: an approach to approximate counting and integration	1996	Mark Jerrum Alistair Sinclair	2
+ PDF Chat	Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time	2017	Sayan Bhattacharya Deeparnab Chakrabarty Monika Henzinger	2
+	Linear programming in the semi-streaming model with application to the maximum matching problem	2012	Kook Jin Ahn Sudipto Guha	2
+	Testing Cluster Structure of Graphs	2015	Artur Czumaj Pan Peng Christian Sohler	2
+	An Expansion Tester for Bounded Degree Graphs	2011	Satyen Kale C. Seshadhri	2
+	Applications of numbered undirected graphs	1977	Gary S. Bloom Solomon W. Golomb	2
+ PDF Chat	Skew in parallel query processing	2014	Paul Beame Paraschos Koutris Dan Suciu	2
+ PDF Chat	Estimating PageRank on graph streams	2011	Atish Das Sarma Sreenivas Gollapudi Rina Panigrahy‎	2
+	An optimal parallel algorithm for integer sorting	1985	John H. Reif	2
+	On homometric sets in graphs	2011	Maria Axenovich Lale Özkahya	2
+ PDF Chat	Planar graphs: Random walks and bipartiteness testing	2019	Artur Czumaj Morteza Monemizadeh Krzysztof Onak Christian Sohler	2
+ PDF Chat	Fast Distributed Algorithms for Testing Graph Properties	2016	Keren Censor-Hillel Eldar Fischer Gregory Schwartzman Yadu Vasudev	2