| Publication | Date of Publication | Type |
|---|
| Dynamic Byzantine reliable broadcast | 2026-03-31 | Paper |
| scientific article; zbMATH DE number 7832743 (Why is no real title available?) | 2024-04-15 | Paper |
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination
(available as arXiv preprint) | 2024-04-15 | Paper |
| scientific article; zbMATH DE number 7832766 (Why is no real title available?) | 2024-04-15 | Paper |
Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Permissionless and Asynchronous Asset Transfer
(available as arXiv preprint) | 2023-12-08 | Paper |
Brief Announcement: Accountability and Reconfiguration -Self-Healing Lattice Agreement
(available as arXiv preprint) | 2023-12-08 | Paper |
| Asynchronous reconfiguration with Byzantine failures | 2023-11-02 | Paper |
| Brief announcement: On decidability of 2-process affine models | 2023-11-02 | Paper |
Permissionless and asynchronous asset transfer
Distributed Computing | 2023-09-11 | Paper |
| Affine Tasks for k-Test-and-Set | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7650881 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Scalable Byzantine reliable broadcast | 2023-02-03 | Paper |
Asynchronous reconfiguration with Byzantine failures
Distributed Computing | 2022-12-09 | Paper |
| scientific article; zbMATH DE number 7561451 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561439 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
The consensus number of a cryptocurrency
Distributed Computing | 2022-04-01 | Paper |
Correction to: ``The consensus number of a cryptocurrency
Distributed Computing | 2022-04-01 | Paper |
The Consensus Number of a Cryptocurrency
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Perfect failure detection with very few bits
Information and Computation | 2020-12-15 | Paper |
Progress-space tradeoffs in single-writer memory implementations
(available as arXiv preprint) | 2020-07-30 | Paper |
The weakest failure detector for eventual consistency
Distributed Computing | 2019-11-27 | Paper |
Perfect failure detection with very few bits
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Brief announcement: Performance prediction for coarse-grained locking
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
scientific article; zbMATH DE number 6905187 (Why is no real title available?)
(available as arXiv preprint) | 2018-07-18 | Paper |
On the uncontended complexity of anonymous agreement
Distributed Computing | 2017-11-29 | Paper |
| On the uncontended complexity of anonymous consensus | 2017-09-29 | Paper |
Non-interference and local correctness in transactional memory
Theoretical Computer Science | 2017-06-19 | Paper |
In the search for optimal concurrency
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On the space complexity of set agreement?
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The weakest failure detector for eventual consistency
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The weakest failure detector for eventual consistency
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The complexity of obstruction-free implementations
Journal of the ACM | 2015-11-11 | Paper |
A generalized asynchronous computability theorem
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Wait-freedom with advice
Distributed Computing | 2015-03-25 | Paper |
Synchronizing without locks is inherently expensive
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Wait-freedom with advice
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Brief announcement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
The failure detector abstraction
ACM Computing Surveys | 2014-08-13 | Paper |
The weakest failure detector for solving \(k\)-set agreement
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 |
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| A note on set agreement with omission failures | 2013-08-23 | Paper |
On the weakest failure detector ever
Distributed Computing | 2013-06-28 | Paper |
The weakest failure detectors to boost obstruction-freedom
Distributed Computing | 2013-06-20 | Paper |
Failure detectors as type boosters
Distributed Computing | 2013-06-20 | Paper |
The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
SIAM Journal on Computing | 2013-03-19 | Paper |
Renaming and the weakest family of failure detectors
Distributed Computing | 2013-02-04 | Paper |
| scientific article; zbMATH DE number 6131611 (Why is no real title available?) | 2013-01-28 | Paper |
On set consensus numbers
Distributed Computing | 2012-02-06 | Paper |
The impossibility of boosting distributed service resilience
Information and Computation | 2011-07-08 | Paper |
Towards network games with social preferences
Structural Information and Communication Complexity | 2010-06-17 | Paper |
On failure detectors and type boosters. (Extended abstract)
Lecture Notes in Computer Science | 2010-02-23 | Paper |
On Set Consensus Numbers
Lecture Notes in Computer Science | 2009-11-19 | Paper |
The Weakest Failure Detectors to Boost Obstruction-Freedom
Lecture Notes in Computer Science | 2008-09-09 | Paper |
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences | 2008-06-26 | Paper |
N-Consensus is the Second Strongest Object for N + 1 Processes
Lecture Notes in Computer Science | 2008-04-22 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
