| Publication | Date of Publication | Type |
|---|
| Lower bounds on the amortized time complexity of shared objects | 2024-11-12 | Paper |
| Efficient and robust sharing of memory in message-passing systems (extended abstract) | 2024-07-11 | Paper |
| The combinatorial structure of wait-free solvable tasks (extended abstract) | 2024-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128600 | 2024-04-15 | Paper |
| Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083367 | 2023-12-08 | Paper |
| Asynchronous fully-decentralized SGD in the cluster-based model | 2023-10-04 | Paper |
| Privatization-safe transactional memories | 2023-02-03 | Paper |
| Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects | 2023-02-03 | Paper |
| Store-collect in the presence of continuous churn with application to snapshots and lattice agreement | 2022-06-08 | Paper |
| Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement | 2021-03-15 | Paper |
| Specification and space complexity of collaborative text editing | 2021-01-25 | Paper |
| Adaptive and efficient mutual exclusion | 2020-12-03 | Paper |
| An adaptive collect algorithm with applications | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5137348 | 2020-12-02 | Paper |
| Counting networks with arbitrary fan-out | 2020-11-30 | Paper |
| Atomic snapshots using lattice agreement | 2020-11-30 | Paper |
| Shared memory and the Bakery algorithm | 2020-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300815 | 2020-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300819 | 2020-07-30 | Paper |
| Nesting-Safe Recoverable Linearizability | 2019-09-19 | Paper |
| Separating Lock-Freedom from Wait-Freedom | 2019-09-19 | Paper |
| Erratum | 2019-02-25 | Paper |
| Bounds on the Step and Namespace Complexity of Renaming | 2019-01-14 | Paper |
| Simulating a shared register in an asynchronous system that never stops changing (extended abstract) | 2018-08-24 | Paper |
| Lower bound on the step complexity of anonymous binary consensus | 2018-08-16 | Paper |
| Characterizing Transactional Memory Consistency Conditions Using Observational Refinement | 2018-08-02 | Paper |
| Impossibility Results for Distributed Computing | 2018-06-19 | Paper |
| The Cost of Privatization in Software Transactional Memory | 2017-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363822 | 2017-09-29 | Paper |
| Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives | 2017-09-29 | Paper |
| Atomic snapshots in O(n log n) operations | 2017-09-29 | Paper |
| Optimal clock synchronization under different delay assumptions | 2017-09-29 | Paper |
| Specification and Complexity of Collaborative Text Editing | 2017-09-29 | Paper |
| Packet-Mode Emulation of Output-Queued Switches | 2017-07-27 | Paper |
| Time-adaptive algorithms for synchronization | 2016-09-01 | Paper |
| Lower bounds for restricted-use objects | 2016-06-16 | Paper |
| Trading fences with RMRs and separating memory models | 2016-03-23 | Paper |
| Limitations of highly-available eventually-consistent data stores | 2016-03-23 | Paper |
| Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) | 2016-03-02 | Paper |
| Algorithms adapting to point contention | 2015-11-12 | Paper |
| The complexity of obstruction-free implementations | 2015-11-11 | Paper |
| Tight bounds for asynchronous randomized consensus | 2015-11-11 | Paper |
| Improved implementations of binary universal operations | 2015-10-30 | Paper |
| Universal operations | 2015-09-11 | Paper |
| Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity | 2015-08-14 | Paper |
| Lower bounds for adaptive collect and related objects | 2015-08-03 | Paper |
| Sequential verification of serializability | 2015-06-11 | Paper |
| Transactional contention management as a non-clairvoyant scheduling problem | 2015-03-10 | Paper |
| Synchronizing without locks is inherently expensive | 2015-03-10 | Paper |
| Adaptive and efficient mutual exclusion (extended abstract) | 2015-03-03 | Paper |
| An O(1)-barriers optimal RMRs mutual exclusion algorithm | 2015-03-02 | Paper |
| Upper bound on the complexity of solving hard renaming | 2015-03-02 | Paper |
| A programming language perspective on transactional memory consistency | 2015-03-02 | Paper |
| Practically stabilizing SWMR atomic memory in message-passing systems | 2015-02-20 | Paper |
| Randomized consensus in expected O(n log n) individual work | 2014-12-12 | Paper |
| Lower bounds for randomized consensus under a weak adversary | 2014-12-12 | Paper |
| Faster than optimal snapshots (for a while) | 2014-12-05 | Paper |
| Max registers, counters, and monotone circuits | 2014-07-23 | Paper |
| Laws of order | 2014-04-10 | Paper |
| The power of DCAS | 2014-03-13 | Paper |
| The complexity of updating multi-writer snapshot objects | 2014-03-13 | Paper |
| Polylogarithmic concurrent data structures from monotone circuits | 2014-02-17 | Paper |
| A non-topological proof for the impossibility of \(k\)-set agreement | 2014-01-13 | Paper |
| Built-in coloring for highly-concurrent doubly-linked lists | 2013-08-01 | Paper |
| Efficient adaptive collect using randomization | 2013-06-07 | Paper |
| Counting-Based Impossibility Proofs for Renaming and Set Agreement | 2013-03-13 | Paper |
| Inherent limitations on disjoint-access parallel implementations of transactional memory | 2012-12-10 | Paper |
| A single-version STM that is multi-versioned permissive | 2012-12-07 | Paper |
| Transactional scheduling for read-dominated workloads | 2012-10-23 | Paper |
| Combining shared-coin algorithms | 2012-03-07 | Paper |
| The complexity of updating snapshot objects | 2012-02-14 | Paper |
| Structured Derivation of Semi-Synchronous Algorithms | 2011-10-28 | Paper |
| Lower Bounds for Randomized Consensus under a Weak Adversary | 2011-04-04 | Paper |
| Highly concurrent multi-word synchronization | 2011-03-14 | Paper |
| Fast Randomized Test-and-Set and Renaming | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568108 | 2010-06-17 | Paper |
| Transactional contention management as a Non-clairvoyant scheduling problem | 2010-03-04 | Paper |
| Adapting to Point Contention with Long-Lived Safe Agreement | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549610 | 2009-01-05 | Paper |
| Randomization Does Not Reduce the Average Delay in Parallel Packet Switches | 2008-10-28 | Paper |
| Built-In Coloring for Highly-Concurrent Doubly-Linked Lists | 2008-09-09 | Paper |
| Highly-Concurrent Multi-word Synchronization | 2008-03-06 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Efficient Adaptive Collect Using Randomization | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673400 | 2005-04-29 | Paper |
| Quantifying rollback propagation in distributed checkpointing | 2004-10-04 | Paper |
| Tight bounds for FEC-based reliable multicast | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437135 | 2003-12-07 | Paper |
| Computing in totally anonymous asynchronous shared memory systems | 2003-01-14 | Paper |
| The Combinatorial Structure of Wait-Free Solvable Tasks | 2002-09-29 | Paper |
| Time bounds for decision problems in the presence of timing uncertainty and failures | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766870 | 2002-06-25 | Paper |
| Adaptive and efficient algorithms for lattice agreement and renaming | 2002-04-23 | Paper |
| Efficient and Robust Sharing of Memory in Message-Passing Systems | 2000-03-16 | Paper |
| Local Labeling and Resource Allocation Using Preprocessing | 1999-10-28 | Paper |
| A Correctness Condition for High-Performance Multiprocessors | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398822 | 1998-07-26 | Paper |
| Atomic Snapshots in O (n log n) Operations | 1998-05-10 | Paper |
| Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies | 1998-05-10 | Paper |
| Sharing memory robustly in message-passing systems | 1998-02-02 | Paper |
| Time-Adaptive Algorithms for Synchronization | 1997-05-26 | Paper |
| Limitations of fast consistency conditions for distributed shared memories | 1997-02-27 | Paper |
| Optimal Clock Synchronization under Different Delay Assumptions | 1996-08-18 | Paper |
| Connection management without retaining information | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763397 | 1995-04-11 | Paper |
| Are wait-free algorithms fast? | 1994-11-03 | Paper |
| Efficiency of semisynchronous versus asynchronous networks | 1994-10-30 | Paper |
| Bounds on the time to reach agreement in the presence of timing uncertainty | 1994-06-29 | Paper |
| Time bounds for real-time process control in the presence of timing uncertainty | 1994-06-09 | Paper |
| Atomic snapshots of shared memory | 1994-03-20 | Paper |
| Using mappings to prove timing properties | 1993-01-16 | Paper |
| Better computing on the anonymous ring | 1991-01-01 | Paper |
| Renaming in an asynchronous environment | 1990-01-01 | Paper |
| Efficient elections in chordal ring networks | 1989-01-01 | Paper |
| Computing on an anonymous ring | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787480 | 1988-01-01 | Paper |
| Language complexity on the synchronous anonymous ring | 1987-01-01 | Paper |
