| Publication | Date of Publication | Type |
|---|
| When is Recoverable Consensus Harder Than Consensus? | 2024-03-26 | Paper |
| Optimal algorithms for synchronous Byzantine \(k\)-set agreement | 2023-09-07 | Paper |
| Optimal algorithms for synchronous Byzantine \(k\)-set agreement | 2023-06-12 | Paper |
| k-Immediate Snapshot and x-Set Agreement: How Are They Related? | 2023-03-21 | Paper |
| Communication Complexity of Wait-Free Computability in Dynamic Networks | 2022-09-01 | Paper |
| Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement | 2022-06-08 | Paper |
| The assignment problem | 2021-10-06 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-11-22 | Paper |
| Making local algorithms wait-free: the case of ring coloring | 2019-06-21 | Paper |
| A characterization of \(t\)-resilient colorless task anonymous solvability | 2019-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174928 | 2018-07-18 | Paper |
| Uniform Consensus with Homonyms and Omission Failures | 2016-12-19 | Paper |
| t-Resilient Immediate Snapshot Is Impossible | 2016-12-01 | Paper |
| On the Space Complexity of Set Agreement | 2016-03-23 | Paper |
| A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling | 2016-01-08 | Paper |
| Byzantine agreement with homonyms | 2015-09-11 | Paper |
| On implementing omega with weak reliability and synchrony assumptions | 2015-09-04 | Paper |
| Communication-efficient leader election and consensus with limited link synchrony | 2015-08-03 | Paper |
| The weakest failure detectors to solve certain fundamental problems in distributed computing | 2015-08-03 | Paper |
| Wait-freedom with advice | 2015-03-25 | Paper |
| Fast fault-tolerant agreement algorithms | 2015-03-10 | Paper |
| Sharing is harder than agreeing | 2014-12-12 | Paper |
| Wait-freedom with advice | 2014-12-05 | Paper |
| Linear space bootstrap communication schemes | 2014-12-02 | Paper |
| Partial synchrony based on set timeliness | 2014-07-23 | Paper |
| Byzantine agreement with homonyms | 2014-03-28 | Paper |
| Byzantine agreement with homonyms in synchronous systems | 2014-01-10 | Paper |
| On implementing omega in systems with weak reliability and synchrony assumptions | 2013-06-28 | Paper |
| Partial synchrony based on set timeliness | 2013-02-04 | Paper |
| Stabilizing leader election in partial synchronous systems with crash failures | 2012-03-07 | Paper |
| The disagreement power of an adversary | 2012-02-06 | Paper |
| The minimum information about failures for solving non-local tasks in message-passing systems | 2012-02-06 | Paper |
| Tight failure detection bounds on atomic object implementations | 2010-07-14 | Paper |
| Algorithms for Extracting Timeliness Graphs | 2010-06-17 | Paper |
| The Disagreement Power of an Adversary | 2009-11-19 | Paper |
| The Weakest Failure Detector for Message Passing Set-Agreement | 2008-11-20 | Paper |
| From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors | 2008-09-02 | Paper |
| The perfectly synchronized round-based model of distributed computing | 2007-05-14 | Paper |
| Theoretical Aspects of Computing – ICTAC 2005 | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Mutual exclusion in asynchronous systems with failure detectors | 2005-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437126 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436044 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766882 | 2002-01-28 | Paper |
| Parallélisation d'algorithmes avec un nombre fixe de processeurs | 1990-01-01 | Paper |
| Sémantique asynchrone et comportements infinis en CPS | 1987-01-01 | Paper |
