| Publication | Date of Publication | Type |
|---|
| Locally solvable tasks and the limitations of valency arguments | 2026-03-31 | Paper |
| Optimal resilience in systems that mix shared memory and message passing | 2026-03-31 | Paper |
Preserving hyperproperties of programs using primitives with consensus number 2
Acta Informatica | 2025-08-22 | Paper |
| Faithful simulation of randomized BFT protocols on block DAGs | 2025-06-26 | Paper |
| Strong linearizability using primitives with consensus number 2 | 2025-06-13 | Paper |
| History-independent concurrent objects | 2025-06-13 | Paper |
Asynchronous fully-decentralized SGD in the cluster-based model
Theoretical Computer Science | 2025-02-18 | Paper |
Lower bounds on the amortized time complexity of shared objects
Theory of Computing Systems | 2024-11-12 | Paper |
| The combinatorial structure of wait-free solvable tasks (extended abstract) | 2024-07-11 | Paper |
| Efficient and robust sharing of memory in message-passing systems (extended abstract) | 2024-07-11 | Paper |
| scientific article; zbMATH DE number 7832770 (Why is no real title available?) | 2024-04-15 | Paper |
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774258 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
Asynchronous fully-decentralized SGD in the cluster-based model
Lecture Notes in Computer Science | 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
Information and Computation | 2022-06-08 | Paper |
Brief announcement: Collect in the presence of continuous churn with application to snapshots and lattice agreement
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Specification and space complexity of collaborative text editing
Theoretical Computer Science | 2021-01-25 | Paper |
Adaptive and efficient mutual exclusion
Distributed Computing | 2020-12-03 | Paper |
An adaptive collect algorithm with applications
Distributed Computing | 2020-12-03 | Paper |
| The level of handshake required for managing a connection | 2020-12-02 | Paper |
Counting networks with arbitrary fan-out
Distributed Computing | 2020-11-30 | Paper |
Atomic snapshots using lattice agreement
Distributed Computing | 2020-11-30 | Paper |
Shared memory and the Bakery algorithm
Concurrency: the Works of Leslie Lamport | 2020-11-10 | Paper |
| Lower bounds on the amortized time complexity of shared objects | 2020-07-30 | Paper |
| Remote memory references at block granularity | 2020-07-30 | Paper |
Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Separating Lock-Freedom from Wait-Freedom
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Erratum to: ``Limited-use atomic snapshots with polylogarithmic step complexity''
Journal of the ACM | 2019-02-25 | Paper |
Bounds on the step and namespace complexity of renaming
SIAM Journal on Computing | 2019-01-14 | Paper |
Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
(available as arXiv preprint) | 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
Journal of the ACM | 2018-08-02 | Paper |
Impossibility results for distributed computing
Synthesis Lectures on Distributed Computing Theory | 2018-06-19 | Paper |
The Cost of Privatization in Software Transactional Memory
IEEE Transactions on Computers | 2017-10-19 | Paper |
Atomic snapshots in <i>O(n</i> log <i>n)</i> operations
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Optimal clock synchronization under different delay assumptions
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Specification and complexity of collaborative text editing
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Nontrivial and universal helping for wait-free queues and stacks | 2017-09-29 | Paper |
| Poly-logarithmic adaptive algorithms require unconditional primitives | 2017-09-29 | Paper |
Packet-Mode Emulation of Output-Queued Switches
IEEE Transactions on Computers | 2017-07-27 | Paper |
Time-adaptive algorithms for synchronization
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Lower bounds for restricted-use objects
SIAM Journal on Computing | 2016-06-16 | Paper |
Limitations of highly-available eventually-consistent data stores
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Trading fences with RMRs and separating memory models
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Algorithms adapting to point contention
Journal of the ACM | 2015-11-12 | Paper |
The complexity of obstruction-free implementations
Journal of the ACM | 2015-11-11 | Paper |
Tight bounds for asynchronous randomized consensus
Journal of the ACM | 2015-11-11 | Paper |
Improved implementations of binary universal operations
Journal of the ACM | 2015-10-30 | Paper |
Universal operations
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Limited-use atomic snapshots with polylogarithmic step complexity
Journal of the ACM | 2015-08-14 | Paper |
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Sequential verification of serializability
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Synchronizing without locks is inherently expensive
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
A programming language perspective on transactional memory consistency
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Practically stabilizing SWMR atomic memory in message-passing systems
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Randomized consensus in expected O(n n) individual work
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Faster than optimal snapshots (for a while), preliminary version
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
MAX registers, counters, and monotone circuits
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
The power of DCAS, highly-concurrent software transactional memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
The complexity of updating multi-writer snapshot objects
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Polylogarithmic concurrent data structures from monotone circuits
Journal of the ACM | 2014-02-17 | Paper |
A non-topological proof for the impossibility of \(k\)-set agreement
Theoretical Computer Science | 2014-01-13 | Paper |
Built-in coloring for highly-concurrent doubly-linked lists
Theory of Computing Systems | 2013-08-01 | Paper |
Efficient adaptive collect using randomization
Distributed Computing | 2013-06-07 | Paper |
Counting-based impossibility proofs for renaming and set agreement
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Inherent limitations on disjoint-access parallel implementations of transactional memory
Theory of Computing Systems | 2012-12-10 | Paper |
A single-version STM that is multi-versioned permissive
Theory of Computing Systems | 2012-12-07 | Paper |
Transactional scheduling for read-dominated workloads
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
Combining shared-coin algorithms
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
The complexity of updating snapshot objects
Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
Structured Derivation of Semi-Synchronous Algorithms
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Lower bounds for randomized consensus under a weak adversary
SIAM Journal on Computing | 2011-04-04 | Paper |
Highly concurrent multi-word synchronization
Theoretical Computer Science | 2011-03-14 | Paper |
Fast randomized test-and-set and renaming
Lecture Notes in Computer Science | 2010-09-10 | Paper |
| Robust simulation of shared memory: 20 years after | 2010-06-17 | Paper |
Transactional contention management as a Non-clairvoyant scheduling problem
Algorithmica | 2010-03-04 | Paper |
Adapting to Point Contention with Long-Lived Safe Agreement
Structural Information and Communication Complexity | 2009-03-12 | Paper |
| Tight bounds for asynchronous randomized consensus | 2009-01-05 | Paper |
Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
SIAM Journal on Computing | 2008-10-28 | Paper |
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Highly-Concurrent Multi-word Synchronization
Distributed Computing and Networking | 2008-03-06 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Efficient Adaptive Collect Using Randomization
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2163016 (Why is no real title available?) | 2005-04-29 | Paper |
Quantifying rollback propagation in distributed checkpointing
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
Tight bounds for FEC-based reliable multicast
Information and Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2013840 (Why is no real title available?) | 2003-12-07 | Paper |
Computing in totally anonymous asynchronous shared memory systems
Information and Computation | 2003-01-14 | Paper |
The Combinatorial Structure of Wait-Free Solvable Tasks
SIAM Journal on Computing | 2002-09-29 | Paper |
Time bounds for decision problems in the presence of timing uncertainty and failures
Journal of Parallel and Distributed Computing | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1696672 (Why is no real title available?) | 2002-06-25 | Paper |
Adaptive and efficient algorithms for lattice agreement and renaming
SIAM Journal on Computing | 2002-04-23 | Paper |
Efficient and Robust Sharing of Memory in Message-Passing Systems
Journal of Algorithms | 2000-03-16 | Paper |
Local Labeling and Resource Allocation Using Preprocessing
SIAM Journal on Computing | 1999-10-28 | Paper |
A Correctness Condition for High-Performance Multiprocessors
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1179121 (Why is no real title available?) | 1998-07-26 | Paper |
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
SIAM Journal on Computing | 1998-05-10 | Paper |
Atomic Snapshots in <i>O</i> (<i>n</i> log <i>n</i>) Operations
SIAM Journal on Computing | 1998-05-10 | Paper |
Sharing memory robustly in message-passing systems
Journal of the ACM | 1998-02-02 | Paper |
Time-Adaptive Algorithms for Synchronization
SIAM Journal on Computing | 1997-05-26 | Paper |
Limitations of fast consistency conditions for distributed shared memories
Information Processing Letters | 1997-02-27 | Paper |
Optimal Clock Synchronization under Different Delay Assumptions
SIAM Journal on Computing | 1996-08-18 | Paper |
Connection management without retaining information
Information and Computation | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 742955 (Why is no real title available?) | 1995-04-11 | Paper |
Are wait-free algorithms fast?
Journal of the ACM | 1994-11-03 | Paper |
Efficiency of semisynchronous versus asynchronous networks
Mathematical Systems Theory | 1994-10-30 | Paper |
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM | 1994-06-29 | Paper |
Time bounds for real-time process control in the presence of timing uncertainty
Information and Computation | 1994-06-09 | Paper |
Atomic snapshots of shared memory
Journal of the ACM | 1994-03-20 | Paper |
Using mappings to prove timing properties
Distributed Computing | 1993-01-16 | Paper |
Better computing on the anonymous ring
Journal of Algorithms | 1991-01-01 | Paper |
Renaming in an asynchronous environment
Journal of the ACM | 1990-01-01 | Paper |
Efficient elections in chordal ring networks
Algorithmica | 1989-01-01 | Paper |
Computing on an anonymous ring
Journal of the ACM | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4050991 (Why is no real title available?) | 1988-01-01 | Paper |
Language complexity on the synchronous anonymous ring
Theoretical Computer Science | 1987-01-01 | Paper |
