Rachid Guerraoui

According to our database1, Rachid Guerraoui authored at least 405 papers between 1992 and 2018.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Awards

ACM Fellow

ACM Fellow 2012, "For contributions to the theory and practice of reliable distributed computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Causal Consistency and Latency Optimality: Friend or Foe?
PVLDB, 2018

TM2C: a software transactional memory for many-cores.
Distributed Computing, 2018

The entropy of a distributed computation random number generation from memory interleaving.
Distributed Computing, 2018

Limiting the Spread of Fake News on Social Media Platforms by Evaluating Users' Trustworthiness.
CoRR, 2018

Removing Algorithmic Discrimination (With Minimal Individual Error).
CoRR, 2018

Virtuously Safe Reinforcement Learning.
CoRR, 2018

Distributed Transactions: Dissecting the Nightmare.
CoRR, 2018

Causal Consistency and Latency Optimality: Friend or Foe?
CoRR, 2018

Asynchronous Byzantine Machine Learning.
CoRR, 2018

The Hidden Vulnerability of Distributed Learning in Byzantium.
CoRR, 2018

Learning to Gather without Communication.
CoRR, 2018

Deep Learning Works in Practice. But Does it Work in Theory?
CoRR, 2018

State Machine Replication Is More Expensive Than Consensus.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Log-Free Concurrent Data Structures.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

The Inherent Cost of Remembering Consistently.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Locking Timestamps versus Locking Objects.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Passing Messages while Sharing Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

The Hidden Vulnerability of Distributed Learning in Byzantium.
Proceedings of the 35th International Conference on Machine Learning, 2018

Asynchronous Byzantine Machine Learning (the case of SGD).
Proceedings of the 35th International Conference on Machine Learning, 2018

Monotonic Prefix Consistency in Distributed Systems.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2018

Collaborative Filtering Under a Sybil Attack: Similarity Metrics do Matter!
Proceedings of the 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2018

Personalized and Private Peer-to-Peer Machine Learning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations.
IEEE Trans. Parallel Distrib. Syst., 2017

ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications.
TOPC, 2017

Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar.
PVLDB, 2017

Elastic transactions.
J. Parallel Distrib. Comput., 2017

Sequences, Items And Latent Links: Recommendation With Consumed Item Packs.
CoRR, 2017

Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems.
CoRR, 2017

On The Robustness of a Neural Network.
CoRR, 2017

Can AIs learn to avoid human interruption?
CoRR, 2017

When Neurons Fail.
CoRR, 2017

Byzantine-Tolerant Machine Learning.
CoRR, 2017

Fast and Differentially Private Algorithms for Decentralized Collaborative Machine Learning.
CoRR, 2017

TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores.
Proceedings of the 2017 USENIX Annual Technical Conference, 2017

On the Robustness of a Neural Network.
Proceedings of the 36th IEEE Symposium on Reliable Distributed Systems, 2017

On the Smallest Grain of Salt to Get a Unique Identity.
Proceedings of the Structural Information and Communication Complexity, 2017

The Utility and Privacy Effects of a Click.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

On verifying causal consistency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

How Fast can a Distributed Transaction Commit?
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Brief Announcement: Byzantine-Tolerant Machine Learning.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Dynamic Safe Interruptibility for Decentralized Multi-Agent Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Disclosure Power of Shared Objects.
Proceedings of the Networked Systems - 5th International Conference, 2017

Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms.
Proceedings of the Networked Systems - 5th International Conference, 2017

When Neurons Fail.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Capturing the Moment: Lightweight Similarity Computations.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Abstracting Multi-Core Topologies with MCTOP.
Proceedings of the Twelfth European Conference on Computer Systems, 2017

FloDB: Unlocking Memory in Persistent Key-Value Stores.
Proceedings of the Twelfth European Conference on Computer Systems, 2017

I Know Nothing about You But Here is What You Might Like.
Proceedings of the 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2017

2016
Failure Detectors.
Encyclopedia of Algorithms, 2016

