| Publication | Date of Publication | Type |
|---|
| Hedging Against Sore Loser Attacks in Cross-Chain Transactions | 2024-03-26 | Paper |
| Brief Announcement: Linearizability: A Typo | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083405 | 2023-12-08 | Paper |
| Flexible scheduling of transactional memory on trees | 2023-10-12 | Paper |
| Load balanced distributed directories | 2023-08-02 | Paper |
| Clairvoyant state machine replications | 2023-08-02 | Paper |
| Flexible scheduling of transactional memory on trees | 2023-06-12 | Paper |
| Invited paper: Cross-chain state machine replication | 2023-06-12 | Paper |
| Load balanced distributed directories | 2022-05-17 | Paper |
| Clairvoyant state machine replication | 2022-05-17 | Paper |
| Dynamic scheduling in distributed transactional memory | 2022-04-01 | Paper |
| Time-communication impossibility results for distributed transactional memory | 2022-02-15 | Paper |
| Fast scheduling in distributed transactional memory | 2021-06-24 | Paper |
| Read-modify-write networks | 2020-12-04 | Paper |
| Atomic snapshots using lattice agreement | 2020-11-30 | Paper |
| Linearizable counting networks | 2020-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305190 | 2020-08-06 | Paper |
| Adding concurrency to smart contracts | 2020-06-15 | Paper |
| Atomic Cross-Chain Swaps | 2019-09-19 | Paper |
| Bounds on the Step and Namespace Complexity of Renaming | 2019-01-14 | Paper |
| An algorithmic approach to the asynchronous computability theorem | 2018-11-06 | Paper |
| Asynchronous computability theorems for \(t\)-resilient systems | 2018-08-16 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| On the space complexity of randomized synchronization | 2017-09-29 | Paper |
| Set consensus using arbitrary objects (preliminary version) | 2017-09-29 | Paper |
| Algebraic spans | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363804 | 2017-09-29 | Paper |
| Bounded round number | 2017-09-29 | Paper |
| From wait-free to arbitrary concurrent solo executions in colorless distributed computing | 2017-05-22 | Paper |
| A simple constructive computability theorem for wait-free computation | 2016-09-01 | Paper |
| An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems | 2016-06-06 | Paper |
| Impossibility Results for Distributed Transactional Memory | 2016-03-23 | Paper |
| Competitive concurrent distributed queuing | 2016-03-04 | Paper |
| Unifying synchronous and asynchronous message-passing models | 2016-03-02 | Paper |
| Multidimensional agreement in Byzantine systems | 2016-01-06 | Paper |
| Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions | 2015-09-11 | Paper |
| tight bounds for k-set agreement with limited-scope failure detectors | 2015-09-04 | Paper |
| The future(s) of shared data structures | 2015-09-03 | Paper |
| Distributed computability in Byzantine asynchronous systems | 2015-06-26 | Paper |
| Randomized wait-free concurrent objects (extended abstract) | 2015-06-19 | Paper |
| Coarse-grained transactions | 2015-06-11 | Paper |
| The asynchronous computability theorem for t-resilient tasks | 2015-05-07 | Paper |
| Contention in shared memory algorithms | 2015-05-07 | Paper |
| Toward a theory of transactional contention managers | 2015-03-10 | Paper |
| Upper bound on the complexity of solving hard renaming | 2015-03-02 | Paper |
| The topology of shared-memory adversaries | 2015-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5498755 | 2015-02-11 | Paper |
| An equivariance theorem with applications to renaming | 2015-01-19 | Paper |
| Simulations and reductions for colorless tasks | 2014-12-05 | Paper |
| Hard-Potato routing | 2014-09-26 | Paper |
| Multidimensional approximate agreement in Byzantine asynchronous systems | 2014-08-07 | Paper |
| Sporadic Solutions to Zero-One Exclusion Tasks | 2014-07-01 | Paper |
| Computing in the Presence of Concurrent Solo Executions | 2014-03-31 | Paper |
| On the weakest failure detector ever | 2014-03-13 | Paper |
| Power and limits of distributed computing shared memory models | 2014-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843926 | 2013-08-27 | Paper |
| The topology of distributed adversaries | 2013-08-26 | Paper |
| On the weakest failure detector ever | 2013-06-28 | Paper |
| Distributed transactional memory for metric-space networks | 2013-06-20 | Paper |
| Self-stabilizing smoothing and balancing networks | 2013-06-13 | Paper |
| Tight bounds for \(k\)-set agreement with limited-scope failure detectors | 2013-06-07 | Paper |
| An Equivariance Theorem with Applications to Renaming | 2012-06-29 | Paper |
| Embedded-TM: energy and complexity-effective hardware transactional memory for embedded multicore systems | 2012-03-07 | Paper |
| Threshold protocols in survivor set systems | 2012-02-06 | Paper |
| Concurrent Computing and Shellable Complexes | 2010-09-10 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3397631 | 2009-09-22 | Paper |
| A topological treatment of early-deciding set-agreement | 2009-03-02 | Paper |
| A Topological Treatment of Early-Deciding Set-Agreement | 2009-01-29 | Paper |
| Optimizing Threshold Protocols in Adversarial Structures | 2008-11-20 | Paper |
| Hopscotch Hashing | 2008-11-20 | Paper |
| Subconsensus Tasks: Renaming Is Weaker Than Set Agreement | 2008-09-09 | Paper |
| A Simple Optimistic Skiplist Algorithm | 2007-11-15 | Paper |
| Dynamic analysis of the arrow distributed protocol | 2007-01-25 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Virtual leashing: creating a computational foundation for software protection | 2006-10-10 | Paper |
| Randomized smoothing networks | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668734 | 2005-04-15 | Paper |
| On the space complexity of randomized synchronization | 2005-01-25 | Paper |
| The topological structure of asynchronous computability | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437136 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436047 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436053 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436061 | 2003-11-23 | Paper |
| A classification of wait-free loop agreement tasks | 2003-05-14 | Paper |
| Sorting and counting networks of arbitrary width and small depth | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2783230 | 2002-06-02 | Paper |
| Threshold counters with increments and decrements | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503829 | 2001-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709236 | 2001-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2703723 | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527026 | 2001-02-28 | Paper |
| Algebraic spans | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941899 | 2000-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952652 | 2000-05-10 | Paper |
| Time-Lapse Snapshots | 1999-10-28 | Paper |
| Wait-free implementations in message-passing systems | 1999-06-21 | Paper |
| Contention in shared memory algorithms | 1998-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209170 | 1998-10-14 | Paper |
| Counting networks | 1995-02-20 | Paper |
| On the correctness of orphan management algorithms | 1994-08-21 | Paper |
| Hybrid concurrency control for abstract data types | 1992-06-25 | Paper |
| Concurrency and availability as dual properties of replicated atomic data | 1990-01-01 | Paper |
| Fast randomized consensus using shared memory | 1990-01-01 | Paper |
| A Value Transmission Method for Abstract Data Types | 1982-01-01 | Paper |
