| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6083397 | 2023-12-08 | Paper |
| Set agreement and renaming in the presence of contention-related crash failures | 2023-08-02 | Paper |
| Reaching agreement in the presence of contention-related crash failures | 2023-06-21 | Paper |
| Reaching consensus in the presence of contention-related crash failures | 2023-06-12 | Paper |
| Anonymous Shared Memory | 2023-04-27 | Paper |
| Election in fully anonymous shared memory systems: tight space bounds and algorithms | 2022-11-11 | Paper |
| Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems | 2022-10-28 | Paper |
| A visit to mutual exclusion in seven dates | 2022-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072481 | 2022-04-28 | Paper |
| The epigenetic consensus problem | 2022-03-22 | Paper |
| Contention-related crash failures: definitions, agreement algorithms, and impossibility results | 2022-03-01 | Paper |
| From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems | 2021-03-15 | Paper |
| Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion | 2021-01-20 | Paper |
| Waiting in concurrent algorithms | 2021-01-15 | Paper |
| Objects shared by Byzantine processes | 2020-12-04 | Paper |
| Fast timing-based algorithms | 2020-12-02 | Paper |
| Leader-based de-anonymization of an anonymous read/write memory | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300817 | 2020-07-30 | Paper |
| The computational structure of progress conditions and shared objects | 2020-04-23 | Paper |
| Mutual exclusion in fully anonymous shared memory systems | 2020-04-03 | Paper |
| Set agreement power is not a precise characterization for oblivious deterministic anonymous objects | 2020-03-03 | Paper |
| Anonymous Read/write memory: leader election and de-anonymization | 2020-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967177 | 2019-07-03 | Paper |
| A closer look at fault tolerance | 2018-07-23 | Paper |
| Coordination Without Prior Agreement | 2017-10-11 | Paper |
| A lower bound on wait-free counting | 2017-09-29 | Paper |
| Disentangling multi-object operations (extended abstract) | 2017-09-29 | Paper |
| Contention---free complexity of shared memory algorithms | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Concurrent counting | 2017-08-21 | Paper |
| Computing with faulty shared memory | 2017-08-21 | Paper |
| Contention-sensitive data structures and algorithms | 2017-05-15 | Paper |
| The computability of relaxed data structures: queues and stacks as examples | 2017-04-04 | Paper |
| Distributed universality | 2016-10-21 | Paper |
| Time-adaptive algorithms for synchronization | 2016-09-01 | Paper |
| The concurrency hierarchy, and algorithms for unbounded concurrency | 2016-03-04 | Paper |
| The Computability of Relaxed Data Structures: Queues and Stacks as Examples | 2016-01-08 | Paper |
| Sequentially consistent versus linearizable counting networks | 2015-09-11 | Paper |
| The power of multi-objects (extended abstract) | 2015-09-11 | Paper |
| Automatic discovery of mutual exclusion algorithms | 2015-09-04 | Paper |
| Knowledge in shared memory systems (preliminary version) | 2015-06-19 | Paper |
| On asymmetric progress conditions | 2015-03-02 | Paper |
| Distributed Universality | 2015-02-10 | Paper |
| A closer look at fault tolerance | 2014-12-05 | Paper |
| Tight space bounds for \(\ell\)-exclusion | 2014-07-11 | Paper |
| Computing with infinitely many processes | 2014-01-10 | Paper |
| Sequentially consistent versus linearizable counting networks | 2013-06-28 | Paper |
| Tight bounds for shared memory systems accessed by Byzantine processes | 2013-06-07 | Paper |
| Tight Space Bounds for ℓ-Exclusion | 2011-10-28 | Paper |
| The Computational Structure of Progress Conditions | 2010-09-10 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Contention-Sensitive Data Structures and Algorithms | 2009-11-19 | Paper |
| Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms | 2008-09-02 | Paper |
| The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437125 | 2003-12-07 | Paper |
| Public data structures: counters as a special case. | 2003-01-21 | Paper |
| The power of multiobjects. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766871 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766890 | 2002-01-28 | Paper |
| Impossibility results in the presence of multiple faulty processes | 2000-08-02 | Paper |
| A Lower Bound on Wait-Free Counting | 1998-05-25 | Paper |
| Computing with faulty shared objects | 1998-01-28 | Paper |
| The Wakeup Problem | 1997-06-09 | Paper |
| Time-Adaptive Algorithms for Synchronization | 1997-05-26 | Paper |
| Concurrent counting | 1997-03-31 | Paper |
| Contention-free complexity of shared memory algorithms | 1996-12-12 | Paper |
| A connection between random variables and latin \(k\)-cubes | 1996-08-18 | Paper |
| Knowledge in shared memory systems. | 1995-11-22 | Paper |
| Possibility and impossibility results in a shared memory environment | 1995-11-19 | Paper |
| Speeding Lamport's fast mutual exclusion algorithm | 1993-05-16 | Paper |
| Space-efficient asynchronous consensus without shared memory initialization | 1993-05-16 | Paper |
| On the nonexistence of resilient consensus protocols | 1991-01-01 | Paper |
| Initial failures in distributed computations | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355219 | 1989-01-01 | Paper |
| Leader election in the presence of n-1 initial failures | 1989-01-01 | Paper |
| Script: A communication abstraction mechanism and its verification | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700822 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343421 | 1984-01-01 | Paper |