Trade-offs in Replicated Systems.
IEEE Data Eng. Bull., 2016

Incremental Consistency Guarantees for Replicated Objects.
CoRR, 2016

On Verifying Causal Consistency.
CoRR, 2016

Privacy-preserving distributed collaborative filtering.
Computing, 2016

Optimal Fair Computation.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Unlocking Energy.
Proceedings of the 2016 USENIX Annual Technical Conference, 2016

Who's On Board?: Probabilistic Membership for Real-Time Distributed Control Systems.
Proceedings of the 35th IEEE Symposium on Reliable Distributed Systems, 2016

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Fast and Robust Memory Reclamation for Concurrent Data Structures.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Right on Time Distributed Shared Memory.
Proceedings of the 2016 IEEE Real-Time Systems Symposium, 2016

Optimistic concurrency with OPTIK.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

ESTIMA: extrapolating scalability of in-memory applications.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Incremental Consistency Guarantees for Replicated Objects.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Collision-Free Pattern Formation.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Atum: Scalable Group Communication Using Volatile Groups.
Proceedings of the 17th International Middleware Conference, Trento, Italy, December 12, 2016

Locking Made Easy.
Proceedings of the 17th International Middleware Conference, Trento, Italy, December 12, 2016

Never Say Never - Probabilistic and Temporal Failure Detectors.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Frugal topology construction for stream aggregation in the cloud.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

ProteusTM: Abstraction Meets Performance in Transactional Memory.
Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, 2016

2015
The Next 700 BFT Protocols.
ACM Trans. Comput. Syst., 2015

D2P: Distance-Based Differential Privacy in Recommenders.
PVLDB, 2015

Beyond One Third Byzantine Failures.
CoRR, 2015

The Weakest Failure Detector for Eventual Consistency.
CoRR, 2015

Special issue on NETYS selected papers.
Computing, 2015

Byzantine Fireflies.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Privacy-Conscious Information Diffusion in Social Networks.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

To Transmit Now or Not to Transmit Now.
Proceedings of the 34th IEEE Symposium on Reliable Distributed Systems, 2015

The Weakest Failure Detector for Eventual Consistency.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Safety-Liveness Exclusion in Distributed Computing.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

The Benefits of Entropy in Population Protocols.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

A Thrifty Universal Construction.
Proceedings of the Networked Systems - Third International Conference, 2015

Profiling Transactional Applications.
Proceedings of the Networked Systems - Third International Conference, 2015

Source Routing in Time-Varing Lossy Networks.
Proceedings of the Networked Systems - Third International Conference, 2015

Making BFT Protocols Really Adaptive.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Collaborative filtering under a sybil attack: analysis of a privacy threat.
Proceedings of the Eighth European Workshop on System Security, 2015

Hide & Share: Landmark-Based Similarity for Private KNN Computation.
Proceedings of the 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015

Liveness in Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network.
ACM Trans. Internet Techn., 2014

Tight Bounds for Asynchronous Renaming.
J. ACM, 2014

Computing in social networks.
Inf. Comput., 2014

Tracking freeriders in gossip-based content dissemination systems.
Computer Networks, 2014

Democratizing transactional programming.
Commun. ACM, 2014

The PCL theorem: transactions cannot be parallel, consistent and live.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

A paradox of eventual linearizability in shared memory.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Linearizability Is Not Always a Safety Property.
Proceedings of the Networked Systems - Second International Conference, 2014

Disjoint-Access Parallelism Does Not Entail Scalability.
Proceedings of the Networked Systems - Second International Conference, 2014

Privacy-Preserving Distributed Collaborative Filtering.
Proceedings of the Networked Systems - Second International Conference, 2014

Consensus inside.
Proceedings of the 15th International Middleware Conference, 2014

HyRec: leveraging browsers for scalable recommenders.
Proceedings of the 15th International Middleware Conference, 2014

