List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! Distributed Computing | 2024-07-26 | Paper |
| ``\(\varGamma\)-accurate failure detectors | 2024-07-11 | Paper |
| Differential Privacy and Byzantine Resilience in SGD Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| On the Validity of Consensus Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774254 (Why is no real title available?) | 2023-12-08 | Paper |
| Revisiting the relationship between non-blocking atomic commitment and consensus Distributed Algorithms | 2023-12-01 | Paper |
| Efficient multi-word compare and swap | 2023-11-02 | Paper |
| Who started this rumor? Quantifying the natural differential privacy of gossip protocols | 2023-11-02 | Paper |
| Monotonic Prefix Consistency in Distributed Systems Formal Techniques for Distributed Objects, Components, and 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 Distributed Computing | 2022-08-24 | Paper |
| scientific article; zbMATH DE number 7561259 (Why is no real title available?) | 2022-07-21 | Paper |
| Removing algorithmic discrimination (with minimal individual error) Theoretical Computer Science | 2022-06-13 | 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 |
| Genuinely Distributed Byzantine Machine Learning Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| The Impact of RDMA on Agreement Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| The Consensus Number of a Cryptocurrency Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| X-ability: a theory of replication Distributed Computing | 2020-12-03 | Paper |
| Non-blocking atomic commit in asynchronous distributed systems with failure detectors Distributed Computing | 2020-12-03 | Paper |
| The notions of time and global state in a distributed system Concurrency: the Works of Leslie Lamport | 2020-11-10 | Paper |
| Exploring the borderlands of the gathering problem | 2020-01-13 | Paper |
| The weakest failure detector for eventual consistency Distributed Computing | 2019-11-27 | Paper |
| Passing messages while sharing memory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Locking Timestamps versus Locking Objects Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| The PCL theorem: transactions cannot be parallel, consistent, and live Journal of the ACM | 2019-02-25 | Paper |
| The collective memory of amnesic processes ACM Transactions on Algorithms | 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 |
| The entropy of a distributed computation random number generation from memory interleaving Distributed Computing | 2018-08-10 | Paper |
| \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores Distributed Computing | 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 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
| Brief announcement: Byzantine-tolerant machine learning Proceedings of the ACM Symposium on Principles of Distributed Computing | 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? Electronic Notes in Theoretical Computer Science | 2016-06-06 | Paper |
| Safety-liveness exclusion in distributed computing 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 |
| The complexity of robust atomic storage Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Byzantine agreement with homonyms Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | 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 |
| How fast can a distributed atomic read be? Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
| The semantics of progress in lock-based transactional memory Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-07-03 | Paper |
| Synchronizing without locks is inherently expensive Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Toward a theory of transactional contention managers Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| How fast can a very robust read be? Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| X-ability, a theory of replication Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
| Indulgent algorithms (preliminary version) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
| Highly dynamic distributed computing with Byzantine failures Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Fast Byzantine agreement Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Introducing speculation in self-stabilization, an application to mutual exclusion Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Secure communication over radio channels Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| Sharing is harder than agreeing Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| On the complexity of asynchronous gossip Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| On the liveness of transactional memory Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Extensible encoding of type hierarchies Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
| Tight bounds for asynchronous renaming Journal of the ACM | 2014-09-12 | Paper |
| The failure detector abstraction ACM Computing Surveys | 2014-08-13 | Paper |
| The Complexity of Renaming 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| The inherent price of indulgence Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
| The wireless synchronization problem 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 |
| Byzantine agreement with homonyms Distributed Computing | 2014-03-28 | Paper |
| Refined quorum systems Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| On the weakest failure detector ever Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Asynchronous gossip Journal of the ACM | 2014-02-17 | Paper |
| Computing in social networks Information and Computation | 2014-02-11 | 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 |
| Model checking transactional memories Distributed Computing | 2013-06-28 | Paper |
| The weakest failure detectors to boost obstruction-freedom Distributed Computing | 2013-06-20 | Paper |
| Anonymous and fault-tolerant shared-memory computing Distributed Computing | 2013-06-20 | Paper |
| The overhead of consensus failure recovery Distributed Computing | 2013-06-20 | Paper |
| Failure detectors as type boosters Distributed Computing | 2013-06-20 | Paper |
| The inherent price of indulgence Distributed Computing | 2013-06-07 | Paper |
| The weakest failure detectors to solve quittable consensus and nonblocking atomic commit SIAM Journal on Computing | 2013-03-19 | Paper |
| Generating fast indulgent algorithms Theory of Computing Systems | 2012-12-07 | Paper |
| Verification of STM on relaxed memory models Formal Methods in System Design | 2012-09-27 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement Algorithmica | 2012-04-26 | Paper |
| Decentralized polling with respectable participants Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
| The disagreement power of an adversary Distributed Computing | 2012-02-06 | Paper |
| Generalized Universality CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
| The impossibility of boosting distributed service resilience Information and Computation | 2011-07-08 | Paper |
| The complexity of early deciding set agreement SIAM Journal on Computing | 2011-05-17 | Paper |
| Fast access to distributed atomic memory SIAM Journal on Computing | 2011-04-04 | Paper |
| Introduction to Reliable and Secure Distributed Programming | 2011-02-21 | Paper |
| Fast randomized test-and-set and renaming Lecture Notes in Computer Science | 2010-09-10 | Paper |
| Refined quorum systems Distributed Computing | 2010-09-09 | Paper |
| How efficient can gossip be? (On the cost of resilient information exchange) Automata, Languages and Programming | 2010-09-07 | Paper |
| From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Tight failure detection bounds on atomic object implementations Journal of the ACM | 2010-07-14 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2010-02-23 | Paper |
| On failure detectors and type boosters. (Extended abstract) Lecture Notes in Computer Science | 2010-02-23 | Paper |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement Algorithms and Computation | 2009-12-17 | Paper |
| Decentralized Polling with Respectable Participants Lecture Notes in Computer Science | 2009-12-03 | Paper |
| The Disagreement Power of an Adversary Lecture Notes in Computer Science | 2009-11-19 | Paper |
| Elastic Transactions Lecture Notes in Computer Science | 2009-11-19 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science | 2009-08-06 | Paper |
| Fast non-blocking atomic commit: an inherent trade-off Information Processing Letters | 2009-07-21 | Paper |
| Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures Automata, Languages and Programming | 2009-07-14 | Paper |
| Software Transactional Memory on Relaxed Memory Models Computer Aided Verification | 2009-06-30 | Paper |
| Transactional Memory: Glimmer of a Theory Computer Aided Verification | 2009-06-30 | Paper |
| Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks Theoretical Computer Science | 2009-03-02 | Paper |
| A topological treatment of early-deciding set-agreement Theoretical Computer Science | 2009-03-02 | Paper |
| A Topological Treatment of Early-Deciding Set-Agreement Lecture Notes in Computer Science | 2009-01-29 | Paper |
| Completeness and Nondeterminism in Model Checking Transactional Memories CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
| The Weakest Failure Detector for Message Passing Set-Agreement Lecture Notes in Computer Science | 2008-11-20 | Paper |
| Permissiveness in Transactional Memories Lecture Notes in Computer Science | 2008-11-20 | Paper |
| Optimistic Erasure-Coded Distributed Storage Lecture Notes in Computer Science | 2008-11-20 | Paper |
| How to Solve Consensus in the Smallest Window of Synchrony Lecture Notes in Computer Science | 2008-11-20 | Paper |
| The Weakest Failure Detectors to Boost Obstruction-Freedom Lecture Notes in Computer Science | 2008-09-09 | Paper |
| On the Message Complexity of Indulgent Consensus Lecture Notes in Computer Science | 2008-09-02 | Paper |
| Gossiping in a Multi-channel Radio Network Lecture Notes in Computer Science | 2008-09-02 | Paper |
| Amnesic Distributed Storage Lecture Notes in Computer Science | 2008-09-02 | Paper |
| The gap in circumventing the impossibility of consensus Journal of Computer and System Sciences | 2008-06-26 | Paper |
| The Time-Complexity of Local Decision in Distributed Agreement SIAM Journal on Computing | 2008-06-19 | Paper |
| Secretive birds: privacy in population protocols | 2008-04-22 | Paper |
| The perfectly synchronized round-based model of distributed computing Information and Computation | 2007-05-14 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Introduction to Reliable Distributed Programming | 2006-04-12 | Paper |
| Mutual exclusion in asynchronous systems with failure detectors Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
| Reliable and total order broadcast in the crash-recovery model Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
| The Driving Philosophers IFIP International Federation for Information Processing | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2088918 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089378 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2013834 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 2013827 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1950676 (Why is no real title available?) | 2003-07-17 | Paper |
| Effective multicast programming in large scale distributed systems Concurrency and Computation: Practice and Experience | 2003-02-04 | Paper |
| Experiences with object group systems | 2003-02-04 | Paper |
| Open consensus Concurrency and Computation: Practice and Experience | 2003-02-04 | Paper |
| scientific article; zbMATH DE number 1787173 (Why is no real title available?) | 2002-10-20 | Paper |
| On the hardness of failure-sensitive agreement problems. Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1747795 (Why is no real title available?) Distributed and Parallel Databases | 2002-05-30 | Paper |
| Atomic broadcast in a Byzantine model | 2001-10-04 | Paper |
| Genuine atomic multicast in asynchronous distributed systems Theoretical Computer Science | 2001-08-20 | Paper |
Research outcomes over time
This page was built for person: Rachid Guerraoui
