| Publication | Date of Publication | Type |
|---|
| Nearly optimal parallel broadcast in the plain public key model | 2026-02-04 | Paper |
| A breezing proof of the KMW bound | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829264 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
A Recursive Early-Stopping Phase King Protocol
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Optimal Clock Synchronization with Signatures
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
SIAM Journal on Computing | 2024-03-19 | Paper |
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
Distributed Computing | 2023-11-21 | Paper |
On specifications and proofs of timed circuits
Lecture Notes in Computer Science | 2023-08-10 | Paper |
| scientific article; zbMATH DE number 7701430 (Why is no real title available?) | 2023-06-26 | Paper |
scientific article; zbMATH DE number 7650398 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Near-optimal approximate shortest paths and transshipment in distributed and streaming models | 2023-02-03 | Paper |
| Distributed algorithms for low stretch spanning trees | 2023-02-03 | Paper |
| Self-stabilising Byzantine clock synchronisation is almost as easy as consensus | 2023-02-03 | Paper |
Robust routing made easy
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| Approximate minimum directed spanning trees under congestion | 2022-03-22 | Paper |
scientific article; zbMATH DE number 7385938 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-26 | Paper |
scientific article; zbMATH DE number 7376014 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-28 | Paper |
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
SIAM Journal on Computing | 2021-05-27 | Paper |
Fooling views: a new lower bound technique for distributed computations under congestion
Distributed Computing | 2021-01-22 | Paper |
Fault Tolerant Gradient Clock Synchronization
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Locality of not-so-weak coloring
(available as arXiv preprint) | 2020-03-03 | Paper |
On the complexity of hazard-free circuits
Journal of the ACM | 2020-02-11 | Paper |
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
Journal of the ACM | 2020-02-11 | Paper |
Optimal Metastability-Containing Sorting via Parallel Prefix Computation
IEEE Transactions on Computers | 2020-01-28 | Paper |
Algebraic methods in the congested clique
Distributed Computing | 2019-11-27 | Paper |
Near-optimal self-stabilising counting and firing squads
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Self-stabilizing Byzantine clock synchronization with optimal precision
Lecture Notes in Computer Science | 2019-11-22 | Paper |
On the complexity of hazard-free circuits
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Near-optimal self-stabilising counting and firing squads
Distributed Computing | 2019-08-13 | Paper |
| scientific article; zbMATH DE number 7075887 (Why is no real title available?) | 2019-07-03 | Paper |
Self-stabilizing Byzantine clock synchronization with optimal precision
Theory of Computing Systems | 2019-06-21 | Paper |
Distributed distance computation and routing with small messages
Distributed Computing | 2019-06-20 | Paper |
Parallel metric tree embedding based on an algebraic view on Moore-Bellman-Ford
Journal of the ACM | 2019-02-25 | Paper |
Near-optimal distributed maximum flow
SIAM Journal on Computing | 2018-12-05 | Paper |
Metastability-Containing Circuits
IEEE Transactions on Computers | 2018-09-20 | Paper |
| Efficient counting with optimal resilience | 2018-08-24 | Paper |
Efficient counting with optimal resilience
SIAM Journal on Computing | 2017-09-25 | Paper |
Searching without communicating: tradeoffs between performance and selection complexity
Distributed Computing | 2017-08-31 | Paper |
Tight bounds for parallel randomized load balancing
Distributed Computing | 2016-05-23 | Paper |
HEX: scaling honeycombs is easier than scaling clock trees
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Fast partial distance estimation and applications
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Towards optimal synchronous counting
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Near-optimal distributed maximum flow (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Algebraic methods in the congested clique
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Synchronous counting and computational algorithm design
Journal of Computer and System Sciences | 2015-12-11 | Paper |
MIS on trees
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Trade-offs between selection complexity and performance when searching the plane without communication
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Improved distributed Steiner forest construction
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
Journal of the ACM | 2015-08-14 | Paper |
Optimal deterministic routing and sorting on the congested clique
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Fast routing table construction using small messages (extended abstract)
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Tight bounds for clock synchronization
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Tight bounds for parallel randomized load balancing, extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Distributed minimum dominating set approximations in restricted families of graphs
Distributed Computing | 2013-08-26 | Paper |
``Tri, tri again'': finding triangles and small subgraphs in a distributed setting (extended abstract)
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Coupling molecular dynamics and continua with weak constraints
Multiscale Modeling & Simulation | 2012-08-11 | Paper |
Distributed algorithms for sensor networks
Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences | 2012-06-04 | Paper |
Minimum dominating set approximation in graphs of bounded arboricity
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Tight bounds for clock synchronization
Journal of the ACM | 2010-07-14 | Paper |
Leveraging Linial’s Locality Limit
Lecture Notes in Computer Science | 2008-11-20 | Paper |