Reusable Concurrent Data Types.
Proceedings of the ECOOP 2014 - Object-Oriented Programming - 28th European Conference, Uppsala, Sweden, July 28, 2014

Finding trojan message vulnerabilities in distributed systems.
Proceedings of the Architectural Support for Programming Languages and Operating Systems, 2014

Distributed Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Asynchronous gossip.
J. ACM, 2013

Byzantine agreement with homonyms.
Distributed Computing, 2013

Spéculation et auto-stabilisation
CoRR, 2013

Introducing Speculation in Self-Stabilization - An Application to Mutual Exclusion
CoRR, 2013

A Distributed Polling with Probabilistic Privacy.
Proceedings of the IEEE 32nd Symposium on Reliable Distributed Systems, 2013

Everything you always wanted to know about synchronization but were afraid to ask.
Proceedings of the ACM SIGOPS 24th Symposium on Operating Systems Principles, 2013

Highly dynamic distributed computing with byzantine failures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Introducing speculation in self-stabilization: an application to mutual exclusion.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Fast byzantine agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Composing Relaxed Transactions.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

WHATSUP: A Decentralized Instant News Recommender.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.
SIAM J. Comput., 2012

Generating Fast Indulgent Algorithms.
Theory Comput. Syst., 2012

Decentralized polling with respectable participants.
J. Parallel Distrib. Comput., 2012

Special section with selected papers from PODC 2010.
Distributed Computing, 2012

On Dynamic Distributed Computing
CoRR, 2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Algorithmica, 2012

Abortable Linearizable Modules.
Archive of Formal Proofs, 2012

Scalable and Secure Polling in Dynamic Distributed Networks.
Proceedings of the IEEE 31st Symposium on Reliable Distributed Systems, 2012

On the cost of composing shared-memory algorithms.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.
Proceedings of the Structural Information and Communication Complexity, 2012

On the liveness of transactional memory.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Speculative linearizability.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Unifying Thread-Level Speculation and Transactional Memory.
Proceedings of the Middleware 2012, 2012

How to Allocate Tasks Asynchronously.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

TM2C: a software transactional memory for many-cores.
Proceedings of the European Conference on Computer Systems, 2012

2011
Collaborative personalized top-k processing.
ACM Trans. Database Syst., 2011

Stabilization, Safety, and Security of Distributed Systems (SSS 2009).
Theor. Comput. Sci., 2011

The Complexity of Early Deciding Set Agreement.
SIAM J. Comput., 2011

The impossibility of boosting distributed service resilience.
Inf. Comput., 2011

Verification of STM on relaxed memory models.
Formal Methods in System Design, 2011

The disagreement power of an adversary.
Distributed Computing, 2011

The failure detector abstraction.
ACM Comput. Surv., 2011

Scalable and Secure Aggregation in Distributed Networks
CoRR, 2011

Why STM can be more than a research toy.
Commun. ACM, 2011

Brief announcement: transaction polymorphism.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

The complexity of robust atomic storage.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Byzantine agreement with homonyms.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Model Checking a Networked System Without the Network.
Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation, 2011

Democratizing Transactional Programming.
Proceedings of the Middleware 2011, 2011

Generating Fast Indulgent Algorithms.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

The Complexity of Renaming.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Automated vulnerability discovery in distributed systems.
Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W 2011), 2011

Generalized Universality.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Introduction to Reliable and Secure Distributed Programming (2. ed.).
Springer, ISBN: 978-3-642-15259-7, 2011

2010
Principles of Transactional Memory
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2010

Throughput optimal total order broadcast for cluster environments.
ACM Trans. Comput. Syst., 2010

Reflexes: Abstractions for integrating highly responsive tasks into Java applications.
ACM Trans. Embedded Comput. Syst., 2010

Fast Access to Distributed Atomic Memory.
SIAM J. Comput., 2010

The Velox Transactional Memory Stack.
IEEE Micro, 2010

Tight failure detection bounds on atomic object implementations.
J. ACM, 2010

