 A Near-Optimal Low-Energy Deterministic Distributed SSSP with
Ramifications on Congestion and APSPACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual
GraphsInternational Symposium on Distributed Computing (DISC), 2024 |
 On the Power of Graphical Reconfigurable CircuitsInternational Symposium on Distributed Computing (DISC), 2024 |
 |
 Tight Bounds on the Message Complexity of Distributed Tree VerificationInternational Conference on Principles of Distributed Systems (OPODIS), 2024 |
 Asynchronous Wait-Free Runtime Verification and Enforcement of
LinearizabilityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 A Nearly Time-Optimal Distributed Approximation of Minimum Cost
-Edge-Connected Spanning SubgraphACM-SIAM Symposium on Discrete Algorithms (SODA), 2022 |
 Parallel Breadth-First Search and Exact Shortest Paths and Stronger
Notions for Approximate DistancesSymposium on the Theory of Computing (STOC), 2022 |
 Distributed Quantum Interactive ProofsSymposium on Theoretical Aspects of Computer Science (STACS), 2022 |
 An Almost Singularly Optimal Asynchronous Distributed MST AlgorithmInternational Symposium on Distributed Computing (DISC), 2022 |
 Computing Power of Hybrid Models in Synchronous NetworksInternational Conference on Principles of Distributed Systems (OPODIS), 2022 |
 Quantum Complexity of Weighted Diameter and Radius in CONGEST NetworksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Fully Polynomial-Time Distributed Computation in Low-Treewidth GraphsACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022 |
 |
 Awake Complexity of Distributed Minimum Spanning TreeColloquium on Structural Information & Communication Complexity (SIROCCO), 2022 |
 Routing Schemes and Distance Oracles in the Hybrid ModelInternational Symposium on Distributed Computing (DISC), 2022 |
 Low-Congestion Shortcuts in Constant Diameter GraphsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Locally Checkable Labelings with Small MessagesInternational Symposium on Distributed Computing (DISC), 2021 |
 Communication Costs in a Geometric Communication NetworkInternational Conference of Distributed Computing and Networking (ICDCN), 2020 |
 Minor Sparsifiers and the Distributed Laplacian ParadigmIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
 Distance Computations in the Hybrid Network Model via Oracle SimulationsSymposium on Theoretical Aspects of Computer Science (STACS), 2020 |
 Low-Congestion Shortcuts for Graphs Excluding Dense MinorsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Deterministic Distributed Expander Decomposition and Routing with
Applications in Distributed DerandomizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 |
 Local Certification of Graphs with Bounded GenusDiscrete Applied Mathematics (Discrete Appl. Math.), 2020 |
 Distributed Weighted Min-Cut in Nearly-Optimal TimeSymposium on the Theory of Computing (STOC), 2020 |
