| Publication | Date of Publication | Type |
|---|
| Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083367 | 2023-12-08 | Paper |
| Relaxed Data Types as Consistency Conditions | 2022-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091071 | 2022-07-21 | Paper |
| Implementing ♢P with Bounded Messages on a Network of ADD Channels | 2022-07-04 | Paper |
| Store-collect in the presence of continuous churn with application to snapshots and lattice agreement | 2022-06-08 | Paper |
| Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement | 2021-03-15 | Paper |
| How Fast Reads Affect Multi-Valued Register Simulations | 2021-01-20 | Paper |
| Anomalies and similarities among consensus numbers of variously-relaxed queues | 2021-01-15 | Paper |
| Distributed reconfiguration of metamorphic robot chains | 2020-12-04 | Paper |
| Using adaptive timeouts to achieve at-most-once message delivery | 2020-11-30 | Paper |
| Shared memory and the Bakery algorithm | 2020-11-10 | Paper |
| Relaxed data types as consistency conditions | 2020-01-13 | Paper |
| Improved time bounds for linearizable implementations of abstract data types | 2018-12-03 | Paper |
| Time Complexity of Link Reversal Routing | 2018-10-30 | Paper |
| Simulating a shared register in an asynchronous system that never stops changing (extended abstract) | 2018-08-24 | Paper |
| Wait-free clock synchronization | 2017-09-29 | Paper |
| Generic Proofs of Consensus Numbers for Abstract Data Types. | 2017-09-29 | Paper |
| The impact of time on the session problem | 2017-08-21 | Paper |
| Time bounds on synchronization in a periodic distributed system | 2016-05-26 | Paper |
| Distributed reconfiguration of metamorphic robot chains | 2015-03-03 | Paper |
| Dynamic regular registers in systems with churn | 2014-01-13 | Paper |
| A leader election algorithm for dynamic networks with causal clocks | 2013-08-26 | Paper |
| Link Reversal Routing with Binary Link Labels: Work Complexity | 2013-07-24 | Paper |
| Randomized registers and iterative algorithms | 2013-06-07 | Paper |
| Failure detectors encapsulate fairness | 2013-02-04 | Paper |
| Multiwriter Consistency Conditions for Shared Memory Registers | 2011-05-17 | Paper |
| Self-stabilizing clock synchronization in the presence of Byzantine faults | 2011-02-01 | Paper |
| Scheduling sensors by tiling lattices | 2010-09-29 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Crash-Quiescent Failure Detection | 2009-11-19 | Paper |
| Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474124 | 2004-08-04 | Paper |
| The Impact of Timing Knowledge on the Session Problem | 2003-09-28 | Paper |
| Closed form bounds for clock synchronization under simple uncertainty assumptions | 2002-07-14 | Paper |
| A mutual exclusion algorithm for ad hoc mobile networks | 2002-02-27 | Paper |
| One-write algorithms for multivalued regular and atomic registers | 2001-01-03 | Paper |
| A competitive analysis for retransmission timeout | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398822 | 1998-07-26 | Paper |
| Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies | 1998-05-10 | Paper |
| Wait-free clock synchronization | 1998-01-12 | Paper |
| Connection management without retaining information | 1996-02-26 | Paper |
| Bounds on the Costs of Multivalued Register Implementations | 1994-05-10 | Paper |
| A modular drinking philosophers algorithm | 1993-09-16 | Paper |
| Modular construction of an efficient 1-bit Byzantine agreement protocol | 1993-04-01 | Paper |
| Modular construction of a Byzantine agreement protocol with optimal message bit complexity | 1992-06-28 | Paper |
| Transaction commit in a realistic timing model | 1990-01-01 | Paper |
| A new fault-tolerant algorithm for clock synchronization | 1988-01-01 | Paper |
| Simulating synchronous processors | 1987-01-01 | Paper |