Refined quorum systems.
Distributed Computing, 2010

Model checking transactional memories.
Distributed Computing, 2010

Foundations of Speculative Distributed Computing - (Invited Lecture Extended Abstract).
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief Announcement: New Bounds for Partially Synchronous Set Agreement.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Fast Randomized Test-and-Set and Renaming.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Computing in Social Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Transactions in the jungle.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Collaborative scoring with dishonest participants.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Brief announcement: byzantine agreement with homonyms.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Securing every bit: authenticated broadcast in radio networks.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Replication Techniques for Availability.
Proceedings of the Replication: Theory and Practice, 2010

Leveraging parallel nesting in transactional memory.
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010

Boosting Gossip for Live Streaming.
Proceedings of the IEEE Tenth International Conference on Peer-to-Peer Computing, 2010

WhatsUp: News, From, For, Through, Everyone.
Proceedings of the IEEE Tenth International Conference on Peer-to-Peer Computing, 2010

LiFTinG: Lightweight Freerider-Tracking in Gossip.
Proceedings of the Middleware 2010 - ACM/IFIP/USENIX 11th International Middleware Conference, Bangalore, India, November 29, 2010

The Gossple Anonymous Social Network.
Proceedings of the Middleware 2010 - ACM/IFIP/USENIX 11th International Middleware Conference, Bangalore, India, November 29, 2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

The next 700 BFT protocols.
Proceedings of the European Conference on Computer Systems, 2010

Gossiping personalized queries.
Proceedings of the EDBT 2010, 2010

2009
A topological treatment of early-deciding set-agreement.
Theor. Comput. Sci., 2009

Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks.
Theor. Comput. Sci., 2009

The complexity of obstruction-free implementations.
J. ACM, 2009

The Complexity of Early Deciding Set Agreement: How can Topology help?
Electr. Notes Theor. Comput. Sci., 2009

The Theory of Transactional Memory.
Bulletin of the EATCS, 2009

On the weakest failure detector ever.
Distributed Computing, 2009

Reliable Distributed Storage.
IEEE Computer, 2009

Brief Announcement: Towards Secured Distributed Polling in Social Networks.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Elastic Transactions.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The Disagreement Power of an Adversary.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The 2009 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Toward personalized query expansion.
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, 2009

Toward personalized peer-to-peer top-k processing.
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, 2009

The semantics of progress in lock-based transactional memory.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

Preventing versus curing: avoiding conflicts in transactional memories.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The wireless synchronization problem.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The disagreement power of an adversary: extended abstract.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Stretching transactional memory.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

On Tracking Freeriders in Gossip Protocols.
Proceedings of the Proceedings P2P 2009, 2009

Decentralized Polling with Respectable Participants.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Heterogeneous Gossip.
Proceedings of the Middleware 2009, ACM/IFIP/USENIX, 10th International Middleware Conference, Urbana, IL, USA, November 30, 2009

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Interference-Resilient Information Exchange.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Stretching gossip with live streaming.
Proceedings of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, 2009

High-Performance Transactional Event Processing.
Proceedings of the Coordination Models and Languages, 11th International Conference, 2009

Transactional Memory: Glimmer of a Theory.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Software Transactional Memory on Relaxed Memory Models.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Failure Detectors.
Proceedings of the Encyclopedia of Algorithms, 2008

The collective memory of amnesic processes.
ACM Trans. Algorithms, 2008

A general characterization of indulgence.
TAAS, 2008

Transactions are back---but are they the same?: "Le Retour de Martin Guerre" (Sommersby).
SIGACT News, 2008

The gap in circumventing the impossibility of consensus.
J. Comput. Syst. Sci., 2008

The weakest failure detectors to boost obstruction-freedom.
Distributed Computing, 2008

Failure detectors as type boosters.
Distributed Computing, 2008

Permissiveness in Transactional Memories.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Optimistic Erasure-Coded Distributed Storage.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

The Weakest Failure Detector for Message Passing Set-Agreement.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

