I am an assistant professor in the Department of Computer Science at UC Davis.
I also hold a guest professor position in the Department of Mathematics and Informatics at the University of Novi Sad.
Prior to that, I was a Postdoctoral Fellow at the Theory of Computation group, CSAIL,
at MIT and I was fortunate to have
Ronitt Rubinfeld as my host.
I received my PhD degree from the Computer Science department at EPFL, advised by Aleksander Mądry. After finishing my PhD and prior to coming to MIT, I spent two months at ETH hosted by Mohsen Ghaffari.
My research has been generously supported by Google Research Scholar Program.
Research interests: Broadly speaking, I am interested in algorithmic graph theory and combinatorial approach to optimization. My research focuses on designing efficient algorithms in the context of memory-constrained computation, such as parallel, distributed, streaming and local computation.
I received my PhD degree from the Computer Science department at EPFL, advised by Aleksander Mądry. After finishing my PhD and prior to coming to MIT, I spent two months at ETH hosted by Mohsen Ghaffari.
My research has been generously supported by Google Research Scholar Program.
Research interests: Broadly speaking, I am interested in algorithmic graph theory and combinatorial approach to optimization. My research focuses on designing efficient algorithms in the context of memory-constrained computation, such as parallel, distributed, streaming and local computation.
Prospective students:
If you are interested in my research and in working with me, please contact me.
Please note that for a student to get admitted, it is necessary to submit the application through the official portal. Submission deadline is typically in early January.
Professional Activities
Program Committees: SAND 2023, STOC 2023, ICALP 2022, SWAT 2022.Teaching
- ECS 189A -- Special Topics in Computer Science (Winter Quarter 2024)
- ECS 189A -- Special Topics in Computer Science (Spring Quarter 2023)
- ECS 289A -- Special Topics in Computer Science (Fall Quarter 2022)
- ECS 122A -- Algorithm Design and Analysis (Spring Quarter 2022)
Recent Manuscripts
Publications
-
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 -
Near-Optimal Correlation Clustering with Privacy
36th Conference on Neural Information Processing Systems, NeurIPS 2022 -
Parallel Algorithms for Small Subgraph Counting
International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2022 -
Massively Parallel Algorithms for b-Matching
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2022 -
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model
54th ACM Symposium on Theory of Computing, STOC 2022 -
Online Page Migration with ML Advice
25th International Conference on Artificial Intelligence and Statistics, AISTATS 2022 -
Correlation Clustering in Constant Many Parallel Rounds
38th International Conference on Machine Learning, ICML 2021 -
Massively Parallel Algorithms for Distance Approximation and Spanners
33th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2021 -
Fully Dynamic Algorithm for Constrained Submodular Optimization
34th Conference on Neural Information Processing Systems, NeurIPS 2020 -
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
34th Conference on Neural Information Processing Systems, NeurIPS 2020 -
Walking Randomly, Massively, and Efficiently
52nd ACM Symposium on Theory of Computing, STOC 2020
video -
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
ACM - SIAM Symposium on Discrete Algorithms, SODA 2020 -
Improved Local Computation Algorithm for Set Cover via Sparsification
ACM - SIAM Symposium on Discrete Algorithms, SODA 2020 -
Improved Parallel Algorithms for Density-Based Network Clustering
36th International Conference on Machine Learning, ICML 2019 -
Weighted Matchings via Unweighted Augmentations
ACM Symposium on Principles of Distributed Computing, PODC 2019 -
Adversarially Robust Submodular Maximization under Knapsack Constraints
25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2019 -
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
35th International Conference on Machine Learning, ICML 2018 -
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
ACM Symposium on Principles of Distributed Computing, PODC 2018 -
Round Compression for Parallel Matching Algorithms
50th ACM Symposium on Theory of Computing, STOC 2018. Invited to the special issue.
video TCS+ by Artur Czumaj -
A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
The 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018 -
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
31th Conference on Neural Information Processing Systems, NIPS 2017 -
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
34th International Conference on Machine Learning, ICML 2017 -
On the Resiliency of Randomized Routing Against Multiple Edge Failures
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 -
The Quest for Resilient (Static) Forwarding Tables
35th IEEE International Conference on Computer Communications, INFOCOM 2016 -
On the Resiliency of Static Forwarding Tables
IEEE/ACM Transactions on Networking (Volume: 25, Issue: 2), ToN 2016 -
Homometric sets in diameter-two and outerplanar graphs
17th IEEE Mediterranean Electrotechnical Conference, MELECON 2014
IEEE R8 Best Student Paper Award -
Homometric sets in trees
European Journal of Combinatorics, 2014 -
Identifying Maximal Non-Redundant Integer Cone Generators
Technical report
Thesis
-
When Stuck, Flip a Coin: New Algorithms for Large-Scale Tasks
PhD Thesis, EPFL, 2018 -
Metric problems on graphs
Master's Thesis, EPFL, 2013