 The Message Complexity of Distributed Graph OptimizationInformation Technology Convergence and Services (ITCS), 2023 |
 Deterministic Massively Parallel Symmetry Breaking for Sparse GraphsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023 |
 Distributed Computing With the CloudSafety-critical Systems Symposium (SSS), 2021 |
 Deterministic Massively Parallel ConnectivitySymposium on the Theory of Computing (STOC), 2021 |
 Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC
ModelFoundations of Software Technology and Theoretical Computer Science (FSTTCS), 2020 |
 Exponentially Faster Shortest Paths in the Congested CliqueACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Massively Parallel Algorithms for Distance Approximation and SpannersACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 |
 Massively Parallel Algorithms for Small Subgraph CountingInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2020 |
 Equivalence Classes and Conditional Hardness in Massively Parallel
ComputationsDistributed computing (Distrib. Comput.), 2020 |
 A Deterministic Algorithm for the MST Problem in Constant Rounds of
Congested CliqueSymposium on the Theory of Computing (STOC), 2019 |
 Sparse Hopsets in Congested CliqueInternational Conference on Principles of Distributed Systems (OPODIS), 2019 |
 Distributed Approximation Algorithms for Steiner Tree in the
International Journal of Foundations of Computer Science (IJFCS), 2019 |
 Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in
the CONGEST-CLIQUE ModelACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 |
 Large-Scale Distributed Algorithms for Facility Location with OutliersInternational Conference on Principles of Distributed Systems (OPODIS), 2018 |
 Weighted Matchings via Unweighted AugmentationsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2018 |
 Sparsifying Distributed Algorithms with Ramifications in Massively
Parallel Computation and Centralized Local ComputationACM-SIAM Symposium on Discrete Algorithms (SODA), 2018 |
 |
 |
 Super-fast MST Algorithms in the Congested Clique using MessagesFoundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016 |
 Approximation of Distances and Shortest Paths in the Broadcast Congest
CliqueInternational Conference on Principles of Distributed Systems (OPODIS), 2014 |
 Near-Constant-Time Distributed Algorithms on a Congested CliqueInternational Symposium on Distributed Computing (DISC), 2014 |