How to Solve Consensus in the Smallest Window of Synchrony.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On obstruction-free transactions.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Partial snapshot objects.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

On the correctness of transactional memory.
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008

Extensible encoding of type hierarchies.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

On the complexity of asynchronous gossip.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Secure communication over radio channels.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Sharing is harder than agreeing.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Model checking transactional memories.
Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

The Next 700 BFT Protocols.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Flexible task graphs: a unified restricted thread programming model for java.
Proceedings of the 2008 ACM SIGPLAN/SIGBED Conference on Languages, 2008

An Arbitrary Tree-Structured Replica Control Protocol.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

The Return of Transactions.
Proceedings of the ECOOP 2008, 2008

A Scalable and Oblivious Atomicity Assertion.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Completeness and Nondeterminism in Model Checking Transactional Memories.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Gossip-based peer sampling.
ACM Trans. Comput. Syst., 2007

How robust are gossip-based communication protocols?
Operating Systems Review, 2007

The Time-Complexity of Local Decision in Distributed Agreement.
SIAM J. Comput., 2007

A Smooth Concurrency Revolution with Free Objects.
IEEE Internet Computing, 2007

The perfectly synchronized round-based model of distributed computing.
Inf. Comput., 2007

Anonymous and fault-tolerant shared-memory computing.
Distributed Computing, 2007

The overhead of consensus failure recovery.
Distributed Computing, 2007

The Alpha of Indulgent Consensus.
Comput. J., 2007

On the Message Complexity of Indulgent Consensus.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Gossiping in a Multi-channel Radio Network.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Amnesic Distributed Storage.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Reflexes: abstractions for highly responsive systems.
Proceedings of the 3rd International Conference on Virtual Execution Environments, 2007

The Weight-Watcher Service and its Lightweight Implementation.
Proceedings of the 2007 International Conference on Embedded Computer Systems: Architectures, 2007

Refined quorum systems.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

On the weakest failure detector ever.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus.
Proceedings of the Parallel Computing Technologies, 2007

Secretive Birds: Privacy in Population Protocols.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Streamflex: high-throughput stream programming in java.
Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2007

Towards Fair Event Dissemination.
Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), 2007

A High Throughput Atomic Storage Algorithm.
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), 2007

STMBench7: a benchmark for software transactional memory.
Proceedings of the 2007 EuroSys Conference, Lisbon, Portugal, March 21-23, 2007, 2007

Efficient distributed subtyping tests.
Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, 2007

A comparison of optimistic approaches to collaborative editing of Wiki pages.
Proceedings of the 3rd International Conference on Collaborative Computing: Networking, 2007

Pervasive Computing with Frugal Objects.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

A Universal Construction for Concurrent Objects.
Proceedings of the The Second International Conference on Availability, 2007

2006
Editorial: Introduction.
Distributed Computing, 2006

The Weakest Failure Detectors to Boost Obstruction-Freedom.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

A General Characterization of Indulgence.
Proceedings of the Stabilization, 2006

Unconscious Eventual Consistency with Gossips.
Proceedings of the Stabilization, 2006

A leader election protocol for eventually synchronous shared memory systems.
Proceedings of the Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems and the Second International Workshop on Collaborative Computing, 2006

How fast can a very robust read be?
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Towards a theory of transactional contention managers.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Synchronizing without locks is inherently expensive.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles.
Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P 2006), 2006

A Topological Treatment of Early-Deciding Set-Agreement.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Lucky Read/Write Access to Robust Atomic Storage.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

High Throughput Total Order Broadcast for Cluster Environments.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

When Birds Die: Making Population Protocols Fault-Tolerant.
Proceedings of the Distributed Computing in Sensor Systems, 2006

Introduction to reliable distributed programming.
Springer, ISBN: 978-3-540-28845-9, 2006

2005
Mutual exclusion in asynchronous systems with failure detectors.
J. Parallel Distrib. Comput., 2005

