| Publication | Date of Publication | Type |
|---|
| Brief Announcement: The MBroadcast Abstraction | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083374 | 2023-12-08 | Paper |
| Which broadcast abstraction captures \(k\)-set agreement? | 2023-02-03 | Paper |
| Extending the wait-free hierarchy to multi-threaded systems | 2022-08-24 | Paper |
| A Simple Object that Spans the Whole Consensus Hierarchy | 2022-07-04 | Paper |
| Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects | 2021-10-06 | Paper |
| Extending the Wait-free Hierarchy to Multi-Threaded Systems | 2021-03-15 | Paper |
| Time-efficient read/write register in crash-prone asynchronous message-passing systems | 2021-01-15 | Paper |
| Condition-based consensus solvability: a hierarchy of conditions and efficient protocols | 2020-12-04 | Paper |
| Communication-based prevention of useless checkpoints in distributed computations | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203927 | 2019-12-09 | Paper |
| Crash-tolerant causal broadcast in \(O(n)\) messages | 2019-09-20 | Paper |
| Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time | 2018-08-02 | Paper |
| Asynchronous Agreement and Its Relation with Error-Correcting Codes | 2018-06-12 | Paper |
| Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems | 2017-12-20 | Paper |
| Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems | 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 | 2017-09-29 | Paper |
| Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems | 2017-08-15 | Paper |
| From binary consensus to multivalued consensus in asynchronous message-passing systems | 2016-06-16 | Paper |
| A hierarchy of conditions for consensus solvability | 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 | 2016-01-08 | Paper |
| Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2015-11-12 | Paper |
| Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages | 2015-09-03 | Paper |
| The combined power of conditions and failure detectors to solve asynchronous set agreement | 2015-03-10 | Paper |
| Irreducibility and additivity of set agreement-oriented failure detector classes | 2015-03-10 | Paper |
| k-set agreement with limited accuracy failure detectors | 2015-03-03 | Paper |
| Synchronous byzantine agreement with nearly a cubic number of communication bits | 2015-03-02 | Paper |
| Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2015-02-27 | Paper |
| Towards the minimal synchrony for byzantine consensus | 2014-03-13 | Paper |
| On the computability power and the robustness of set agreement-oriented failure detector classes | 2013-06-28 | Paper |
| Synchronous condition-based consensus | 2013-06-13 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Asynchronous bounded lifetime failure detectors | 2009-12-04 | Paper |
| Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound | 2009-12-01 | Paper |
| The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement | 2009-08-20 | Paper |
| A weakest failure detector-based asynchronous consensus protocol for \(f<n\) | 2009-07-21 | Paper |
| From adaptive renaming to set agreement | 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 | 2008-09-09 | Paper |
| Narrowing Power vs. Efficiency in Synchronous Set Agreement | 2008-03-06 | Paper |
| From Renaming to Set Agreement | 2007-11-15 | Paper |
| From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation | 2007-02-19 | Paper |
| The Synchronous Condition-Based Consensus Hierarchy | 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 | 2005-08-17 | Paper |
| Distributed Computing - IWDC 2004 | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437114 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437115 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437113 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413395 | 2003-07-17 | Paper |
| An introduction to oracles for asynchronous distributed systems | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778617 | 2002-11-18 | Paper |
| Interval consistency of asynchronous distributed computations | 2002-08-04 | Paper |
| Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property | 2002-07-14 | Paper |
| The logically instantaneous communication mode: a communication abstraction | 2002-07-14 | Paper |
| Adaptive checkpointing in message passing distributed systems | 1998-06-08 | Paper |
