| Publication | Date of Publication | Type |
|---|
| Software transactional memory | 2020-12-02 | Paper |
| Linearizable counting networks | 2020-11-30 | Paper |
| A complexity-based classification for multiprocessor synchronization | 2020-04-23 | Paper |
| Are Lock-Free Concurrent Algorithms Practically Wait-Free? | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643874 | 2018-05-29 | Paper |
| On the space complexity of randomized synchronization | 2017-09-29 | Paper |
| Software transactional memory | 2017-09-29 | Paper |
| A wait-free sorting algorithm | 2017-09-29 | Paper |
| Towards a topological characterization of asynchronous complexity | 2017-09-29 | Paper |
| A Complexity-Based Hierarchy for Multiprocessor Synchronization | 2017-09-29 | Paper |
| The computability of relaxed data structures: queues and stacks as examples | 2017-04-04 | Paper |
| A simple constructive computability theorem for wait-free computation | 2016-09-01 | Paper |
| The Computability of Relaxed Data Structures: Queues and Stacks as Examples | 2016-01-08 | Paper |
| Counting networks are practically linearizable | 2015-09-11 | Paper |
| Operation-valency and the cost of coordination | 2015-09-04 | Paper |
| Split-ordered lists | 2015-09-04 | Paper |
| Balls-into-leaves | 2015-09-03 | Paper |
| On the inherent weakness of conditional synchronization primitives | 2015-08-03 | Paper |
| Are Lock-Free Concurrent Algorithms Practically Wait-Free? | 2015-06-26 | Paper |
| The asynchronous computability theorem for t-resilient tasks | 2015-05-07 | Paper |
| The SkipTrie | 2015-03-02 | Paper |
| Leaplist | 2015-03-02 | Paper |
| Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints | 2014-11-19 | Paper |
| Non-blocking steal-half work queues | 2014-07-25 | Paper |
| Solo-valency and the cost of coordination | 2013-06-28 | Paper |
| An optimistic approach to lock-free FIFO queues | 2013-06-20 | Paper |
| On the inherent weakness of conditional primitives | 2013-06-13 | Paper |
| A dynamic-sized nonblocking work stealing deque | 2013-06-07 | Paper |
| Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method | 2012-10-23 | Paper |
| On the Inherent Sequentiality of Concurrent Objects | 2012-09-12 | Paper |
| A scalable lock-free stack algorithm | 2012-03-07 | Paper |
| Transactional Mutex Locks | 2010-10-22 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Nonblocking \(k\)-compare-single-swap | 2009-08-06 | Paper |
| Split-ordered lists | 2008-12-21 | Paper |
| Hopscotch Hashing | 2008-11-20 | Paper |
| A Simple Optimistic Skiplist Algorithm | 2007-11-15 | Paper |
| Toward a Topological Characterization of Asynchronous Complexity | 2007-05-03 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Virtual leashing: creating a computational foundation for software protection | 2006-10-10 | Paper |
| An Optimistic Approach to Lock-Free FIFO Queues | 2005-08-17 | Paper |
| On the space complexity of randomized synchronization | 2005-01-25 | Paper |
| The topological structure of asynchronous computability | 2005-01-25 | Paper |
| A wait-free sorting algorithm | 2002-09-29 | Paper |
| Towards a practical snapshot algorithm | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766861 | 2002-01-28 | Paper |
| Combining funnels: A dynamic approach to software combining | 2001-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709236 | 2001-05-15 | Paper |
| Timing conditions for linearizability in uniform counting networks | 1999-06-21 | Paper |
| A steady state analysis of diffracting trees | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209170 | 1998-10-14 | Paper |
| Elimination trees and the construction of pools and stacks | 1998-08-03 | Paper |
| Bounded Concurrent Time-Stamping | 1997-05-26 | Paper |
| Slide—The Key to Polynomial End-to-End Communication | 1997-03-18 | Paper |
| Counting networks | 1995-02-20 | Paper |
| Are wait-free algorithms fast? | 1994-11-03 | Paper |
| Atomic snapshots of shared memory | 1994-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138972 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725535 | 1986-01-01 | Paper |
