Slobodan Mitrovic

According to our database1, Slobodan Mitrovic authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models.
CoRR, 2024

2023
Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut.
CoRR, 2023

Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs.
CoRR, 2023

Nearly Tight Bounds For Differentially Private Multiway Cut.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Deterministic (1+<i>ε</i>)-approximate maximum matching with poly(1/<i>ε</i>) passes in the semi-streaming model and beyond.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Massively Parallel Algorithms for b-Matching.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Near-Optimal Correlation Clustering with Privacy.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Massively Parallel Algorithms for Small Subgraph Counting.
Proceedings of the Approximation, 2022

Online Page Migration with ML Advice.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model.
CoRR, 2021

Massively Parallel Algorithms for Distance Approximation and Spanners.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Correlation Clustering in Constant Many Parallel Rounds.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Round Compression for Parallel Matching Algorithms.
SIAM J. Comput., 2020

Parallel Algorithms for Small Subgraph Counting.
CoRR, 2020

Walking randomly, massively, and efficiently.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Improved Local Computation Algorithm for Set Cover via Sparsification.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fully Dynamic Algorithm for Constrained Submodular Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fairness in Streaming Submodular Maximization: Algorithms and Hardness.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Identifying Maximal Non-Redundant Integer Cone Generators.
CoRR, 2019

Weighted Matchings via Unweighted Augmentations.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Adversarially Robust Submodular Maximization under Knapsack Constraints.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Improved Parallel Algorithms for Density-Based Network Clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
When Stuck, Flip a Coin - New Algorithms for Large-Scale Tasks.
PhD thesis, 2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.
CoRR, 2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams.
Proceedings of the 35th International Conference on Machine Learning, 2018

A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
On the Resiliency of Static Forwarding Tables.
IEEE/ACM Trans. Netw., 2017

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach.
Proceedings of the 34th International Conference on Machine Learning, 2017

A distributed algorithm for partitioned robust submodular maximization.
Proceedings of the 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2017

2016
The quest for resilient (static) forwarding tables.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

On the Resiliency of Randomized Routing Against Multiple Edge Failures.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Homometric sets in trees.
Eur. J. Comb., 2014


  Loading...