| Publication | Date of Publication | Type |
|---|
When is recoverable consensus harder than consensus?
Distributed Computing | 2025-07-24 | Paper |
When is Recoverable Consensus Harder Than Consensus?
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7774263 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7774307 (Why is no real title available?) | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7650868 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Scheduling algorithms for strict multithreaded computations | 2023-01-25 | Paper |
The RedBlue family of universal constructions
Distributed Computing | 2021-01-22 | Paper |
Read-modify-write networks
Distributed Computing | 2020-12-04 | Paper |
| scientific article; zbMATH DE number 7075871 (Why is no real title available?) | 2019-07-03 | Paper |
The PCL theorem: transactions cannot be parallel, consistent, and live
Journal of the ACM | 2019-02-25 | Paper |
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
Parallel Processing Letters | 2017-12-15 | Paper |
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Lower and upper bounds for single-scanner snapshot implementations
Distributed Computing | 2017-09-04 | Paper |
Universal constructions that ensure disjoint-access parallelism and wait-freedom
Distributed Computing | 2016-10-17 | Paper |
The amortized complexity of non-blocking binary search trees
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Highly-efficient wait-free synchronization
Theory of Computing Systems | 2015-01-19 | Paper |
Universal constructions that ensure disjoint-access parallelism and wait-freedom
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Time-space tradeoffs for implementations of snapshots
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Space-optimal multi-writer snapshot objects are slow
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS
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 |
The space complexity of unbounded timestamps
Distributed Computing | 2013-07-04 | Paper |
The complexity of updating snapshot objects
Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
A tight time lower bound for space-optimal implementations of multi-writer snapshots
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The RedBlue Adaptive Universal Constructions
Lecture Notes in Computer Science | 2009-11-19 | Paper |
| scientific article; zbMATH DE number 5605099 (Why is no real title available?) | 2009-09-19 | Paper |
Time lower bounds for implementations of multi-writer snapshots
Journal of the ACM | 2008-12-21 | Paper |
The Space Complexity of Unbounded Timestamps
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
SIAM Journal on Computing | 2005-09-16 | Paper |
| scientific article; zbMATH DE number 2006662 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1304095 (Why is no real title available?) | 2000-11-22 | Paper |
Efficient scheduling of strict multithreaded computations
Theory of Computing Systems | 2000-09-04 | Paper |
