| Publication | Date of Publication | Type |
|---|
| Distributed quantum proofs for replicated data | 2026-04-15 | Paper |
| Fast deterministic algorithms for highly-dynamic networks | 2026-03-31 | Paper |
| The topology of local computing in networks | 2026-03-18 | Paper |
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
Distributed Computing | 2025-10-29 | Paper |
| Fine-grained complexity lower bounds for families of dynamic graphs | 2025-06-19 | Paper |
The topology of local computing in networks
Journal of Applied and Computational Topology | 2024-11-29 | Paper |
Playing Guess Who with your kids: code-word strategy against adversaries
Theoretical Computer Science | 2024-10-07 | Paper |
| The time complexity of consensus under oblivious message adversaries | 2024-09-25 | Paper |
The time complexity of consensus under oblivious message adversaries
Algorithmica | 2024-05-30 | Paper |
| Playing guess who with your kids | 2024-05-16 | Paper |
| Sinkless orientation made simple | 2024-05-14 | Paper |
| Synchronous t-resilient consensus in arbitrary graphs | 2024-04-19 | Paper |
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model | 2023-12-08 | Paper |
| Models of smoothing in dynamic networks | 2023-11-02 | Paper |
| Improved hardness of approximation of diameter in the CONGEST model | 2023-11-02 | Paper |
| Brief announcement: Distributed quantum proofs for replicated data | 2023-11-02 | Paper |
Synchronous \(t\)-resilient consensus in arbitrary graphs
Information and Computation | 2023-05-19 | Paper |
| Trade-offs in distributed interactive proofs | 2023-02-03 | Paper |
| Quadratic and near-quadratic lower bounds for the CONGEST model | 2023-02-03 | Paper |
| Redundancy in distributed proofs | 2022-07-21 | Paper |
| The Sparsest Additive Spanner via Multiple Weighted BFS Trees | 2022-07-21 | Paper |
Smaller Cuts, Higher Lower Bounds
ACM Transactions on Algorithms | 2022-02-22 | Paper |
Redundancy in distributed proofs
Distributed Computing | 2021-05-17 | Paper |
Hardness of Distributed Optimization
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
A topological perspective on distributed network algorithms
Theoretical Computer Science | 2020-12-15 | Paper |
The sparsest additive spanner via multiple weighted BFS trees
Theoretical Computer Science | 2020-09-17 | Paper |
The sparsest additive spanner via multiple weighted BFS trees
Theoretical Computer Science | 2020-09-17 | Paper |
A topological perspective on distributed network algorithms
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Approximate proof-labeling schemes
Theoretical Computer Science | 2020-02-13 | Paper |
Algebraic methods in the congested clique
Distributed Computing | 2019-11-27 | Paper |
A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Bounds on the step and namespace complexity of renaming
SIAM Journal on Computing | 2019-01-14 | Paper |
A \((2 + \epsilon)\)-approximation for maximum weight matching in the semi-streaming model
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Distributed construction of purely additive spanners
Distributed Computing | 2018-06-01 | Paper |
Approximate proof-labeling schemes
Structural Information and Communication Complexity | 2018-04-12 | Paper |
Algebraic methods in the congested clique
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Counting-based impossibility proofs for renaming and set agreement
Lecture Notes in Computer Science | 2013-03-13 | Paper |
