| Publication | Date of Publication | Type |
|---|
| Synchronous \(t\)-resilient consensus in arbitrary graphs | 2024-04-19 | Paper |
| Synchronous \(t\)-resilient consensus in arbitrary graphs | 2023-05-19 | Paper |
| Decentralized Asynchronous Crash-resilient Runtime Verification | 2023-04-27 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity | 2023-03-14 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity | 2023-02-03 | Paper |
| Agreeing within a few writes | 2022-06-13 | Paper |
| Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity | 2021-03-15 | Paper |
| A topological perspective on distributed network algorithms | 2020-12-15 | Paper |
| Perfect failure detection with very few bits | 2020-12-15 | Paper |
| A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring | 2020-03-06 | Paper |
| A topological perspective on distributed network algorithms | 2020-03-03 | Paper |
| Perfect failure detection with very few bits | 2019-11-22 | Paper |
| Anonymity-preserving failure detectors | 2018-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608668 | 2018-03-21 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom | 2016-10-17 | Paper |
| Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings | 2016-05-03 | Paper |
| Irreducibility and additivity of set agreement-oriented failure detector classes | 2015-03-10 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom | 2014-12-05 | Paper |
| Locality and checkability in wait-free computing | 2014-03-25 | Paper |
| Failure detectors are schedulers | 2014-03-13 | 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 |
| Generating fast indulgent algorithms | 2012-12-07 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement | 2012-04-26 | Paper |
| Locality and Checkability in Wait-Free Computing | 2011-10-28 | 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 |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement | 2009-12-17 | Paper |
| Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound | 2009-12-01 | Paper |
| The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement | 2009-08-20 | 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 |
| How to Solve Consensus in the Smallest Window of Synchrony | 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 |
| 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 |
