| Publication | Date of Publication | Type |
|---|
| Distributed computing with the Cloud | 2024-04-09 | Paper |
| Distributed Computing with the Cloud | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874252 | 2023-02-07 | Paper |
| The Synergy of Finite State Machines | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090892 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090894 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090908 | 2022-07-21 | Paper |
| Long lived adaptive splitter and applications | 2020-12-03 | Paper |
| Restoration by path concatenation: fast recovery of MPLS paths | 2020-12-03 | Paper |
| On the complexity of global computation in the presence of link failures: the general case | 2020-11-30 | Paper |
| A King in every two consecutive tournaments | 2019-10-21 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| A completeness theorem for a class of synchronization objects | 2017-09-29 | Paper |
| Disentangling multi-object operations (extended abstract) | 2017-09-29 | Paper |
| Consensus power makes (some) sense! (extended abstract) | 2017-09-29 | Paper |
| Delimiting the power of bounded size synchronization objects (extended abstract) | 2017-09-29 | Paper |
| Deterministic Objects | 2017-09-29 | Paper |
| The slide mechanism with applications in dynamic networks | 2017-08-21 | Paper |
| Computing with faulty shared memory | 2017-08-21 | Paper |
| The bit complexity of the predecessor problem | 2016-05-26 | Paper |
| Restoration by path concatenation, fast recovery of MPLS paths | 2016-03-04 | Paper |
| From bounded to unbounded concurrency objects and back | 2015-09-11 | Paper |
| The power of multi-objects (extended abstract) | 2015-09-11 | Paper |
| Distributed computing building blocks for rational agents | 2015-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501787 | 2015-08-14 | Paper |
| Bootstrap network resynchronization (extended abstract) | 2015-06-19 | Paper |
| Common2 extended to stacks and unbounded concurrency | 2015-03-10 | Paper |
| Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract) | 2015-03-03 | Paper |
| Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract) | 2015-03-03 | Paper |
| The CB tree: a practical concurrent self-adjusting search tree | 2015-02-23 | Paper |
| Musical Chairs | 2014-12-22 | Paper |
| Failure detectors in loosely named systems | 2014-12-12 | Paper |
| A simple characterization of asynchronous computations | 2014-12-02 | Paper |
| Beeping a maximal independent set | 2014-03-25 | Paper |
| Fast and scalable rendezvousing | 2014-03-25 | Paper |
| The \(k\)-simultaneous consensus problem | 2013-06-28 | Paper |
| Efficient adaptive collect algorithms | 2013-06-20 | Paper |
| Common2 extended to stacks and unbounded concurrency | 2013-06-20 | Paper |
| CBTree: A Practical Concurrent Self-Adjusting Search Tree | 2013-03-13 | Paper |
| Renaming and the weakest family of failure detectors | 2013-02-04 | Paper |
| Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method | 2012-10-23 | Paper |
| A Biological Solution to a Fundamental Distributed Computing Problem | 2011-11-30 | Paper |
| Beeping a maximal independent set | 2011-10-28 | Paper |
| Oblivious Collaboration | 2011-10-28 | Paper |
| Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus | 2009-11-19 | Paper |
| Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects | 2008-09-09 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| The power of multiobjects. | 2003-01-14 | Paper |
| Local stabilizer | 2002-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234103 | 2002-02-03 | Paper |
| Elections in anonymous networks | 2000-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232879 | 2000-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259994 | 1999-09-08 | Paper |
| The Instancy of Snapshots and Commuting Objects | 1999-08-17 | Paper |
| Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228458 | 1999-03-01 | Paper |
| The local detection paradigm and its applications to self-stabilization | 1998-06-30 | Paper |
| Computing with faulty shared objects | 1998-01-28 | Paper |
| Local management of a global resource in a communication network | 1998-01-19 | Paper |
| Optimal Time–Space Tradeoff for Shared Memory Leader Election | 1998-01-07 | Paper |
| Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
| Self-stabilization over unreliable communication media | 1995-11-22 | Paper |
| Distributed Algorithms For Unidirectional Networks | 1995-04-06 | Paper |
| Atomic snapshots of shared memory | 1994-03-20 | Paper |
| Sparser: A Paradigm for Running Distributed Algorithms | 1993-05-16 | Paper |
| Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks | 1991-01-01 | Paper |
| The power of multimedia: Combining point-to-point and multi-access networks | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790654 | 1988-01-01 | Paper |
