default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSlobodan Mitrovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Algorithmica 86(9): 2997-3026 (2024)- [c31]Slobodan Mitrovic, Ronitt Rubinfeld, Mihir Singhal:
Locally Computing Edge Orientations. ESA 2024: 89:1-89:17 - [c30]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. ICALP 2024: 90:1-90:19 - [c29]Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. ICML 2024 - [c28]Slobodan Mitrovic, Theodore Pan:
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs. ICML 2024 - [c27]Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic:
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. DISC 2024: 19:1-19:23 - [i28]Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models. CoRR abs/2402.15668 (2024) - [i27]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. CoRR abs/2404.16267 (2024) - [i26]Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu:
Differentially Private Gomory-Hu Trees. CoRR abs/2408.01798 (2024) - [i25]Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic:
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. CoRR abs/2408.13362 (2024) - 2023
- [c26]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. ICALP 2023: 45:1-45:16 - [c25]Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka:
Nearly Tight Bounds For Differentially Private Multiway Cut. NeurIPS 2023 - [i24]Slobodan Mitrovic, Theodore Pan:
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs. CoRR abs/2311.10924 (2023) - [i23]Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka:
Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut. CoRR abs/2312.16370 (2023) - 2022
- [c24]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. AISTATS 2022: 1655-1670 - [c23]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic:
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM 2022: 39:1-39:28 - [c22]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. NeurIPS 2022 - [c21]Mohsen Ghaffari, Christoph Grunau
, Slobodan Mitrovic:
Massively Parallel Algorithms for b-Matching. SPAA 2022: 35-44 - [c20]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. STOC 2022: 248-260 - [i22]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. CoRR abs/2203.01440 (2022) - [i21]Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic:
Massively Parallel Algorithms for b-Matching. CoRR abs/2211.07796 (2022) - 2021
- [c19]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. ICML 2021: 2069-2078 - [c18]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021: 118-128 - [i20]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. CoRR abs/2106.04179 (2021) - [i19]Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Correlation Clustering in Constant Many Parallel Rounds. CoRR abs/2106.08448 (2021) - 2020
- [j3]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - [c17]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. NeurIPS 2020 - [c16]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS 2020 - [c15]Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos:
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. SODA 2020: 1753-1772 - [c14]Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian:
Improved Local Computation Algorithm for Set Cover via Sparsification. SODA 2020: 2993-3011 - [c13]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking randomly, massively, and efficiently. STOC 2020: 364-377 - [i18]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld:
Parallel Algorithms for Small Subgraph Counting. CoRR abs/2002.08299 (2020) - [i17]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR abs/2003.01254 (2020) - [i16]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR abs/2006.04704 (2020) - [i15]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. CoRR abs/2006.05028 (2020) - [i14]Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization: Algorithms and Hardness. CoRR abs/2010.07431 (2020) - [i13]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. CoRR abs/2012.15002 (2020)
2010 – 2019
- 2019
- [c12]Mohsen Ghaffari, Silvio Lattanzi, Slobodan Mitrovic:
Improved Parallel Algorithms for Density-Based Network Clustering. ICML 2019: 2201-2210 - [c11]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. KDD 2019: 148-156 - [c10]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. PODC 2019: 491-500 - [i12]Slobodan Mitrovic, Ruzica Piskac, Viktor Kuncak:
Identifying Maximal Non-Redundant Integer Cone Generators. CoRR abs/1903.08571 (2019) - [i11]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. CoRR abs/1905.02367 (2019) - [i10]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking Randomly, Massively, and Efficiently. CoRR abs/1907.05391 (2019) - [i9]Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos:
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples. CoRR abs/1907.05725 (2019) - [i8]Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian:
Improved Local Computation Algorithm for Set Cover via Sparsification. CoRR abs/1910.14154 (2019) - 2018
- [b1]Slobodan Mitrovic:
When Stuck, Flip a Coin - New Algorithms for Large-Scale Tasks. EPFL, Switzerland, 2018 - [c9]Aleksander Madry, Slobodan Mitrovic, Ludwig Schmidt:
A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians. AISTATS 2018: 20-28 - [c8]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson:
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML 2018: 3826-3835 - [c7]Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC 2018: 129-138 - [c6]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - [i7]Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR abs/1802.08237 (2018) - [i6]Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aida Mousavifar, Ola Svensson:
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR abs/1808.01842 (2018) - [i5]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. CoRR abs/1811.02760 (2018) - 2017
- [j2]Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrovic, Andrei V. Gurtov, Aleksander Madry, Michael Schapira, Scott Shenker:
On the Resiliency of Static Forwarding Tables. IEEE/ACM Trans. Netw. 25(2): 1133-1146 (2017) - [c5]Ilija Bogunovic, Slobodan Mitrovic, Jonathan Scarlett, Volkan Cevher:
A distributed algorithm for partitioned robust submodular maximization. CAMSAP 2017: 1-5 - [c4]Ilija Bogunovic, Slobodan Mitrovic, Jonathan Scarlett, Volkan Cevher:
Robust Submodular Maximization: A Non-Uniform Partitioning Approach. ICML 2017: 508-516 - [c3]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher:
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. NIPS 2017: 4557-4566 - [i4]Ilija Bogunovic, Slobodan Mitrovic, Jonathan Scarlett, Volkan Cevher:
Robust Submodular Maximization: A Non-Uniform Partitioning Approach. CoRR abs/1706.04918 (2017) - [i3]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - [i2]Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Volkan Cevher:
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. CoRR abs/1711.02598 (2017) - [i1]Aleksander Madry, Slobodan Mitrovic, Ludwig Schmidt:
A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians. CoRR abs/1712.08130 (2017) - 2016
- [c2]Marco Chiesa, Andrei V. Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Schapira, Scott Shenker:
On the Resiliency of Randomized Routing Against Multiple Edge Failures. ICALP 2016: 134:1-134:15 - [c1]Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrovic, Aurojit Panda, Andrei V. Gurtov, Aleksander Madry, Michael Schapira, Scott Shenker:
The quest for resilient (static) forwarding tables. INFOCOM 2016: 1-9 - 2014
- [j1]Radoslav Fulek, Slobodan Mitrovic:
Homometric sets in trees. Eur. J. Comb. 35: 256-263 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
