| Publication | Date of Publication | Type |
|---|
On implementing SWMR registers from SWSR registers in systems with Byzantine failures
Distributed Computing | 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
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7650878 (Why is no real title available?)
| 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
Distributed Computing | 2022-04-01 | Paper |
Randomized consensus with regular registers
Information Processing Letters | 2021-12-14 | Paper |
Failure detection and consensus in the crash-recovery model
| 2020-12-03 | Paper |
Life beyond set agreement
Distributed Computing | 2020-06-15 | Paper |
Bounded disagreement
Theoretical Computer Science | 2020-05-26 | Paper |
Passing messages while sharing memory
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
On the Classification of Deterministic Objects via Set Agreement Power
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Bounded disagreement
| 2018-07-18 | Paper |
On the quality of service of failure detectors
IEEE Transactions on Computers | 2018-07-09 | Paper |
On the quality of service of failure detectors
IEEE Transactions on Computers | 2018-07-09 | Paper |
Life beyond set agreement
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
An algorithm for replicated objects with efficient reads (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
The weakest failure detector for solving consensus
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
Structural Information and Communication Complexity | 2016-01-08 | Paper |
On the impossibility of group membership
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Time and space lower bounds for non-blocking implementations (preliminary version)
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Inconsistency and contamination (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Unreliable failure detectors for asynchronous systems (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
The weakest failure detector to solve nonuniform consensus
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
On deterministic abortable objects
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Timeliness-based wait-freedom, a gracefully degrading progress condition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Abortable and query-abortable objects and their efficient implementation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On implementing omega in systems with weak reliability and synchrony assumptions
Distributed Computing | 2013-06-28 | Paper |
The weakest failure detector to solve nonuniform consensus
Distributed Computing | 2013-06-20 | Paper |
The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
SIAM Journal on Computing | 2013-03-19 | Paper |
The correctness proof of Ben-Or's randomized consensus algorithm
Distributed Computing | 2013-02-04 | Paper |
Partial synchrony based on set timeliness
Distributed Computing | 2013-02-04 | Paper |
The minimum information about failures for solving non-local tasks in message-passing systems
Distributed Computing | 2012-02-06 | Paper |
Adaptive progress: a gracefully-degrading liveness property
Distributed Computing | 2010-09-09 | Paper |
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
SIAM Journal on Computing | 2005-02-21 | Paper |
Fault-tolerant wait-free shared objects
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2013842 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2006647 (Why is no real title available?)
| 2003-11-23 | Paper |
A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
Information Processing Letters | 2002-07-25 | Paper |
The cost of graceful degradation for omission failures
Information Processing Letters | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1759635 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1696680 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1256651 (Why is no real title available?)
| 2002-01-21 | Paper |
Time and Space Lower Bounds for Nonblocking Implementations
SIAM Journal on Computing | 2000-10-18 | Paper |
On Quiescent Reliable Communication
SIAM Journal on Computing | 2000-10-18 | Paper |
Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks
Theoretical Computer Science | 1999-06-21 | Paper |
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
SIAM Journal on Computing | 1999-02-22 | Paper |
The weakest failure detector for solving consensus
Journal of the ACM | 1998-01-22 | Paper |
Unreliable failure detectors for reliable distributed systems
Journal of the ACM | 1998-01-21 | Paper |
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM | 1993-06-29 | Paper |
The causal ordering abstraction and a simple way to implement it
Information Processing Letters | 1992-06-28 | Paper |
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms | 1990-01-01 | Paper |
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering | 1987-01-01 | Paper |
Fast Distributed Agreement
SIAM Journal on Computing | 1987-01-01 | Paper |
Distributed deadlock detection
Distributed Computing | 1987-01-01 | Paper |
Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering | 1986-01-01 | Paper |
State machines and assertions: An integrated approach to modeling and verification of distributed systems
Science of Computer Programming | 1986-01-01 | Paper |
Asynchronous consensus and broadcast protocols
Journal of the ACM | 1985-01-01 | Paper |
Exposure to deadlock for communicating processes is hard to detect
Information Processing Letters | 1985-01-01 | Paper |
On the Optimum Checkpoint Selection Problem
SIAM Journal on Computing | 1984-01-01 | Paper |
The Complexity of Optimal Addressing in Radio Networks
IEEE Transactions on Communications | 1982-01-01 | Paper |
Deadlock-Free Packet Switching Networks
SIAM Journal on Computing | 1981-01-01 | Paper |
Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
SIAM Journal on Computing | 1981-01-01 | Paper |
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers | 1979-01-01 | Paper |
