 Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic
Energy CostACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 A Near-Optimal Low-Energy Deterministic Distributed SSSP with
Ramifications on Congestion and APSPACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2024 |
 Low-Distortion Clustering in Bounded Growth GraphsColloquium on Structural Information & Communication Complexity (CSICC), 2024 |
 Distributed MIS with Low Energy and Time ComplexitiesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy
Conservation in Radio NetworksInternational Symposium on Distributed Computing (DISC), 2022 |
 Awake Complexity of Distributed Minimum Spanning TreeColloquium on Structural Information & Communication Complexity (SIROCCO), 2022 |
 Distributed MIS in Awake ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 The Energy Complexity of BFS in Radio NetworksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Contention Resolution Without Collision DetectionSymposium on the Theory of Computing (STOC), 2020 |
 Broadcasting Competitively against Adaptive Adversary in Multi-channel
Radio NetworksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff
BoundsFun with Algorithms (FUN), 2019 |
