| Publication | Date of Publication | Type |
|---|
| On implementing SWMR registers from SWSR registers in systems with Byzantine failures | 2024-07-26 | Paper |
| Randomization and failure detection: a hybrid approach to solve consensus | 2024-07-11 | Paper |
| Simulating reliable links with unreliable links in the presence of process crashes | 2024-07-11 | Paper |
| On Register Linearizability and Termination | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874262 | 2023-02-07 | Paper |
| Byzantine-Tolerant Set-Constrained Delivery Broadcast | 2023-02-07 | Paper |
| On the number of objects with distinct power and the linearizability of set agreement objects | 2023-02-03 | Paper |
| On atomic registers and randomized consensus in m\&m systems | 2022-04-01 | Paper |
| Randomized consensus with regular registers | 2021-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5137898 | 2020-12-03 | Paper |
| Life beyond set agreement | 2020-06-15 | Paper |
| Bounded disagreement | 2020-05-26 | Paper |
| Passing Messages while Sharing Memory | 2019-09-19 | Paper |
| On the Classification of Deterministic Objects via Set Agreement Power | 2019-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174926 | 2018-07-18 | Paper |
| On the quality of service of failure detectors | 2018-07-09 | Paper |
| On the quality of service of failure detectors | 2018-07-09 | Paper |
| Life Beyond Set Agreement | 2017-10-11 | Paper |
| Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) | 2017-09-29 | Paper |
| An Algorithm for Replicated Objects with Efficient Reads | 2017-09-29 | Paper |
| The weakest failure detector for solving consensus | 2017-08-21 | Paper |
| A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling | 2016-01-08 | Paper |
| On the impossibility of group membership | 2015-09-11 | Paper |
| Time and space lower bounds for non-blocking implementations (preliminary version) | 2015-09-11 | Paper |
| On implementing omega with weak reliability and synchrony assumptions | 2015-09-04 | Paper |
| The weakest failure detectors to solve certain fundamental problems in distributed computing | 2015-08-03 | Paper |
| Communication-efficient leader election and consensus with limited link synchrony | 2015-08-03 | Paper |
| Inconsistency and contamination (preliminary version) | 2015-06-19 | Paper |
| Unreliable failure detectors for asynchronous systems (preliminary version) | 2015-06-19 | Paper |
| Fast fault-tolerant agreement algorithms | 2015-03-10 | Paper |
| The weakest failure detector to solve nonuniform consensus | 2015-03-10 | Paper |
| On deterministic abortable objects | 2015-03-02 | Paper |
| Every problem has a weakest failure detector | 2014-12-12 | Paper |
| Timeliness-based wait-freedom | 2014-12-12 | Paper |
| Partial synchrony based on set timeliness | 2014-07-23 | Paper |
| Abortable and query-abortable objects and their efficient implementation | 2014-03-13 | Paper |
| On implementing omega in systems with weak reliability and synchrony assumptions | 2013-06-28 | Paper |
| The weakest failure detector to solve nonuniform consensus | 2013-06-20 | Paper |
| The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit | 2013-03-19 | Paper |
| The correctness proof of Ben-Or's randomized consensus algorithm | 2013-02-04 | Paper |
| Partial synchrony based on set timeliness | 2013-02-04 | Paper |
| The minimum information about failures for solving non-local tasks in message-passing systems | 2012-02-06 | Paper |
| Adaptive progress: a gracefully-degrading liveness property | 2010-09-09 | Paper |
| Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus | 2005-02-21 | Paper |
| Fault-tolerant wait-free shared objects | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437137 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436044 | 2003-11-23 | Paper |
| A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds | 2002-07-25 | Paper |
| The cost of graceful degradation for omission failures | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536628 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766882 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230337 | 2002-01-21 | Paper |
| Time and Space Lower Bounds for Nonblocking Implementations | 2000-10-18 | Paper |
| On Quiescent Reliable Communication | 2000-10-18 | Paper |
| Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks | 1999-06-21 | Paper |
| Failure Detection and Randomization: A Hybrid Approach to Solve Consensus | 1999-02-22 | Paper |
| The weakest failure detector for solving consensus | 1998-01-22 | Paper |
| Unreliable failure detectors for reliable distributed systems | 1998-01-21 | Paper |
| Simulating synchronized clocks and common knowledge in distributed systems | 1993-06-29 | Paper |
| The causal ordering abstraction and a simple way to implement it | 1992-06-28 | Paper |
| Automatically increasing the fault-tolerance of distributed algorithms | 1990-01-01 | Paper |
| Checkpointing and Rollback-Recovery for Distributed Systems | 1987-01-01 | Paper |
| Fast Distributed Agreement | 1987-01-01 | Paper |
| Distributed deadlock detection | 1987-01-01 | Paper |
| Distributed agreement in the presence of processor and communication faults | 1986-01-01 | Paper |
| State machines and assertions: An integrated approach to modeling and verification of distributed systems | 1986-01-01 | Paper |
| Asynchronous consensus and broadcast protocols | 1985-01-01 | Paper |
| Exposure to deadlock for communicating processes is hard to detect | 1985-01-01 | Paper |
| On the Optimum Checkpoint Selection Problem | 1984-01-01 | Paper |
| The Complexity of Optimal Addressing in Radio Networks | 1982-01-01 | Paper |
| Deadlock-Free Packet Switching Networks | 1981-01-01 | Paper |
| Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks | 1981-01-01 | Paper |
| The Design of Small-Diameter Networks by Local Search | 1979-01-01 | Paper |
