| Publication | Date of Publication | Type |
|---|
| Stellar consensus by instantiation | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090908 | 2022-07-21 | Paper |
| The assignment problem | 2021-10-06 | Paper |
| Disk Paxos | 2020-12-04 | Paper |
| The BG distributed simulation algorithm | 2020-12-03 | Paper |
| An adaptive collect algorithm with applications | 2020-12-03 | Paper |
| A King in every two consecutive tournaments | 2019-10-21 | Paper |
| An algorithmic approach to the asynchronous computability theorem | 2018-11-06 | Paper |
| Elastic configuration maintenance via a parsimonious speculating snapshot solution | 2018-08-24 | Paper |
| Asynchronous computability theorems for \(t\)-resilient systems | 2018-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174928 | 2018-07-18 | Paper |
| A simple algorithmically reasoned characterization of wait-free computation (extended abstract) | 2017-09-29 | Paper |
| Immediate atomic snapshots and fast renaming | 2017-09-29 | Paper |
| Consensus power makes (some) sense! (extended abstract) | 2017-09-29 | Paper |
| Deterministic Objects | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| The slide mechanism with applications in dynamic networks | 2017-08-21 | Paper |
| Asynchronous Coordination Under Preferences and Constraints | 2016-12-01 | Paper |
| The concurrency hierarchy, and algorithms for unbounded concurrency | 2016-03-04 | Paper |
| Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony | 2016-03-02 | Paper |
| Structured derivations of consensus algorithms for failure detectors | 2016-03-02 | Paper |
| Analysis of timing-based mutual exclusion with random times | 2015-09-11 | Paper |
| A generalized asynchronous computability theorem | 2015-09-03 | Paper |
| Bootstrap network resynchronization (extended abstract) | 2015-06-19 | Paper |
| Generalized FLP impossibility result for t-resilient asynchronous computations | 2015-05-07 | Paper |
| Wait-freedom with advice | 2015-03-25 | Paper |
| Common2 extended to stacks and unbounded concurrency | 2015-03-10 | Paper |
| The extended BG-simulation and the characterization of t-resiliency | 2015-02-04 | Paper |
| Musical Chairs | 2014-12-22 | Paper |
| Wait-freedom with advice | 2014-12-05 | Paper |
| A simple characterization of asynchronous computations | 2014-12-02 | Paper |
| Linear space bootstrap communication schemes | 2014-12-02 | Paper |
| The weakest failure detector for solving k-set agreement | 2014-07-23 | Paper |
| Sporadic Solutions to Zero-One Exclusion Tasks | 2014-07-01 | Paper |
| The \(k\)-simultaneous consensus problem | 2013-06-28 | Paper |
| Renaming in synchronous message passing systems with Byzantine failures | 2013-06-20 | Paper |
| Common2 extended to stacks and unbounded concurrency | 2013-06-20 | Paper |
| The mailbox problem | 2012-02-06 | Paper |
| On set consensus numbers | 2012-02-06 | Paper |
| Oblivious Collaboration | 2011-10-28 | Paper |
| Generalized Universality | 2011-09-02 | Paper |
| The Complexity of Early Deciding Set Agreement | 2011-05-17 | Paper |
| From a static impossibility to an adaptive lower bound | 2010-08-16 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| On Set Consensus Numbers | 2009-11-19 | Paper |
| Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus | 2009-11-19 | Paper |
| From adaptive renaming to set agreement | 2009-03-30 | Paper |
| The Mailbox Problem | 2008-11-20 | Paper |
| The Committee Decision Problem | 2008-09-18 | Paper |
| Subconsensus Tasks: Renaming Is Weaker Than Set Agreement | 2008-09-09 | Paper |
| N-Consensus is the Second Strongest Object for N + 1 Processes | 2008-04-22 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Group-Solvability | 2005-08-17 | Paper |
| Analysis of timing-based mutual exclusion with random times | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766889 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941866 | 2000-03-19 | Paper |
| Three-Processor Tasks Are Undecidable | 1999-02-22 | Paper |
| Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
| Distributed Algorithms For Unidirectional Networks | 1995-04-06 | Paper |
| Atomic snapshots of shared memory | 1994-03-20 | Paper |
| Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks | 1991-01-01 | Paper |
| On separating the EREW and CREW PRAM models | 1989-01-01 | Paper |
| Sorting in constant number of row and column phases on a mesh | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793716 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790654 | 1988-01-01 | Paper |
| Asymptotic optimality of shortest path routing algorithms | 1987-01-01 | Paper |
| Distributed sorting algorithms for multi-channel broadcast networks | 1987-01-01 | Paper |
| Two-Metric Projection Methods for Constrained Optimization | 1984-01-01 | Paper |
| Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks | 1984-01-01 | Paper |
| Dynamic control of session input rates in communication networks | 1984-01-01 | Paper |
| Projected Newton methods and optimization of multicommodity flows | 1983-01-01 | Paper |
| Projection methods for variational inequalities with application to the traffic assignment problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864317 | 1979-01-01 | Paper |