Reliable and total order broadcast in the crash-recovery model.
J. Parallel Distrib. Comput., 2005

The inherent price of indulgence.
Distributed Computing, 2005

What Can Be Implemented Anonymously?
Proceedings of the Distributed Computing, 19th International Conference, 2005

Polymorphic Contention Management.
Proceedings of the Distributed Computing, 19th International Conference, 2005

(Almost) All Objects Are Universal in Message Passing Systems.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Computing with Reads and Writes in the Absence of Step Contention.
Proceedings of the Distributed Computing, 19th International Conference, 2005

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Toward a theory of transactional contention managers.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Frugal Event Dissemination in a Mobile Environment.
Proceedings of the Middleware 2005, ACM/IFIP/USENIX, 6th International Middleware Conference, Grenoble, France, November 28, 2005

Fault-Tolerant Techniques for Concurrent Objects.
Proceedings of the Dependable Computing, Second Latin-American Symposium, 2005

The Impossibility of Boosting Distributed Service Resilience.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Gracefully Degrading Fair Exchange with Security Modules.
Proceedings of the Dependable Computing, 2005

How Fast Can Eventual Synchrony Lead to Consensus?.
Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June, 2005

2004
The Information Structure of Indulgent Consensus.
IEEE Trans. Computers, 2004

Distributed Programming with Typed Events.
IEEE Software, 2004

Mobile Databases: a Selection of Open Issues and Research Directions.
SIGMOD Record, 2004

Fast non-blocking atomic commit: an inherent trade-off.
Inf. Process. Lett., 2004

Epidemic Information Dissemination in Distributed Systems.
IEEE Computer, 2004

How fast can a distributed atomic read be?
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

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, 2004

The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations.
Proceedings of the Middleware 2004, 2004

The Driving Philosophers.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Towards Safe Distributed Application Development.
Proceedings of the 26th International Conference on Software Engineering (ICSE 2004), 2004

Robust Emulations of Shared Memory in a Crash-Recovery Model.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

D-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

Linguistic Support for Distributed Programming Abstractions.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

BGP-Based Clustering for Scalable and Reliable Gossip Broadcast.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

Data-Aware Multicast.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

2003
Guest Editorial: Special Section on Middleware Infrastructures.
IEEE Trans. Parallel Distrib. Syst., 2003

Lightweight probabilistic broadcast.
ACM Trans. Comput. Syst., 2003

Editorial: Middleware.
Softw., Pract. Exper., 2003

Deconstructing paxos.
SIGACT News, 2003

A Note on Set Agreement with Omission Failures.
Electr. Notes Theor. Comput. Sci., 2003

The Database State Machine Approach.
Distributed and Parallel Databases, 2003

The many faces of publish/subscribe.
ACM Comput. Surv., 2003

On Failure Detectors and Type Boosters.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Tight Bounds on Early Local Decisions in Uniform Consensus.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Distributed Programming for Dummies: A Shifting Transformation Technique.
Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), 2003

A Generic Framework for Indulgent Consensus.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Pragmatic Type Interoperability.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

An Equational Theory for Transactions.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Adaptive Gossip-Based Broadcast.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Dissecting Distributed Computations.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
e-Transactions: End-to-End Reliability for Three-Tier Architectures.
IEEE Trans. Software Eng., 2002

Dictatorial Transaction Processing: Atomic Commitment Without Veto Right.
Distributed and Parallel Databases, 2002

Non-blocking atomic commit in asynchronous distributed systems with failure detectors.
Distributed Computing, 2002

Asynchronous Leasing.
Proceedings of the 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002), 2002

An Efficient Universal Construction for Message-Passing Systems.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Failure Detection Lower Bounds on Registers and Consensus.
Proceedings of the Distributed Computing, 16th International Conference, 2002

On the consistency problem in mobile distributed computing.
Proceedings of the 2002 Workshop on Principles of Mobile Computing, 2002

The inherent price of indulgence.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

