 Tight Bounds on the Message Complexity of Distributed Tree VerificationInternational Conference on Principles of Distributed Systems (OPODIS), 2024 |
 Time- and Communication-Efficient Overlay Network Construction via
GossipInformation Technology Convergence and Services (ITCS), 2023 |
 The Message Complexity of Distributed Graph OptimizationInformation Technology Convergence and Services (ITCS), 2023 |
 Optimal Message-Passing with Noisy BeepsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Improved Tradeoffs for Leader ElectionACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Near-Optimal Distributed Computation of Small Vertex CutsInternational Symposium on Distributed Computing (DISC), 2022 |
 A Nearly Time-Optimal Distributed Approximation of Minimum Cost
-Edge-Connected Spanning SubgraphACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 An Almost Singularly Optimal Asynchronous Distributed MST AlgorithmInternational Symposium on Distributed Computing (DISC), 2022 |
 Deterministic Fault-Tolerant Connectivity Labeling SchemeACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Singularly Near Optimal Leader Election in Asynchronous NetworksInternational Symposium on Distributed Computing (DISC), 2021 |
 Fault-Tolerant Labeling and Compact Routing SchemesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Can We Break Symmetry with o(m) Communication?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Communication Costs in a Geometric Communication NetworkInternational Conference of Distributed Computing and Networking (ICDCN), 2020 |
 Message Reduction in the Local Model is a Free LunchACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 |
 Super-fast MST Algorithms in the Congested Clique using MessagesFoundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016 |
