| Publication | Date of Publication | Type |
|---|
| Dynamic maximal matching in clique networks | 2025-11-04 | Paper |
| The message complexity of distributed graph optimization | 2025-11-04 | Paper |
Can We Break Symmetry with o(m) Communication?
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Improved Tradeoffs for Leader Election
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Leader election in well-connected graphs
Algorithmica | 2023-04-11 | Paper |
| The complexity of symmetry breaking in massive graphs | 2023-02-03 | Paper |
| Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets | 2023-02-03 | Paper |
Latency, capacity, and distributed minimum spanning trees
Journal of Computer and System Sciences | 2022-03-29 | Paper |
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
The complexity of leader election in diameter-two networks
Distributed Computing | 2020-04-23 | Paper |
| The distributed minimum spanning tree problem | 2019-12-09 | Paper |
A time- and message-optimal distributed algorithm for minimum spanning trees
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Leader election in well-connected graphs
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Towards robust and efficient computation in dynamic peer-to-peer networks | 2019-05-10 | Paper |
| Fast Byzantine leader election in dynamic networks | 2018-08-24 | Paper |
Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
Theoretical Computer Science | 2018-04-16 | Paper |
Brief announcement: Symmetry breaking in the \textsc{Congest} model: time- and message-efficient algorithms for ruling sets
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Brief announcement: Gossiping with latencies
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Distributed computation of large-scale graph problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A time- and message-optimal distributed algorithm for minimum spanning trees
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Sublinear bounds for randomized leader election
Lecture Notes in Computer Science | 2016-12-19 | Paper |
Efficient computation of sparse structures
Random Structures & Algorithms | 2016-09-15 | Paper |
DEX: self-healing expanders
Distributed Computing | 2016-07-05 | Paper |
On the Complexity of Universal Leader Election
Journal of the ACM | 2015-08-14 | Paper |
Distributed agreement in dynamic peer-to-peer networks
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Fast Byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
On the complexity of universal leader election
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Sublinear bounds for randomized leader election
Theoretical Computer Science | 2014-12-02 | Paper |
Efficient computation of balanced structures
Automata, Languages, and Programming | 2013-08-07 | Paper |
The asynchronous bounded-cycle model
Theoretical Computer Science | 2011-10-10 | Paper |