On the Weakest Failure Detector for Non-Blocking Atomic Commit.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Event Systems: How to Have Your Cake and Eat It Too.
Proceedings of the 22nd International Conference on Distributed Computing Systems, 2002

OS Support for P2P Programming: a Case for TPS.
ICDCS, 2002

The LEAF Platform: Incremental Enhancements for the J2EE.
Proceedings of the 6th International Enterprise Distributed Object Computing Conference (EDOC 2002), 2002

Fast Indulgent Consensus with Zero Degradation.
Proceedings of the Dependable Computing, 2002

AOP: Does It Make Sense? The Case of Concurrency and Failures.
Proceedings of the ECOOP 2002, 2002

Probabilistic Multicast.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

A Realistic Look At Failure Detectors.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

Encapsulating Failure Detection: From Crash to Byzantine Failures.
Proceedings of the Reliable Software Technologies, 2002

2001
The Generic Consensus Service.
IEEE Trans. Software Eng., 2001

Implementing E-Transactions with Asynchronous Replication.
IEEE Trans. Parallel Distrib. Syst., 2001

Genuine atomic multicast in asynchronous distributed systems.
Theor. Comput. Sci., 2001

On the hardness of failure-sensitive agreement problems.
Inf. Process. Lett., 2001

X-Ability: a theory of replication.
Distributed Computing, 2001

Effective multicast programming in large scale distributed systems.
Concurrency and Computation: Practice and Experience, 2001

Open consensus.
Concurrency and Computation: Practice and Experience, 2001

Reducing Noise in Gossip-Based Reliable Broadcast.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

On Objects and Events.
Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 2001

Lightweight Probabilistic Broadcast.
Proceedings of the 2001 International Conference on Dependable Systems and Networks (DSN 2001) (formerly: FTCS), 2001

Content-Based Publish/Subscribe with Structural Reflection.
Proceedings of the 6th USENIX Conference on Object-Oriented Technologies and Systems, January 29, 2001

2000
Experiences with object group systems.
Softw., Pract. Exper., 2000

Programming with object groups in CORBA.
IEEE Concurrency, 2000

An open framework for reliable distributed computing.
ACM Comput. Surv., 2000

Special issue: European Conference on Object-oriented Programming 1999.
Concurrency - Practice and Experience, 2000

A Pragmatic Implementation of e-Transactions.
Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, 2000

Abstractions for Devising Byzantine-Resilient State Machine Replication.
Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, 2000

Reliable Broadcast in the Crash-Recovery Model.
Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, 2000

Indulgent algorithms (preliminary version).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

X-ability: a theory of replication.
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction.
Proceedings of the ECOOP 2000, 2000

Implementing e-Transactions with Asynchronous Replication.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

1999
Object-oriented Abstractions for Distributed Programming.
Commun. ACM, 1999

OO Distributed Programming is Not Distributed OO Programming.
Commun. ACM, 1999

Putting OO Distributed Programming to Work.
Commun. ACM, 1999

Workshop on Reliable Middleware - Foreword.
Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

CORBA Fault-Tolerance: Why It Does Not Add Up.
Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '99), 1999

Muteness Failure Detectors: Specification and Implementation.
Proceedings of the Dependable Computing, 1999

Failure Detectors as First Class Objects.
Proceedings of the International Symposium on Distributed Objects and Applications, 1999

A Classification of Various Approaches for Object-Based Parallel and Distributed Prgramming.
Proceedings of the Collaboration between Human and Artificial Societies, 1999

Consensus in Asynchronous Distributed Systems: A Concise Guided Tour.
Proceedings of the Advances in Distributed Systems, 1999

Replication of CORBA Objects.
Proceedings of the Advances in Distributed Systems, 1999

1998
Editorial - High Availability in CORBA.
TAPOS, 1998

The Implementation of a CORBA Object Group Service.
TAPOS, 1998

Concurrency and Distribution in Object-Oriented Programming.
ACM Comput. Surv., 1998

System Support for Object Groups.
Proceedings of the 1998 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1998

