 Distributed MST: A Smoothed AnalysisInternational Conference of Distributed Computing and Networking (ICDCN), 2019 |
 Distributed Approximation Algorithms for Steiner Tree in the
International Journal of Foundations of Computer Science (IJFCS), 2019 |
 Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear TimeSymposium on the Theory of Computing (STOC), 2018 |
 Almost-Tight Distributed Minimum Cut AlgorithmsInternational Symposium on Distributed Computing (DISC), 2014 |
 Fast Routing Table Construction Using Small MessagesSymposium on the Theory of Computing (STOC), 2012 |
 Dense Subgraphs on Dynamic NetworksInternational Symposium on Distributed Computing (DISC), 2012 |
 Can Quantum Communication Speed Up Distributed Computation?ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012 |
 Efficient Computation of Distance Sketches in Distributed NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011 |
