| Publication | Date of Publication | Type |
|---|
| Differential Privacy and Byzantine Resilience in SGD | 2024-03-26 | Paper |
| On the Validity of Consensus | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6061687 | 2023-12-08 | Paper |
| Revisiting the relationship between non-blocking atomic commitment and consensus | 2023-12-01 | Paper |
| Monotonic Prefix Consistency in Distributed Systems | 2023-03-10 | Paper |
| Demystifying Bitcoin (Keynote Abstract). | 2023-02-07 | Paper |
| Scalable Byzantine reliable broadcast | 2023-02-03 | Paper |
| Genuinely distributed Byzantine machine learning | 2022-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090896 | 2022-07-21 | Paper |
| Removing algorithmic discrimination (with minimal individual error) | 2022-06-13 | Paper |
| The consensus number of a cryptocurrency | 2022-04-01 | Paper |
| Correction to: ``The consensus number of a cryptocurrency | 2022-04-01 | Paper |
| Genuinely Distributed Byzantine Machine Learning | 2021-03-15 | Paper |
| The Consensus Number of a Cryptocurrency | 2021-01-20 | Paper |
| The Impact of RDMA on Agreement | 2021-01-20 | Paper |
| X-Ability: a theory of replication | 2020-12-03 | Paper |
| Non-blocking atomic commit in asynchronous distributed systems with failure detectors | 2020-12-03 | Paper |
| The notions of time and global state in a distributed system | 2020-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207892 | 2020-01-13 | Paper |
| The weakest failure detector for eventual consistency | 2019-11-27 | Paper |
| Passing Messages while Sharing Memory | 2019-09-19 | Paper |
| Locking Timestamps versus Locking Objects | 2019-09-19 | Paper |
| The PCL Theorem | 2019-02-25 | Paper |
| The collective memory of amnesic processes | 2018-11-05 | Paper |
| Byzantine fireflies | 2018-08-24 | Paper |
| Privacy-conscious information diffusion in social networks | 2018-08-24 | Paper |
| Optimal fair computation | 2018-08-16 | Paper |
| \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores | 2018-08-10 | Paper |
| The entropy of a distributed computation random number generation from memory interleaving | 2018-08-10 | Paper |
| Collision-Free Pattern Formation | 2018-07-18 | Paper |
| On the smallest grain of salt to get a unique identity | 2018-04-12 | Paper |
| On verifying causal consistency | 2017-10-20 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| The Benefits of Entropy in Population Protocols. | 2017-09-29 | Paper |
| The Complexity of Early Deciding Set Agreement: How can Topology help? | 2016-06-06 | Paper |
| Safety-Liveness Exclusion in Distributed Computing | 2016-03-23 | Paper |
| The Weakest Failure Detector for Eventual Consistency | 2016-03-23 | Paper |
| The complexity of obstruction-free implementations | 2015-11-11 | Paper |
| Byzantine agreement with homonyms | 2015-09-11 | Paper |
| The complexity of robust atomic storage | 2015-09-11 | Paper |
| How fast can a distributed atomic read be? | 2015-08-03 | Paper |
| The weakest failure detectors to solve certain fundamental problems in distributed computing | 2015-08-03 | Paper |
| The semantics of progress in lock-based transactional memory | 2015-07-03 | Paper |
| Toward a theory of transactional contention managers | 2015-03-10 | Paper |
| How fast can a very robust read be? | 2015-03-10 | Paper |
| Synchronizing without locks is inherently expensive | 2015-03-10 | Paper |
| X-ability | 2015-03-03 | Paper |
| Indulgent algorithms (preliminary version) | 2015-03-03 | Paper |
| Fast byzantine agreement | 2015-03-02 | Paper |
| Highly dynamic distributed computing with byzantine failures | 2015-03-02 | Paper |
| Introducing speculation in self-stabilization | 2015-03-02 | Paper |
| Sharing is harder than agreeing | 2014-12-12 | Paper |
| Secure communication over radio channels | 2014-12-12 | Paper |
| On the complexity of asynchronous gossip | 2014-12-12 | Paper |
| On the liveness of transactional memory | 2014-12-05 | Paper |
| Tight Bounds for Asynchronous Renaming | 2014-09-12 | Paper |
| Extensible encoding of type hierarchies | 2014-09-12 | Paper |
| The failure detector abstraction | 2014-08-13 | Paper |
| The Complexity of Renaming | 2014-07-30 | Paper |
| The inherent price of indulgence | 2014-07-25 | Paper |
| The wireless synchronization problem | 2014-07-23 | Paper |
| Laws of order | 2014-04-10 | Paper |
| Byzantine agreement with homonyms | 2014-03-28 | Paper |
| Refined quorum systems | 2014-03-13 | Paper |
| On the weakest failure detector ever | 2014-03-13 | Paper |
| Asynchronous gossip | 2014-02-17 | Paper |
| Computing in social networks | 2014-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843714 | 2013-08-23 | Paper |
| Model checking transactional memories | 2013-06-28 | Paper |
| On the weakest failure detector ever | 2013-06-28 | Paper |
| The overhead of consensus failure recovery | 2013-06-20 | Paper |
| Anonymous and fault-tolerant shared-memory computing | 2013-06-20 | Paper |
| Failure detectors as type boosters | 2013-06-20 | Paper |
| The weakest failure detectors to boost obstruction-freedom | 2013-06-20 | Paper |
| The inherent price of indulgence | 2013-06-07 | Paper |
| The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit | 2013-03-19 | Paper |
| Generating fast indulgent algorithms | 2012-12-07 | Paper |
| Verification of STM on relaxed memory models | 2012-09-27 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement | 2012-04-26 | Paper |
| Decentralized polling with respectable participants | 2012-02-14 | Paper |
| The disagreement power of an adversary | 2012-02-06 | Paper |
| Generalized Universality | 2011-09-02 | Paper |
| The impossibility of boosting distributed service resilience | 2011-07-08 | Paper |
| The Complexity of Early Deciding Set Agreement | 2011-05-17 | Paper |
| Fast Access to Distributed Atomic Memory | 2011-04-04 | Paper |
| Introduction to Reliable and Secure Distributed Programming | 2011-02-21 | Paper |
| Fast Randomized Test-and-Set and Renaming | 2010-09-10 | Paper |
| Refined quorum systems | 2010-09-09 | Paper |
| How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) | 2010-09-07 | Paper |
| From a static impossibility to an adaptive lower bound | 2010-08-16 | Paper |
| Tight failure detection bounds on atomic object implementations | 2010-07-14 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement | 2009-12-17 | Paper |
| Decentralized Polling with Respectable Participants | 2009-12-03 | Paper |
| The Disagreement Power of an Adversary | 2009-11-19 | Paper |
| Elastic Transactions | 2009-11-19 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Fast non-blocking atomic commit: an inherent trade-off | 2009-07-21 | Paper |
| Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures | 2009-07-14 | Paper |
| Transactional Memory: Glimmer of a Theory | 2009-06-30 | Paper |
| Software Transactional Memory on Relaxed Memory Models | 2009-06-30 | Paper |
| Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks | 2009-03-02 | 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 |
| Completeness and Nondeterminism in Model Checking Transactional Memories | 2008-11-25 | Paper |
| How to Solve Consensus in the Smallest Window of Synchrony | 2008-11-20 | Paper |
| The Weakest Failure Detector for Message Passing Set-Agreement | 2008-11-20 | Paper |
| Optimistic Erasure-Coded Distributed Storage | 2008-11-20 | Paper |
| Permissiveness in Transactional Memories | 2008-11-20 | Paper |
| The Weakest Failure Detectors to Boost Obstruction-Freedom | 2008-09-09 | Paper |
| Amnesic Distributed Storage | 2008-09-02 | Paper |
| Gossiping in a Multi-channel Radio Network | 2008-09-02 | Paper |
| On the Message Complexity of Indulgent Consensus | 2008-09-02 | Paper |
| The gap in circumventing the impossibility of consensus | 2008-06-26 | Paper |
| The Time-Complexity of Local Decision in Distributed Agreement | 2008-06-19 | Paper |
| The perfectly synchronized round-based model of distributed computing | 2007-05-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Introduction to Reliable Distributed Programming | 2006-04-12 | Paper |
| Reliable and total order broadcast in the crash-recovery model | 2005-08-03 | Paper |
| Mutual exclusion in asynchronous systems with failure detectors | 2005-08-03 | Paper |
| The Driving Philosophers | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3045849 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046722 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437119 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437126 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413405 | 2003-07-17 | Paper |
| Effective multicast programming in large scale distributed systems | 2003-02-04 | Paper |
| Open consensus | 2003-02-04 | Paper |
| Experiences with object group systems | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548220 | 2002-10-20 | Paper |
| On the hardness of failure-sensitive agreement problems. | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530191 | 2002-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729985 | 2001-10-04 | Paper |
| Genuine atomic multicast in asynchronous distributed systems | 2001-08-20 | Paper |