One-Phase Commit: Does it make Sense?
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

Flexible Protocol Composition in Bast.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

Scalable Atomic Multicast.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1998), 1998

Exploiting Atomic Broadcast in Replicated Databases.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

Evaluating CORBA portability: the case of an object group service.
Proceedings of the Second International Enterprise Distributed Object Computing Workshop, 1998

1997
Garf: a tool for programming reliable distributed applications.
IEEE Concurrency, 1997

Guest Editors' introduction.
Distributed Systems Engineering, 1997

Software-Based Replication for Fault Tolerance.
IEEE Computer, 1997

Genuine Atomic Multicast.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Transaction Reordering in Replicated Databases.
Proceedings of the Sixteenth Symposium on Reliable Distributed Systems, 1997

Total Order Multicast to Multiple Groups.
Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

Consensus: The Big Misunderstanding.
Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 1997

Replicating objects using the CORBA Event Service?
Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 1997

Using the Strategy Design Pattern to Compose Reliable Distributed Protocols.
Proceedings of the Third USENIX Conference on Object-Oriented Technologies (COOTS), 1997

Reliability with CORBA Event Channels.
Proceedings of the Third USENIX Conference on Object-Oriented Technologies (COOTS), 1997

1996
Distributed Programming Abstractions.
ACM Comput. Surv., 1996

Strategic Directions in Object-Oriented Programming.
ACM Comput. Surv., 1996

"Gamma-Accurate" Failure Detectors.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

The Design of a CORBA Group Communication Service.
Proceedings of the 15th Symposium on Reliable Distributed Systems, 1996

Reducing the Cost for Non-Blocking in Atomic Commitment.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

Consensus Service: A Modular Approach for Building Agreement Protocols in Distributed Systems.
Proceedings of the Digest of Papers: FTCS-26, 1996

Atomic Updates of Replicated Data.
Proceedings of the Dependable Computing, 1996

Protocol Classes for Designing Reliable Distributed Environments.
Proceedings of the ECOOP'96, 1996

Fault-Tolerance by Replication in Distributed Systems.
Proceedings of the Reliable Software Technologies, 1996

1995
Modular Atomic Objects.
TAPOS, 1995

Nested Transactions: Reviewing the Coherence Contract.
Inf. Sci., 1995

Implementation of the GARF replicated objects platform.
Distributed Systems Engineering, 1995

Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus.
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Non-Blocking Atomic Commitment with an Unreliable Failure Detector.
Proceedings of the 14th Symposium on Reliable Distributed Systems, 1995

The Decentralized Non-Blocking Atomic Commitment Protocol.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Lessons from Designing and Implementing GARF.
Proceedings of the Object-Based Parallel and Distributed Computation, 1995

A Generic Multicast Primitive to Support Transactions on Replicated Objects in Distributed Systems.
Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), 1995

1994
The GARF Library of DSM Consistency Models.
Proceedings of the 6th ACM SIGOPS European Workshop: Matching Operating Systems to Application Needs, 1994

Atomic Object Composition.
Proceedings of the Object-Oriented Programming, Proceedings of the 8th European Conference, 1994

Transaction Model vs. Virtual Synchrony Model: Bridging the Gap.
Proceedings of the Theory and Practice in Distributed Systems, International Workshop, 1994

1993
Distributed Programming in GARF.
Proceedings of the Object-Based Distributed Programming, 1993

1992
Dealing with atomicity in object-based distributed systems.
OOPS Messenger, 1992

Active Objects on Parallel Machines: a Case Study.
Proceedings of the TOOLS 1992: 7th International Conference on Technology of Object-Oriented Languages and Systems, 1992

Coping with the Process Proliferation Problem in Concurrent Object-Based Language Implementations.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Nesting Actions through Asynchronous Message Passing: the ACS Protocol.
Proceedings of the ECOOP '92, European Conference on Object-Oriented Programming, Utrecht, The Netherlands, June 29, 1992


  Loading...