| Publication | Date of Publication | Type |
|---|
Brief Announcement: The MBroadcast Abstraction
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774262 (Why is no real title available?)
| 2023-12-08 | Paper |
Which broadcast abstraction captures \(k\)-set agreement?
| 2023-02-03 | Paper |
Extending the wait-free hierarchy to multi-threaded systems
Distributed Computing | 2022-08-24 | Paper |
A simple object that spans the whole consensus hierarchy
Parallel Processing Letters | 2022-07-04 | Paper |
Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
Theoretical Computer Science | 2021-10-06 | Paper |
Extending the Wait-free Hierarchy to Multi-Threaded Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Time-efficient read/write register in crash-prone asynchronous message-passing systems
Computing | 2021-01-15 | Paper |
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing | 2020-12-04 | Paper |
Communication-based prevention of useless checkpoints in distributed computations
Distributed Computing | 2020-12-03 | Paper |
scientific article; zbMATH DE number 7141420 (Why is no real title available?)
| 2019-12-09 | Paper |
Crash-tolerant causal broadcast in \(O(n)\) messages
Information Processing Letters | 2019-09-20 | Paper |
Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
Journal of the ACM | 2018-08-02 | Paper |
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers | 2018-06-12 | Paper |
Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
Theoretical Computer Science | 2017-12-20 | Paper |
Two-bit messages are sufficient to implement atomic read/write registers in crash-prone systems
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
Acta Informatica | 2017-09-29 | Paper |
Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
Theory of Computing Systems | 2017-08-15 | Paper |
From binary consensus to multivalued consensus in asynchronous message-passing systems
Information Processing Letters | 2016-06-16 | Paper |
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM | 2015-11-12 | Paper |
Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
\(K\)-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Towards the minimal synchrony for byzantine consensus
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On the computability power and the robustness of set agreement-oriented failure detector classes
Distributed Computing | 2013-06-28 | Paper |
Synchronous condition-based consensus
Distributed Computing | 2013-06-13 | Paper |
Using conditions to expedite consensus in synchronous distributed systems
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Asynchronous bounded lifetime failure detectors
Information Processing Letters | 2009-12-04 | Paper |
Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
Theoretical Computer Science | 2009-12-01 | Paper |
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
SIAM Journal on Computing | 2009-08-20 | Paper |
A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
Information Processing Letters | 2009-07-21 | Paper |
From adaptive renaming to set agreement
Theoretical Computer Science | 2009-03-30 | Paper |
Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Narrowing Power vs. Efficiency in Synchronous Set Agreement
Distributed Computing and Networking | 2008-03-06 | Paper |
From Renaming to Set Agreement
Structural Information and Communication Complexity | 2007-11-15 | Paper |
From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing | 2007-02-19 | Paper |
The Synchronous Condition-Based Consensus Hierarchy
Lecture Notes in Computer Science | 2005-08-17 | Paper |
The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Distributed Computing - IWDC 2004
Lecture Notes in Computer Science | 2005-08-12 | Paper |
scientific article; zbMATH DE number 2013822 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013823 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013821 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 1950666 (Why is no real title available?)
| 2003-07-17 | Paper |
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1830912 (Why is no real title available?)
| 2002-11-18 | Paper |
Interval consistency of asynchronous distributed computations
Journal of Computer and System Sciences | 2002-08-04 | Paper |
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property
Information Processing Letters | 2002-07-14 | Paper |
The logically instantaneous communication mode: a communication abstraction
Future Generation Computer Systems | 2002-07-14 | Paper |
Adaptive checkpointing in message passing distributed systems
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1998-06-08 | Paper |
