| Publication | Date of Publication | Type |
|---|
| Bee's strategy against Byzantines. Replacing Byzantine participants (extended abstract) | 2023-08-02 | Paper |
| A class of high performance Maekawa-type algorithms for distributed systems under heavy demand | 2020-11-30 | Paper |
| A positive acknowledgment protocol for causal broadcasting | 2018-07-09 | Paper |
| On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern | 2018-06-12 | Paper |
| Non trivial computations in anonymous dynamic networks | 2017-09-29 | Paper |
| Efficient Notification Ordering for Geo-Distributed Pub/Sub Systems | 2017-05-16 | Paper |
| Exploiting intra-object dependencies in parallel simulation | 2016-06-16 | Paper |
| Implementing set objects in dynamic distributed systems | 2016-04-18 | Paper |
| Rollback-dependency trackability | 2015-09-11 | Paper |
| Solvability of geocasting in mobile ad-hoc networks | 2014-03-13 | Paper |
| A protocol for implementing Byzantine storage in churn-prone distributed systems | 2014-01-13 | Paper |
| Optimal propagation-based protocols implementing causal memories | 2013-06-13 | Paper |
| On the uniformity of peer sampling based on view shuffling | 2011-08-19 | Paper |
| The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost | 2011-03-14 | Paper |
| A robust and energy efficient protocol for random walk in ad hoc networks with IEEE 802.11 | 2010-12-22 | 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 |
| Investigating the existence and the regularity of logarithmic Harary graphs | 2009-05-28 | Paper |
| Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks | 2008-09-02 | Paper |
| Distributed Computing – IWDC 2005 | 2006-10-10 | Paper |
| A classification of total order specifications and its application to fixed sequencer-based implementations | 2006-05-22 | Paper |
| The Driving Philosophers | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813105 | 2004-08-12 | Paper |
| Consensus in Byzantine asynchronous systems | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426590 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413725 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413420 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411639 | 2003-07-09 | Paper |
| On the minimal information to encode timestamps in distributed computations. | 2003-01-21 | Paper |
| Rollback-dependency trackability: A minimal characterization and its protocol | 2003-01-14 | Paper |
| Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property | 2002-07-14 | Paper |
| On the no-Z-cycle property in distributed executions | 2001-10-21 | Paper |
| Consistent checkpointing for transaction systems | 2001-10-14 | Paper |
| Slotted-FIFO Communication for Asynchronous Distributed Systems | 1999-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4244541 | 1999-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208325 | 1999-01-11 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4380844 | 1998-07-27 | Paper |
| Adaptive checkpointing in message passing distributed systems | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4889460 | 1997-01-22 | Paper |
| On the correctness of Goscinski's algorithm | 1995-09-24 | Paper |
| Distributed algorithms for multiple entries to a critical section with priority | 1994-07-18 | Paper |
