| Publication | Date of Publication | Type |
|---|
| Brief Announcement: The MBroadcast Abstraction | 2024-03-26 | Paper |
| Self-stabilizing indulgent zero-degrading binary consensus | 2024-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6190878 | 2024-02-06 | Paper |
| About informatics, distributed computing, and our job: a personal view | 2024-01-11 | Paper |
| Asynchronous Byzantine reliable broadcast with a message adversary | 2023-10-12 | Paper |
| Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast | 2023-09-07 | Paper |
| Optimal algorithms for synchronous Byzantine \(k\)-set agreement | 2023-09-07 | Paper |
| Bee's strategy against Byzantines. Replacing Byzantine participants (extended abstract) | 2023-08-02 | Paper |
| Set agreement and renaming in the presence of contention-related crash failures | 2023-08-02 | Paper |
| Reaching agreement in the presence of contention-related crash failures | 2023-06-21 | Paper |
| Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity | 2023-06-19 | Paper |
| Optimal algorithms for synchronous Byzantine \(k\)-set agreement | 2023-06-12 | Paper |
| Reaching consensus in the presence of contention-related crash failures | 2023-06-12 | Paper |
| Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast | 2023-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874232 | 2023-02-07 | Paper |
| Election in fully anonymous shared memory systems: tight space bounds and algorithms | 2022-11-11 | Paper |
| Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems | 2022-10-28 | Paper |
| An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values | 2022-07-08 | Paper |
| On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm | 2022-07-08 | Paper |
| A Simple Object that Spans the Whole Consensus Hierarchy | 2022-07-04 | Paper |
| Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement | 2022-06-08 | Paper |
| A visit to mutual exclusion in seven dates | 2022-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072481 | 2022-04-28 | Paper |
| Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions | 2022-04-19 | Paper |
| Contention-related crash failures: definitions, agreement algorithms, and impossibility results | 2022-03-01 | Paper |
| Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects | 2021-10-06 | Paper |
| Byzantine-tolerant causal broadcast | 2021-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5011847 | 2021-08-30 | Paper |
| From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems | 2021-03-15 | Paper |
| Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion | 2021-01-20 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5137890 | 2020-12-03 | Paper |
| Communication-based prevention of useless checkpoints in distributed computations | 2020-12-03 | Paper |
| Leader-based de-anonymization of an anonymous read/write memory | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305190 | 2020-08-06 | Paper |
| Mutual exclusion in fully anonymous shared memory systems | 2020-04-03 | Paper |
| Anonymous Read/write memory: leader election and de-anonymization | 2020-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207893 | 2020-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203927 | 2019-12-09 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-11-22 | Paper |
| Fault-Tolerant Message-Passing Distributed Systems | 2019-10-18 | Paper |
| Crash-tolerant causal broadcast in \(O(n)\) messages | 2019-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967153 | 2019-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967227 | 2019-07-03 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-06-21 | Paper |
| Unifying Concurrent Objects and Distributed Tasks | 2019-02-25 | Paper |
| Vertex coloring with communication and local memory constraints in synchronous broadcast networks | 2018-12-07 | Paper |
| Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) | 2018-08-24 | Paper |
| Are Byzantine failures really different from crash failures? | 2018-08-16 | Paper |
| Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time | 2018-08-02 | Paper |
| A pleasant stroll through the land of distributed machines, computation, and universality | 2018-06-26 | Paper |
| Asynchronous Agreement and Its Relation with Error-Correcting Codes | 2018-06-12 | Paper |
| Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks | 2018-06-12 | Paper |
| Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers | 2018-04-11 | Paper |
| Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems | 2017-12-20 | Paper |
| A Fast Contention-Friendly Binary Search Tree | 2017-12-15 | Paper |
| Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast | 2017-12-15 | 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 |
| Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems | 2017-09-29 | Paper |
| Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial) | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363809 | 2017-09-29 | Paper |
| Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems | 2017-08-15 | Paper |
| From wait-free to arbitrary concurrent solo executions in colorless distributed computing | 2017-05-22 | Paper |
| Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach | 2017-05-16 | Paper |
| From causal consistency to sequential consistency in shared memory systems | 2017-01-19 | Paper |
| t-Resilient Immediate Snapshot Is Impossible | 2016-12-01 | Paper |
| A distributed leader election algorithm in crash-recovery and omissive systems | 2016-11-23 | Paper |
| Distributed universality | 2016-10-21 | Paper |
| A necessary condition for Byzantine \(k\)-set agreement | 2016-08-16 | Paper |
| From binary consensus to multivalued consensus in asynchronous message-passing systems | 2016-06-16 | Paper |
| Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects | 2016-04-25 | Paper |
| Implementing set objects in dynamic distributed systems | 2016-04-18 | Paper |
| Minimal Synchrony for Byzantine Consensus | 2016-03-23 | Paper |
| Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems | 2016-03-23 | Paper |
| A hierarchy of conditions for consensus solvability | 2016-03-04 | Paper |
| Communication Patterns and Input Patterns in Distributed Computing | 2016-01-08 | 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 |
| Rollback-dependency trackability | 2015-09-11 | Paper |
| Timed consistency for shared distributed objects | 2015-09-11 | 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 |
| Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors | 2015-03-02 | Paper |
| The multiplicative power of consensus numbers | 2015-03-02 | Paper |
| On asymmetric progress conditions | 2015-03-02 | Paper |
| Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2015-02-27 | Paper |
| Distributed Universality | 2015-02-10 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| The renaming problem in shared memory systems: an introduction | 2014-10-24 | Paper |
| Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems | 2014-08-07 | Paper |
| What Can be Computed in a Distributed System? | 2014-07-24 | Paper |
| Computing in the Presence of Concurrent Solo Executions | 2014-03-31 | Paper |
| Failure detectors are schedulers | 2014-03-13 | Paper |
| Trust-aware peer sampling: performance and privacy tradeoffs | 2014-01-13 | Paper |
| The weakest failure detector to implement a register in asynchronous systems with hybrid communication | 2014-01-13 | Paper |
| Power and limits of distributed computing shared memory models | 2014-01-13 | Paper |
| Towards a universal construction for transaction-based multiprocess programs | 2014-01-10 | Paper |
| Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems | 2013-12-17 | Paper |
| Anonymous asynchronous systems: the case of failure detectors | 2013-08-26 | Paper |
| Distributed Algorithms for Message-Passing Systems | 2013-07-29 | Paper |
| The \(k\)-simultaneous consensus problem | 2013-06-28 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4904222 | 2013-01-28 | Paper |
| Concurrent Programming: Algorithms, Principles, and Foundations | 2012-10-12 | Paper |
| Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) | 2012-08-10 | Paper |
| Using asynchrony and zero degradation to speed up indulgent consensus protocols | 2012-07-26 | Paper |
| From the happened-before relation to the causal ordered set abstraction | 2012-07-13 | Paper |
| Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks | 2012-06-29 | Paper |
| No double discount: condition-based simultaneity yields limited gain | 2012-05-24 | Paper |
| Help when needed, but no more: efficient read/write partial snapshot | 2012-02-14 | Paper |
| On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems | 2011-07-22 | Paper |
| Anonymous Asynchronous Systems: The Case of Failure Detectors | 2010-09-10 | Paper |
| A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems | 2010-09-02 | Paper |
| A note on atomicity: boosting Test\&Set to solve consensus | 2010-08-16 | Paper |
| Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures | 2010-08-13 | Paper |
| An impossibility about failure detectors in the iterated immediate snapshot model | 2010-06-09 | Paper |
| Anonymous graph exploration without collision by mobile robots | 2010-06-09 | Paper |
| Regular Register: An Implementation in a Churn Prone Environment | 2010-02-24 | Paper |
| A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition | 2010-02-24 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Asynchronous bounded lifetime failure detectors | 2009-12-04 | Paper |
| Stabilizing mobile philosophers | 2009-12-04 | Paper |
| Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound | 2009-12-01 | Paper |
| Help When Needed, But No More: Efficient Read/Write Partial Snapshot | 2009-11-19 | Paper |
| The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity | 2009-11-19 | 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 |
| Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures | 2009-03-12 | Paper |
| No Double Discount: Condition-Based Simultaneity Yields Limited Gain | 2008-11-20 | Paper |
| The Committee Decision Problem | 2008-09-18 | 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 |
| A Subjective Visit to Selected Topics in Distributed Computing | 2008-09-02 | Paper |
| The Iterated Restricted Immediate Snapshot Model | 2008-07-10 | 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 |
| A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION | 2005-06-22 | Paper |
| Consensus in Byzantine asynchronous systems | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437113 | 2003-12-07 | 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/Q4427280 | 2003-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413395 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413406 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796132 | 2003-04-03 | Paper |
| An introduction to oracles for asynchronous distributed systems | 2003-01-21 | Paper |
| Rollback-dependency trackability: A minimal characterization and its protocol | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778617 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778626 | 2002-11-18 | Paper |
| Interval consistency of asynchronous distributed computations | 2002-08-04 | Paper |
| Restricted failure detectors: Definition and reduction protocols | 2002-07-25 | 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 |
| Consistent Checkpointing for Transaction Systems | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952902 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4244541 | 1999-05-31 | Paper |
| Consistent records in asynchronous computations | 1998-08-20 | Paper |
| \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion | 1998-08-13 | Paper |
| Shared global states in distributed computations | 1998-08-04 | Paper |
| Adaptive checkpointing in message passing distributed systems | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344720 | 1997-12-14 | Paper |
| On-the-fly analysis of distributed computations | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4889460 | 1997-01-22 | Paper |
| Distributed algorithms for static and dynamic termination detection | 1996-09-05 | Paper |
| Specification and verification of dynamic properties in distributed computations | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3994354 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023326 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023327 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023328 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997127 | 1992-09-17 | Paper |
| The causal ordering abstraction and a simple way to implement it | 1992-06-28 | Paper |
| Prime numbers as a tool to design distributed algorithms | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730760 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789056 | 1988-01-01 | Paper |
| A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793717 | 1988-01-01 | Paper |
| A distributed algorithm to prevent mutual drift between n logical clocks | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725734 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813266 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949959 | 1982-01-01 | Paper |
| An experience in implementing abstract data types | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168056 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191576 | 1978-01-01 | Paper |
