| Publication | Date of Publication | Type |
|---|
| Planar quorums | 2024-07-11 | Paper |
| Stationary and deterministic leader election in self-organizing particle systems | 2024-04-19 | Paper |
Brief Announcement: Breaking the f + 1 Barrier: Executing Payment Transactions in Parallel with Less than f + 1 Validations
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Clairvoyant state machine replications
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Clairvoyant state machine replication
Information and Computation | 2022-05-17 | Paper |
Synchronous Byzantine quorum systems
Distributed Computing | 2020-12-03 | Paper |
Access cost for asynchronous Byzantine quorum systems
Distributed Computing | 2020-12-03 | Paper |
On the use of registers in achieving wait-free consensus
Distributed Computing | 2020-12-02 | Paper |
Synchronous Byzantine quorum systems
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
A gap theorem for consensus types extended abstract
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
On the use of registers in achieving wait-free consensus
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
The possibility and the complexity of achieving fault-tolerant coordination
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Simplifying fault-tolerance, providing the abstraction of crash failures
Journal of the ACM | 2015-10-30 | Paper |
Leader election and shape formation with self-organizing programmable matter
Lecture Notes in Computer Science | 2015-09-30 | Paper |
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Effective storage capacity of labeled graphs
Information and Computation | 2014-02-11 | Paper |
On the establishment of distinct identities in overlay networks
Distributed Computing | 2013-06-20 | Paper |
Hop chains: Secure routing and the establishment of distinct identities
Theoretical Computer Science | 2009-03-02 | Paper |
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Byzantine and Multi-writer K-Quorums
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Planar quorums
Theoretical Computer Science | 2000-08-21 | Paper |
Using knowledge to optimally achieve coordination in distributed systems
Theoretical Computer Science | 1999-06-21 | Paper |
The complexity of almost-optimal simultaneous coordination
Algorithmica | 1997-06-30 | Paper |
