| Publication | Date of Publication | Type |
|---|
Communication complexity of Byzantine agreement, revisited
Distributed Computing | 2023-03-14 | Paper |
Revisiting asynchronous fault tolerant computation with optimal resilience
Distributed Computing | 2022-08-24 | 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 |
Implementing Mediators with Asynchronous Cheap Talk
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
scientific article; zbMATH DE number 7075887 (Why is no real title available?)
| 2019-07-03 | Paper |
On distributed algorithms in a broadcast domain
Automata, Languages and Programming | 2019-03-29 | Paper |
Fault Identification Via Nonparametric Belief Propagation
IEEE Transactions on Signal Processing | 2018-07-18 | Paper |
Compact routing messages in self-healing trees
Theoretical Computer Science | 2017-12-20 | Paper |
Stateless computation
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Dynamic voting for consistent primary components
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Observable clock synchronization extended abstract
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
No justified complaints: on fair sharing of multiple resources
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
HEX: scaling honeycombs is easier than scaling clock trees
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Synchronous counting and computational algorithm design
Journal of Computer and System Sciences | 2015-12-11 | 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 |
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
Journal of the ACM | 2015-08-14 | Paper |
Distributed computing meets game theory
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Self-stabilizing Byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Fast self-stabilizing Byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | 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 |
OCD, obsessive consensus disorder (or repetitive consensus)
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Distributed protocols for leader election: a game-theoretic perspective
Lecture Notes in Computer Science | 2014-09-29 | 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 |
``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)
Lecture Notes in Computer Science | 2013-03-13 | Paper |
An optimal self-stabilizing firing squad
SIAM Journal on Computing | 2012-08-10 | Paper |
MULAN: multi-level adaptive network filter
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering | 2010-04-24 | Paper |
Constant-Space Localized Byzantine Consensus
Lecture Notes in Computer Science | 2008-11-20 | Paper |
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Lecture Notes in Computer Science | 2008-09-02 | Paper |
The Building Blocks of Consensus
Distributed Computing and Networking | 2008-03-06 | Paper |
Lower Bounds on Implementing Robust and Resilient Mediators
Theory of Cryptography | 2008-03-05 | Paper |
Self-stabilization of Byzantine Protocols
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Internet resiliency to attacks and failures under BGP policy routing
Computer Networks | 2006-10-19 | Paper |
Asynchronous resource discovery
Computer Networks | 2006-06-30 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-08-24 | Paper |
scientific article; zbMATH DE number 2061537 (Why is no real title available?)
| 2004-03-21 | Paper |
Nonmalleable Cryptography
SIAM Review | 2004-01-20 | Paper |
scientific article; zbMATH DE number 2013831 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 1950692 (Why is no real title available?)
| 2003-07-17 | Paper |
Neighborhood preserving hashing and approximate queries
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1925552 (Why is no real title available?)
International Journal of Information Security | 2002-01-01 | Paper |
Nonmalleable Cryptography
SIAM Journal on Computing | 2000-10-18 | Paper |
Atomic broadcast: From simple message diffusion to Byzantine agreement
Information and Computation | 2000-07-04 | Paper |
Fault tolerance in the cardiac ganglion of the lobster
Biological Cybernetics | 2000-01-09 | Paper |
scientific article; zbMATH DE number 1263989 (Why is no real title available?)
| 1999-11-29 | Paper |
Increasing the resilience of distributed and replicated database systems
Journal of Computer and System Sciences | 1999-04-26 | Paper |
Sharing memory robustly in message-passing systems
Journal of the ACM | 1998-02-02 | Paper |
Dynamic fault-tolerant clock synchronization
Journal of the ACM | 1998-02-02 | Paper |
Bounded Concurrent Time-Stamping
SIAM Journal on Computing | 1997-05-26 | Paper |
scientific article; zbMATH DE number 1003256 (Why is no real title available?)
| 1997-04-23 | Paper |
Atomic snapshots of shared memory
Journal of the ACM | 1994-03-20 | Paper |
Perfectly secure message transmission
Journal of the ACM | 1993-05-16 | Paper |
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
Mathematical Systems Theory | 1993-04-01 | Paper |
Determinism vs. Nondeterminism in Multiparty Communication Complexity
SIAM Journal on Computing | 1992-12-06 | Paper |
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Information and Computation | 1992-06-28 | Paper |
Fault-tolerant critical section management in asynchronous environments
Information and Computation | 1992-06-28 | Paper |
Consensus algorithms with one-bit messages
Distributed Computing | 1991-01-01 | Paper |
Renaming in an asynchronous environment
Journal of the ACM | 1990-01-01 | Paper |
Early stopping in Byzantine agreement
Journal of the ACM | 1990-01-01 | Paper |
The Distributed Firing Squad Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
Some Geometry for General River Routing
SIAM Journal on Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4053031 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4121394 (Why is no real title available?)
| 1988-01-01 | Paper |
Efficient fault-tolerant routings in networks
Information and Computation | 1987-01-01 | Paper |
On the minimal synchronism needed for distributed consensus
Journal of the ACM | 1987-01-01 | Paper |
A new look at fault-tolerant network routing
Information and Computation | 1987-01-01 | Paper |
Cheating husbands and other stories: A case study of knowledge, action, and communication
Distributed Computing | 1986-01-01 | Paper |
Bounds for Width Two Branching Programs
SIAM Journal on Computing | 1986-01-01 | Paper |
Reaching approximate agreement in the presence of faults
Journal of the ACM | 1986-01-01 | Paper |
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Bounds on information exchange for Byzantine agreement
Journal of the ACM | 1985-01-01 | Paper |
Profile Scheduling of Opposing Forests and Level Orders
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Scheduling Flat Graphs
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3900151 (Why is no real title available?)
| 1985-01-01 | Paper |
Scheduling precedence graphs of bounded height
Journal of Algorithms | 1984-01-01 | Paper |
Authenticated Algorithms for Byzantine Agreement
SIAM Journal on Computing | 1983-01-01 | Paper |
On the Security of Ping-Pong Protocols
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1983-01-01 | Paper |
On the security of public key protocols
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3856986 (Why is no real title available?)
| 1983-01-01 | Paper |
The Byzantine generals strike again
Journal of Algorithms | 1982-01-01 | Paper |
An efficient algorithm for byzantine agreement without authentication
Information and Control | 1982-01-01 | Paper |
On the security of ping-pong protocols
Information and Control | 1982-01-01 | Paper |
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
Journal of Algorithms | 1982-01-01 | Paper |
Commutation properties and generating sets characterize slices of various synchronization primitives
Theoretical Computer Science | 1979-01-01 | Paper |
Commutation relations of slices characterize some synchronization primitives
Information Processing Letters | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3635500 (Why is no real title available?)
| 1977-01-01 | Paper |
