| Publication | Date of Publication | Type |
|---|
| Communication complexity of Byzantine agreement, revisited | 2023-03-14 | Paper |
| Revisiting asynchronous fault tolerant computation with optimal resilience | 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 | 2021-03-15 | Paper |
| Communication Complexity of Byzantine Agreement, Revisited | 2021-01-20 | Paper |
| Implementing Mediators with Asynchronous Cheap Talk | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967183 | 2019-07-03 | Paper |
| On distributed algorithms in a broadcast domain | 2019-03-29 | Paper |
| Fault Identification Via Nonparametric Belief Propagation | 2018-07-18 | Paper |
| Compact routing messages in self-healing trees | 2017-12-20 | Paper |
| Stateless computation | 2017-10-11 | Paper |
| Dynamic voting for consistent primary components | 2017-09-29 | Paper |
| Observable clock synchronization extended abstract | 2017-09-29 | Paper |
| No justified complaints: on fair sharing of multiple resources | 2016-10-07 | Paper |
| HEX: scaling honeycombs is easier than scaling clock trees | 2016-04-18 | Paper |
| Synchronous counting and computational algorithm design | 2015-12-11 | Paper |
| Asynchronous resource discovery | 2015-09-04 | Paper |
| Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity | 2015-08-21 | Paper |
| Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation | 2015-08-14 | Paper |
| Distributed computing meets game theory | 2015-03-10 | Paper |
| Self-stabilizing Byzantine agreement | 2015-03-10 | Paper |
| Early-deciding consensus is expensive | 2015-03-02 | Paper |
| Fast self-stabilizing Byzantine tolerant digital clock synchronization | 2014-12-12 | Paper |
| An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience | 2014-12-12 | Paper |
| OCD, obsessive consensus disorder (or repetitive consensus) | 2014-12-12 | Paper |
| Distributed protocols for leader election: a game-theoretic perspective | 2014-09-29 | Paper |
| Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip | 2014-02-13 | Paper |
| ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract) | 2013-03-13 | Paper |
| An optimal self-stabilizing firing squad | 2012-08-10 | Paper |
| MULAN: multi-level adaptive network filter | 2010-04-24 | Paper |
| Constant-Space Localized Byzantine Consensus | 2008-11-20 | Paper |
| On Self-stabilizing Synchronous Actions Despite Byzantine Attacks | 2008-09-02 | Paper |
| The Building Blocks of Consensus | 2008-03-06 | Paper |
| Lower Bounds on Implementing Robust and Resilient Mediators | 2008-03-05 | Paper |
| Self-stabilization of Byzantine Protocols | 2007-09-25 | Paper |
| Internet resiliency to attacks and failures under BGP policy routing | 2006-10-19 | Paper |
| Asynchronous resource discovery | 2006-06-30 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Principles of Distributed Systems | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457215 | 2004-03-21 | Paper |
| Nonmalleable Cryptography | 2004-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437123 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413425 | 2003-07-17 | Paper |
| Neighborhood preserving hashing and approximate queries | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707226 | 2002-01-01 | Paper |
| Nonmalleable Cryptography | 2000-10-18 | Paper |
| Atomic broadcast: From simple message diffusion to Byzantine agreement | 2000-07-04 | Paper |
| Fault tolerance in the cardiac ganglion of the lobster | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232880 | 1999-11-29 | Paper |
| Increasing the resilience of distributed and replicated database systems | 1999-04-26 | Paper |
| Sharing memory robustly in message-passing systems | 1998-02-02 | Paper |
| Dynamic fault-tolerant clock synchronization | 1998-02-02 | Paper |
| Bounded Concurrent Time-Stamping | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128884 | 1997-04-23 | Paper |
| Atomic snapshots of shared memory | 1994-03-20 | Paper |
| Perfectly secure message transmission | 1993-05-16 | Paper |
| A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment | 1993-04-01 | Paper |
| Determinism vs. Nondeterminism in Multiparty Communication Complexity | 1992-12-06 | Paper |
| Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement | 1992-06-28 | Paper |
| Fault-tolerant critical section management in asynchronous environments | 1992-06-28 | Paper |
| Consensus algorithms with one-bit messages | 1991-01-01 | Paper |
| Renaming in an asynchronous environment | 1990-01-01 | Paper |
| Early stopping in Byzantine agreement | 1990-01-01 | Paper |
| The Distributed Firing Squad Problem | 1989-01-01 | Paper |
| Some Geometry for General River Routing | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789080 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734746 | 1988-01-01 | Paper |
| Efficient fault-tolerant routings in networks | 1987-01-01 | Paper |
| On the minimal synchronism needed for distributed consensus | 1987-01-01 | Paper |
| A new look at fault-tolerant network routing | 1987-01-01 | Paper |
| Cheating husbands and other stories: A case study of knowledge, action, and communication | 1986-01-01 | Paper |
| Bounds for Width Two Branching Programs | 1986-01-01 | Paper |
| Reaching approximate agreement in the presence of faults | 1986-01-01 | Paper |
| On the possibility and impossibility of achieving clock synchronization | 1986-01-01 | Paper |
| Bounds on information exchange for Byzantine agreement | 1985-01-01 | Paper |
| Profile Scheduling of Opposing Forests and Level Orders | 1985-01-01 | Paper |
| Scheduling Flat Graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678667 | 1985-01-01 | Paper |
| Scheduling precedence graphs of bounded height | 1984-01-01 | Paper |
| Authenticated Algorithms for Byzantine Agreement | 1983-01-01 | Paper |
| On the Security of Ping-Pong Protocols | 1983-01-01 | Paper |
| On the security of public key protocols | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325624 | 1983-01-01 | Paper |
| The Byzantine generals strike again | 1982-01-01 | Paper |
| An efficient algorithm for byzantine agreement without authentication | 1982-01-01 | Paper |
| On the security of ping-pong protocols | 1982-01-01 | Paper |
| An O(n log n) unidirectional distributed algorithm for extrema finding in a circle | 1982-01-01 | Paper |
| Commutation properties and generating sets characterize slices of various synchronization primitives | 1979-01-01 | Paper |
| Commutation relations of slices characterize some synchronization primitives | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195947 | 1977-01-01 | Paper |
