| Publication | Date of Publication | Type |
|---|
| Information theoretic HotStuff | 2026-03-31 | Paper |
Asymptotically free broadcast in constant expected time via packed VSS
Journal of Cryptology | 2025-10-23 | Paper |
| On fully dynamic graph sparsifiers | 2025-08-06 | Paper |
| Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC | 2025-07-23 | Paper |
| Perfect asynchronous MPC with linear communication overhead | 2024-11-13 | Paper |
scientific article; zbMATH DE number 7832746 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
| scientific article; zbMATH DE number 7832768 (Why is no real title available?) | 2024-04-15 | Paper |
Good-case Latency of Byzantine Broadcast
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
BeeGees: Stayin' Alive in Chained BFT
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Reaching consensus for asynchronous distributed key generation
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
| scientific article; zbMATH DE number 7774313 (Why is no real title available?) | 2023-12-08 | Paper |
Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Corrigendum: Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2023-11-14 | Paper |
| Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency | 2023-11-02 | Paper |
Reaching consensus for asynchronous distributed key generation
Distributed Computing | 2023-09-11 | Paper |
Asymptotically free broadcast in constant expected time via packed VSS
Theory of Cryptography | 2023-08-14 | Paper |
Efficient perfectly secure computation with optimal resilience
Theory of Cryptography | 2023-04-13 | Paper |
Communication complexity of Byzantine agreement, revisited
Distributed Computing | 2023-03-14 | Paper |
| Aggregatable subvector commitments for stateless cryptocurrencies | 2022-12-16 | Paper |
Efficient perfectly secure computation with optimal resilience
Journal of Cryptology | 2022-10-04 | Paper |
Revisiting asynchronous fault tolerant computation with optimal resilience
Distributed Computing | 2022-08-24 | Paper |
Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2022-04-20 | Paper |
Ramsey spanning trees and their applications
ACM Transactions on Algorithms | 2021-05-03 | Paper |
| Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience | 2021-03-17 | Paper |
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Communication Complexity of Byzantine Agreement, Revisited
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
HotStuff
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Implementing Mediators with Asynchronous Cheap Talk
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Peaches, lemons, and cookies: designing auction markets with dispersed information
Games and Economic Behavior | 2020-11-24 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
SIAM Journal on Computing | 2019-09-02 | Paper |
Metric embedding via shortest path decompositions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| The blockchain consensus layer and BFT | 2019-07-03 | Paper |
Low-distortion inference of latent similarities from a multiplex social network
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| On low dimensional local embeddings | 2019-05-06 | Paper |
Using petal-decompositions to build a low stretch spanning tree
SIAM Journal on Computing | 2019-03-22 | Paper |
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Distributed SSH key management with proactive RSA threshold signatures | 2018-08-10 | Paper |
Highway dimension and provably efficient shortest path algorithms
Journal of the ACM | 2018-08-02 | Paper |
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Ramsey spanning trees and their applications | 2018-03-15 | Paper |
| Approximate nearest neighbor search in metrics of planar graphs | 2017-08-31 | Paper |
Asymptotically tight bounds for composing ORAM with PIR
Lecture Notes in Computer Science | 2017-06-13 | Paper |
| Fully dynamic all-pairs shortest paths: breaking the O(n) barrier | 2017-03-22 | Paper |
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs | 2015-08-03 | Paper |
Compact routing on Euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Byzantine disk paxos
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Local embeddings of metric spaces
Algorithmica | 2015-07-10 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Low-distortion inference of latent similarities from a multiplex social network
SIAM Journal on Computing | 2015-06-11 | Paper |
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SIAM Journal on Computing | 2015-06-02 | Paper |
Alternative routes in road networks
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Distributed computing meets game theory
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion | 2014-12-18 | Paper |
An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Volume in general metric spaces
Discrete & Computational Geometry | 2014-10-29 | Paper |
Distributed protocols for leader election: a game-theoretic perspective
Lecture Notes in Computer Science | 2014-09-29 | Paper |
Distance Labels with Optimal Local Stretch
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Highway dimension, shortest paths, and provably efficient algorithms | 2014-05-22 | Paper |
Using petal-decompositions to build a low stretch spanning tree
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Reconstructing approximate tree metrics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Byzantine disk paxos: optimal resilience with Byzantine shared memory
Distributed Computing | 2013-06-13 | Paper |
Probabilistic quorums for dynamic systems
Distributed Computing | 2013-06-07 | Paper |
Hierarchical hub labelings for shortest paths
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Advances in metric embedding theory
Advances in Mathematics | 2011-12-02 | Paper |
On approximate distance labels and routing schemes with affine stretch
Lecture Notes in Computer Science | 2011-10-28 | Paper |
VC-dimension and shortest path algorithms
Automata, Languages and Programming | 2011-07-06 | Paper |
Strong-diameter decompositions of minor free graphs
Theory of Computing Systems | 2010-12-17 | Paper |
Volume in general metric spaces
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764811 (Why is no real title available?) | 2010-08-06 | Paper |
Probabilistic quorums for dynamic systems. (Extended abstract)
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Wait-free regular storage from Byzantine components
Information Processing Letters | 2010-01-29 | Paper |
Compact Multicast Routing
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Lower Bounds on Implementing Robust and Resilient Mediators
Theory of Cryptography | 2008-03-05 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Asynchronous resource discovery
Computer Networks | 2006-06-30 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Routing with Improved Communication-Space Trade-Off
Lecture Notes in Computer Science | 2005-08-17 | Paper |
