Michel Raynal

According to our database1, Michel Raynal
  • authored at least 478 papers between 1980 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
From wait-free to arbitrary concurrent solo executions in colorless distributed computing.
Theor. Comput. Sci., 2017

Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems.
Theory Comput. Syst., 2017

A distributed leader election algorithm in crash-recovery and omissive systems.
Inf. Process. Lett., 2017

Distributed Universal Constructions: a Guided Tour.
Bulletin of the EATCS, 2017

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.
CoRR, 2017

Which Broadcast Abstraction Captures $k$-Set Agreement?
CoRR, 2017

Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version).
CoRR, 2017

(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains.
CoRR, 2017

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n2) messages, and constant time.
Acta Inf., 2017

Which Broadcast Abstraction Captures k-Set Agreement?.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Long-Lived Tasks.
Proceedings of the Networked Systems - 5th International Conference, 2017

Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour.
Proceedings of the Networked Systems - 5th International Conference, 2017

Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks.
Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications, 2017

2016
Set Agreement.
Encyclopedia of Algorithms, 2016

Message Adversaries.
Encyclopedia of Algorithms, 2016

Distributed Snapshots.
Encyclopedia of Algorithms, 2016

Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes.
IEEE Trans. Parallel Distrib. Syst., 2016

Distributed Slicing in Dynamic Systems.
IEEE Trans. Parallel Distrib. Syst., 2016

Predicate Detection in Asynchronous Distributed Systems: A Probabilistic Approach.
IEEE Trans. Computers, 2016

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.
SIAM J. Comput., 2016

Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast.
Parallel Processing Letters, 2016

A Fast Contention-Friendly Binary Search Tree.
Parallel Processing Letters, 2016

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems.
J. Parallel Distrib. Comput., 2016

Implementing set objects in dynamic distributed systems.
J. Comput. Syst. Sci., 2016

A necessary condition for Byzantine k-set agreement.
Inf. Process. Lett., 2016

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems.
CoRR, 2016

Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems.
CoRR, 2016

Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems.
CoRR, 2016

Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks.
CoRR, 2016

Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks.
CoRR, 2016

Special issue on NETYS'14 selected papers.
Computing, 2016

Distributed Universality.
Algorithmica, 2016

Are Byzantine Failures Really Different from Crash Failures?
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Making Local Algorithms Wait-Free: The Case of Ring Coloring.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

t-Resilient Immediate Snapshot Is Impossible.
Proceedings of the Structural Information and Communication Complexity, 2016

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems.
Proceedings of the Networked Systems - 4th International Conference, 2016

Optimal Collision/Conflict-Free Distance-2 Coloring in Wireless Synchronous Broadcast/Receive Tree Networks.
Proceedings of the 45th International Conference on Parallel Processing, 2016

A Look at Basics of Distributed Computing.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

Modular randomized byzantine k-set agreement in asynchronous message-passing systems.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks.
Proceedings of the Algorithms for Sensor Systems, 2016

Efficient Broadcast Protocol for the Internet of Things.
Proceedings of the 30th IEEE International Conference on Advanced Information Networking and Applications, 2016

2015
Special Issue on Distributed Computing and Networking.
Theor. Comput. Sci., 2015

Failure detectors in homonymous distributed systems (with an application to consensus).
J. Parallel Distrib. Comput., 2015

Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time.
J. ACM, 2015

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach.
CoRR, 2015

Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes.
CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability.
CoRR, 2015

Anonymous Obstruction-free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers.
CoRR, 2015

A Necessary Condition for Byzantine $k$-Set Agreement.
CoRR, 2015

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems.
CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract).
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Communication Patterns and Input Patterns in Distributed Computing - (Invited Talk).
Proceedings of the Structural Information and Communication Complexity, 2015

Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time.
Proceedings of the Structural Information and Communication Complexity, 2015

Eventual Leader Election Despite Crash-Recovery and Omission Failures.
Proceedings of the 21st IEEE Pacific Rim International Symposium on Dependable Computing, 2015

Minimal Synchrony for Byzantine Consensus.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstract.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Fisheye Consistency: Keeping Data in Synch in a Georeplicated World.
Proceedings of the Networked Systems - Third International Conference, 2015

Parallel Computing vs. Distributed Computing: A Great Confusion? (Position Paper).
Proceedings of the Euro-Par 2015: Parallel Processing Workshops, 2015

Concurrent Systems: Hybrid Object Implementations and Abortable Objects.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm.
Proceedings of the 29th IEEE International Conference on Advanced Information Networking and Applications, 2015

2014
Fisheye Consistency: Keeping Data in Synch in a Georeplicated World.
CoRR, 2014

Fair Synchronization in the Presence of Process Crashes and its Weakest Failure Detector.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.
Proceedings of the Structural Information and Communication Complexity, 2014

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Signature-free asynchronous byzantine consensus with t 22) messages.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed Universality.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

An Exercise in Concurrency: From Non-blocking Objects to Fair Objects.
Proceedings of the 17th International Conference on Network-Based Information Systems, 2014

Computing in the Presence of Concurrent Solo Executions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

What Can be Computed in a Distributed System?
Proceedings of the From Programs to Systems. The Systems perspective in Computing, 2014

Simple Deadlock Detection for the And-Communication Model.
Proceedings of the Eighth International Conference on Complex, 2014

A Simple Broadcast Algorithm for Recurrent Dynamic Systems.
Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013
The weakest failure detector to implement a register in asynchronous systems with hybrid communication.
Theor. Comput. Sci., 2013

Power and limits of distributed computing shared memory models.
Theor. Comput. Sci., 2013

Trust-aware peer sampling: Performance and privacy tradeoffs.
Theor. Comput. Sci., 2013

Towards a universal construction for transaction-based multiprocess programs.
Theor. Comput. Sci., 2013

An Introductory Tutorial to Concurrency-Related Distributed Recursion.
Bulletin of the EATCS, 2013

Anonymous asynchronous systems: the case of failure detectors.
Distributed Computing, 2013

Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems.
Proceedings of the Structural Information and Communication Complexity, 2013

Fault-Tolerant Leader Election in Mobile Dynamic Distributed Systems.
Proceedings of the IEEE 19th Pacific Rim International Symposium on Dependable Computing, 2013

Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Cliff-Edge Consensus: Agreeing on the Precipice.
Proceedings of the Parallel Computing Technologies - 12th International Conference, 2013

On the Consensus Number of Non-adaptive Perfect Renaming.
Proceedings of the Networked Systems - First International Conference, 2013

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

A Generalized Mutual Exclusion Problem and Its Algorithm.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

No Hot Spot Non-blocking Skip List.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

A Contention-Friendly Binary Search Tree.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

A Short Introduction to Synchronous Communication.
Proceedings of the 27th IEEE International Conference on Advanced Information Networking and Applications, 2013

Coordination and Computation in Distributed Intelligent MEMS.
Proceedings of the 27th IEEE International Conference on Advanced Information Networking and Applications, 2013

Distributed Algorithms for Message-Passing Systems.
Springer, ISBN: 978-3-642-38122-5, 2013

Concurrent Programming - Algorithms, Principles, and Foundations.
Springer, ISBN: 978-3-642-32026-2, 2013

2012
Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn.
IEEE Trans. Parallel Distrib. Syst., 2012

Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations).
Theor. Comput. Sci., 2012

Computability in distributed computing: a Tutorial.
SIGACT News, 2012

Help when needed, but no more: Efficient read/write partial snapshot.
J. Parallel Distrib. Comput., 2012

From the Happened-Before Relation to the Causal Ordered Set Abstraction.
J. Parallel Distrib. Comput., 2012

Specifying and implementing an eventual leader service for dynamic systems.
IJWGS, 2012

No double discount: Condition-based simultaneity yields limited gain.
Inf. Comput., 2012

Brief Announcement: A Contention-Friendly, Non-blocking Skip List.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors.
Proceedings of the Structural Information and Communication Complexity, 2012

A speculation-friendly binary search tree.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

When and How Process Groups Can Be Used to Reduce the Renaming Space.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus).
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

Towards a Universal Construction for Transaction-Based Multiprocess Programs.
Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

STM Systems: Enforcing Strong Isolation between Transactions and Non-transactional Code.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets.
Proceedings of the Sixth International Conference on Complex, 2012

Leader Election: From Higham-Przytycka's Algorithm to a Gracefully Degrading Algorithm.
Proceedings of the Sixth International Conference on Complex, 2012

Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register.
Proceedings of the IEEE 26th International Conference on Advanced Information Networking and Applications, 2012

2011
Software transactional memories: an approach for multicore programming.
The Journal of Supercomputing, 2011

On the road to the weakest failure detector for k-set agreement in message-passing systems.
Theor. Comput. Sci., 2011

The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity.
TAAS, 2011

Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results.
Bulletin of the EATCS, 2011

The renaming problem in shared memory systems: An introduction.
Computer Science Review, 2011

Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus)
CoRR, 2011

A liveness condition for concurrent objects: x-wait-freedom.
Concurrency and Computation: Practice and Experience, 2011

Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

A Survey on Some Recent Advances in Shared Memory Models.
Proceedings of the Structural Information and Communication Complexity, 2011

The Universe of Symmetry Breaking Tasks.
Proceedings of the Structural Information and Communication Complexity, 2011

The universe of symmetry breaking tasks.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Looking for Efficient Implementations of Concurrent Objects.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

Distributed Computing with Mobile Robots: An Introductory Survey.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

Specifying and Implementing an Eventual Leader Service for Dynamic Systems.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

A Simple Snapshot Algorithm for Multicore Systems.
Proceedings of the 5th Latin-American Symposium on Dependable Computing, 2011

A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

On the Implementation of Concurrent Objects.
Proceedings of the Dependable and Historic Computing, 2011

A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem.
Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications, 2011

2010
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2010

Fault-tolerant Agreement in Synchronous Message-passing Systems
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2010

From an Asynchronous Intermittent Rotating Star to an Eventual Leader.
IEEE Trans. Parallel Distrib. Syst., 2010

Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound.
Theor. Comput. Sci., 2010

Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures.
Theory Comput. Syst., 2010

Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony.
J. Comput. Sci. Technol., 2010

A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems.
Inf. Process. Lett., 2010

The k-simultaneous consensus problem.
Distributed Computing, 2010

A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory.
Comput. J., 2010

A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems.
Algorithmica, 2010

Anonymous Asynchronous Systems: The Case of Failure Detectors.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

The 2010 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

On Adaptive Renaming under Eventually Limited Contention.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On asymmetric progress conditions.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

The multiplicative power of consensus numbers.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

The x-Wait-Freedom Progress Condition.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model.
Proceedings of the Eighth European Dependable Computing Conference, 2010

D2HT: The Best of Both Worlds, Integrating RPS and DHT.
Proceedings of the Eighth European Dependable Computing Conference, 2010

Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?.
Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, 2010

2009
Eventual Clusterer: A Modular Approach to Designing Hierarchical Consensus Protocols in MANETs.
IEEE Trans. Parallel Distrib. Syst., 2009

On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System.
IEEE Trans. Parallel Distrib. Syst., 2009

From adaptive renaming to set agreement.
Theor. Comput. Sci., 2009

Revisiting simultaneous consensus with crash failures.
J. Parallel Distrib. Comput., 2009

Conditions for Set Agreement with an Application to Synchronous Systems.
J. Comput. Sci. Technol., 2009

A note on atomicity: Boosting Test&Set to solve consensus.
Inf. Process. Lett., 2009

Help When Needed, But No More: Efficient Read/Write Partial Snapshot.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation.
Proceedings of the Stabilization, 2009

Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road?
Proceedings of the Stabilization, 2009

A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition.
Proceedings of the Structural Information and Communication Complexity, 2009

Regular Register: An Implementation in a Churn Prone Environment.
Proceedings of the Structural Information and Communication Complexity, 2009

Joining a Distributed Shared Memory Computation in a Dynamic Distributed System.
Proceedings of the Software Technologies for Embedded and Ubiquitous Systems, 2009

Brief announcement: virtual world consistency: a new condition for STM systems.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Software Transactional Memories: An Approach for Multicore Programming.
Proceedings of the Parallel Computing Technologies, 10th International Conference, 2009

Implementing a Register in a Dynamic Distributed System.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Shared Memory Synchronization in Presence of Failures: An Exercise-Based.
Proceedings of the 2009 International Conference on Complex, 2009

2008
Set Agreement.
Proceedings of the Encyclopedia of Algorithms, 2008

Modularity: a first class concept to address distributed systems.
SIGACT News, 2008

The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.
SIAM J. Comput., 2008

Using asynchrony and zero degradation to speed up indulgent consensus protocols.
J. Parallel Distrib. Comput., 2008

An impossibility about failure detectors in the iterated immediate snapshot model.
Inf. Process. Lett., 2008

Anonymous graph exploration without collision by mobile robots.
Inf. Process. Lett., 2008

On the computability power and the robustness of set agreement-oriented failure detector classes.
Distributed Computing, 2008

Timed Quorum System for Large-Scale and Dynamic Environments
CoRR, 2008

Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
CoRR, 2008

No Double Discount: Condition-Based Simultaneity Yields Limited Gain.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Locks Considered Harmful: A Look at Non-traditional Synchronization.
Proceedings of the Software Technologies for Embedded and Ubiquitous Systems, 2008

From anarchy to geometric structuring: the power of virtual coordinates.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Looking for the optimal conditions for solving set agreement.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

On Modeling Fault Tolerance of Gossip-Based Reliable Multicast Protocols.
Proceedings of the 2008 International Conference on Parallel Processing, 2008

Conditions for Set Agreement with an Application to Synchronous Systems.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

Narrowing Power vs. Efficiency in Synchronous Set Agreement.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

The Iterated Restricted Immediate Snapshot Model.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Synchronization is Coming Back, But is it the Same?
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007
On the Respective Power of *P and *S to Solve One-Shot Agreement Problems.
IEEE Trans. Parallel Distrib. Syst., 2007

An Adaptive Programming Model for Fault-Tolerant Distributed Computing.
IEEE Trans. Dependable Sec. Comput., 2007

Preface.
Theor. Comput. Sci., 2007

Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks.
IEEE Trans. Computers, 2007

Asynchronous Agreement and Its Relation with Error-Correcting Codes.
IEEE Trans. Computers, 2007

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.
J. Parallel Distrib. Comput., 2007

Distributed Slicing in Dynamic Systems
CoRR, 2007

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

DISC at Its 20th Anniversary (Stockholm, 2006).
Proceedings of the Distributed Computing, 21st International Symposium, 2007

A Subjective Visit to Selected Topics in Distributed Computing.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

The Eventual Clusterer Oracle and Its Application to Consensus in MANETs.
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability.
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

The notion of a timed register and its application to indulgent synchronization.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

From Renaming to Set Agreement.
Proceedings of the Structural Information and Communication Complexity, 2007

The Eventual Leadership in Dynamic Mobile Networking Environments.
Proceedings of the 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 2007

From an intermittent rotating star to a leader.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Failure detectors are schedulers.
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

Looking for a Definition of Dynamic Distributed Systems.
Proceedings of the Parallel Computing Technologies, 2007

Timed Quorum Systems for Large-Scale and Dynamic Environments.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Small-World Networks: From Theoretical Bounds to Practical Systems.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

From an Intermittent Rotating Star to a Leader.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Eventual Leader Service in Unreliable Asynchronous Systems: Why? How?
Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 12, 2007

A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs.
Proceedings of the Mobile Ad-Hoc and Sensor Networks, Third International Conference, 2007

A Timing Assumption and a t-Resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems.
Proceedings of the Tenth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2007), 2007

Distributed Slicing in Dynamic Systems.
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), 2007

Electing an Eventual Leader in an Asynchronous Shared Memory System.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

Workshop on Dependable Application Support for Self-Organizing Networks (DASSON 2007).
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

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

2006
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership.
IEEE Trans. Parallel Distrib. Syst., 2006

A Time-free Assumption to Implement Eventual Leadership.
Parallel Processing Letters, 2006

Synchronous condition-based consensus.
Distributed Computing, 2006

Distributed Slicing in Dynamic Systems
CoRR, 2006

Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures.
Proceedings of the Structural Information and Communication Complexity, 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

Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems).
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system.
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

Irreducibility and additivity of set agreement-oriented failure detector classes.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Hierarchical Consensus Protocol for Mobile Ad Hoc Networks.
Proceedings of the 14th Euromicro International Conference on Parallel, 2006

Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime.
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006

In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Committee Decision Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

The Power and Limit of Adding Synchronization Messages for Synchronous Agreement.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

From static distributed systems to dynamic systems: an approach for a first step.
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems.
IEEE Trans. Dependable Sec. Comput., 2005

$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems.
Parallel Processing Letters, 2005

Asynchronous bounded lifetime failure detectors.
Inf. Process. Lett., 2005

Stabilizing mobile philosophers.
Inf. Process. Lett., 2005

Wait-free computing: an introductory lecture.
Future Generation Comp. Syst., 2005

From Static Distributed Systems to Dynamic Systems.
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005

A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

The combined power of conditions and failure detectors to solve asynchronous set agreement.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Brief announcement: abstractions for implementing atomic objects in dynamic systems.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Allowing Atomic Objects to Coexist with Sequentially Consistent Objects.
Proceedings of the Parallel Computing Technologies, 2005

Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes.
Proceedings of the Parallel Computing Technologies, 2005

Two Abstractions for Implementing Atomic Objects in Dynamic Systems.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

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

Building Responsive TMR-Based Servers in Presence of Timing Constraints.
Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), 2005

Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Building and Using Quorums Despite any Number of Process of Crashes.
Proceedings of the Dependable Computing, 2005

A Hybrid and Adaptive Model for Fault-Tolerant Distributed Computing.
Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June, 2005

A Simple Protocol Offering Both Atomic Consistent Read Operations and Sequentially Consistent Read Operations.
Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA 2005), 2005

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

A necessary and sufficient condition for transforming limited accuracy failure detectors.
J. Comput. Syst. Sci., 2004

A weakest failure detector-based asynchronous consensus protocol for f (DOI)
Inf. Process. Lett., 2004

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols.
Distributed Computing, 2004

Quorum-Based Multi-Invocation Model for Replicated Objects.
Concurrent Engineering: R&A, 2004

The Synchronous Condition-Based Consensus Hierarchy.
Proceedings of the Distributed Computing, 18th International Conference, 2004

The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Crash-Resilient Time-Free Eventual Leadership.
Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 2004

Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems.
Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 2004

Optimal early stopping uniform consensus in synchronous systems with process omission failures.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

A Hybrid Approach for Building Eventually Accurate Failure Detectors.
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004

Brief announcement: the synchronous condition-based consensus hierarchy.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Brief announcement: veto number and the respective power of eventual failure detectors.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

A Methodological Construction of an Efficient Sequential Consistency Protocol.
Proceedings of the 3rd IEEE International Symposium on Network Computing and Applications (NCA 2004), 30 August, 2004

The Notion of Veto Number for Distributed Agreement Problems.
Proceedings of the Distributed Computing, 2004

A Distributed Implementation of Sequential Consistency with Multi-Object Operations.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

2003
Early Stopping in Global Data Computation.
IEEE Trans. Parallel Distrib. Syst., 2003

Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems and Its Use in Quorum-Based Replication.
IEEE Trans. Knowl. Data Eng., 2003

Efficient Causality-Tracking Timestamping.
IEEE Trans. Knowl. Data Eng., 2003

Consensus in Byzantine asynchronous systems.
J. Discrete Algorithms, 2003

Conditions on input vectors for consensus solvability in asynchronous distributed systems.
J. ACM, 2003

Reliable Compare & Swap for Fault-Tolerant Synchronization.
Proceedings of the 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), 2003

An Optimal Atomic Broadcast Protocol and an Implementation Framework.
Proceedings of the 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), 2003

Using Conditions to Expedite Consensus in Synchronous Distributed Systems.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Brief announcement: early decision despite general process omission failures.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

The Renaming Problem as an Introduction to Structures for Wait-Free Computing.
Proceedings of the Parallel Computing Technologies, 2003

A Hierarchy of Conditions for Asynchronous Interactive Consistency.
Proceedings of the Parallel Computing Technologies, 2003

Nested Invocation Protocol for Object-Based Systems.
Proceedings of the 6th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2003), 2003

Uniform Agreement Despite Process Omission Failures.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Anonymous Publish/Subscribe in P2P Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

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

Elastic Vector Time.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Challenges of Future Distributed Computing Systems.
Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003

Looking for a Common View for Mobile Worlds.
Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003

Asynchronous Implementation of Failure Detectors.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Evaluating the Condition-Based Approach to Solve Consensus.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Token-Based Sequential Consistency in Asynchronous Distributed Systems.
Proceedings of the 17th International Conference on Advanced Information Networking and Applications (AINA'03), 2003

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?
Proceedings of the Future Directions in Distributed Computing, 2003

Ordering vs Timeliness: Two Facets of Consistency?
Proceedings of the Future Directions in Distributed Computing, 2003

2002
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors.
IEEE Trans. Computers, 2002

Interval Consistency of Asynchronous Distributed Computations.
J. Comput. Syst. Sci., 2002

A Note on the Determination of the Immediate Predecessors in a Distributed Computation.
Int. J. Found. Comput. Sci., 2002

An introduction to oracles for asynchronous distributed systems.
Future Generation Comp. Syst., 2002

Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems.
IEEE Distributed Systems Online, 2002

Real-time based strong consistency for distributed objects.
Comput. Syst. Sci. Eng., 2002

Token-based sequential consistency.
Comput. Syst. Sci. Eng., 2002

Condition-Based Protocols for Set Agreement Problems.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Distributed Agreement and Its Relation with Error-Correcting Codes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Sequential consistency as lazy linearizability.
SPAA, 2002

Tracking immediate predecessors in distributed computations.
SPAA, 2002

Consensus in Synchronous Systems: A Concise Guided Tour.
Proceedings of the 9th Pacific Rim International Symposium on Dependable Computing (PRDC 2002), 2002

An Introduction to the Renaming Problem.
Proceedings of the 9th Pacific Rim International Symposium on Dependable Computing (PRDC 2002), 2002

Towards a formal model for view maintenance in data warehouses.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Asynchronous interactive consistency and its relation with error-correcting codes.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Building responseive TMR-based servers in presence of timing constraints.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Early stopping in aglobal data computation.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Wait-Free Objects for Real-Time Systems? (position paper).
Proceedings of the 5th International Symposiun on Object Oriented Real-Time Distributed Computing, 2002

Approximate Real-Time Clocks for Scheduled Events.
Proceedings of the 5th International Symposiun on Object Oriented Real-Time Distributed Computing, 2002

Sequential Consistency as Lazy Linearizability.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

A Versatile and Modular Consensus Protoco.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

2001
Consensus-Based Fault-Tolerant Total Order Multicast.
IEEE Trans. Parallel Distrib. Syst., 2001

Mastering Agreement Problems in Distributed Systems.
IEEE Software, 2001

Leader-Based Consensus.
Parallel Processing Letters, 2001

Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property.
Inf. Process. Lett., 2001

Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol.
Inf. Comput., 2001

The logically instantaneous communication mode: a communication abstraction.
Future Generation Comp. Syst., 2001

Direct dependency-based determination of consistent global checkpoints.
Comput. Syst. Sci. Eng., 2001

Consistent Checkpointing for Transaction Systems.
Comput. J., 2001

Real-Time Based Strong Consistency for Distributed Objects.
Proceedings of the 6th Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2001), 2001

Conditions on input vectors for consensus solvability in asynchronous distributed systems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Consensus Protocol Based on a Weak FailureDetector and a Sliding Round Window.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

Randomized k-set agreement.
SPAA, 2001

Efficient Condition-Based Consensus.
Proceedings of the SIROCCO 8, 2001

An Adaptive Failure Detection Protocol.
Proceedings of the 8th Pacific Rim International Symposium on Dependable Computing (PRDC 2001), 2001

A hierarchy of conditions for consensus solvability.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles.
Proceedings of the Parallel Computing Technologies, 2001

Consensus in One Communication Step.
Proceedings of the Parallel Computing Technologies, 2001

Randomized Multivalued Consensus.
Proceedings of the 4th International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2001), 2001

Primary Component Asynchronous Group Membership as an Instance of a Generic Agreement Framework.
Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems, 2001

A Condition for k-Set Agreement in Asynchronous Distributed Systems.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Shared State Consistency for Time-Sensitive Distributed Applications.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors.
IEEE Trans. Parallel Distrib. Syst., 2000

From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems.
Inf. Process. Lett., 2000

Communication-Based Prevention of Useless Checkpoints in Fistributed Computations.
Distributed Computing, 2000

Tracking causality in distributed systems: a suite of efficient protocols.
Proceedings of the SIROCCO 7, 2000

Consensus in byzantine asynchronous systems.
Proceedings of the SIROCCO 7, 2000

Low cost consensus-based Atomic Broadcast.
Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing (PRDC 2000), 2000

k-set agreement with limited accuracy failure detectors.
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Time and message-efficient S-based consensus (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Deadline-Constrained Causal Order.
Proceedings of the 3rd International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000), 2000

Consensus Based on Failure Detectors with a Perpetual Accuracy Property.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol.
Proceedings of the Parallel and Distributed Processing, 2000

Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

Computing Global Functions in Asynchronous Distributed Systems Prone to Process Crashes.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Logical Instantaneity and Causal Order: Two "First Class" Communication Modes for Parallel Computing.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

The Best of Both Worlds: A Hybrid Approach to Solve Consensus.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

From Crash Fault-Tolerance to Arbitrary-Fault Tolerance: Towards a Modular Approach.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

1999
Consistency Issues in Distributed Checkpoints.
IEEE Trans. Software Eng., 1999

Communication-Induced Determination of Consistent Snapshots.
IEEE Trans. Parallel Distrib. Syst., 1999

Normality: A Consistency Condition for Concurrent Objects.
Parallel Processing Letters, 1999

Restricted failure detectors: Definition and reduction protocols.
Inf. Process. Lett., 1999

Group membership failure detection: a simple protocol and its probabilistic analysis.
Distributed Systems Engineering, 1999

An adaptive architecture for causally consistent distributed services.
Distributed Systems Engineering, 1999

A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector.
Distributed Computing, 1999

Consistent Checkpointing in Distributed Databases: Towards a Formal Approach
CoRR, 1999

Probabilistic analysis of a group failure detection protocol.
Proceedings of the Fourth International Workshop on Object-Oriented Real-Time Dependable Systems, 1999

Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach.
Proceedings of the Distributed Computing, 1999

A General Framework to Solve Agreement Problems.
Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Timed Consistency for Shared Distributed Objects.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Rollback-Dependency Trackability: Visible Characterizations.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Logical Clocks for Unreliable Process Groups.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines.
Proceedings of the Parallel Computing Technologies, 1999

Consistent Lamport Clocks for Asynchronous Groups with Process Crashes.
Proceedings of the Parallel Computing Technologies, 1999

Simple Vector Clocks are limited to Solve some Causallity Related Problems.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

Direct Dependency-Based Determination of Consistent GlobalCheckpoints.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

On Classes of Problems in Asynchronous Distributed Systems with Process Crashes.
Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Illustrating the Use of Vector Clocks in Property Detection: An Example and a Counter-Example.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Distributed Database Checkpointing.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Time in Distributed System Models and Algorithms.
Proceedings of the Advances in Distributed Systems, 1999

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

1998
Efficient Distributed Detection of Conjunctions of Local Predicates.
IEEE Trans. Software Eng., 1998

k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion.
Theor. Comput. Sci., 1998

Consensus-Based Management of Distributed and Replicated Data.
IEEE Data Eng. Bull., 1998

Consistent Records in Asynchronous Computations.
Acta Inf., 1998

Lifetime Based Consistency Protocols for Distributed Objects.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Consensus in Asynchronous Systems Where Processes Can Crash and Recover.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Fault-Tolerant Total Order Multicast to Asynchronous Groups.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Exploiting write semantics in implementing partially replicated causal objects.
PDP, 1998

Asynchronous Protocols to Meet Real-Time Constraints: Is It Really Sensible? How to Proceed?
Proceedings of the 1st International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98), 1998

An Adaptive Protocol for Implementing Causally Consistent Distributed Services.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

Communication-Induced Determination of Consistent Snapshots.
Proceedings of the Digest of Papers: FTCS-28, 1998

1997
An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments.
J. Parallel Distrib. Comput., 1997

Shared Global States in Distributed Computations.
J. Comput. Syst. Sci., 1997

Adaptive checkpointing in message passing distributed systems.
Int. J. Systems Science, 1997

A suite of definitions for consistency criteria in distributed shared memories.
Annales des Télécommunications, 1997

Virtual Precedence in Asynchronous Systems: Cencept and Applications.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Preventing Useless Checkpoints in Distributed Computations.
Proceedings of the Sixteenth Symposium on Reliable Distributed Systems, 1997

Cycle Prevention in Distributed Checkpointing.
Proceedings of the On Principles Of Distributed Systems, 1997

Static and Dynamic Adaptation of Transactional Consistency.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

A Case Study of Agreement Problems in Distributed Systems: Non-Blocking Atomic Commitment.
Proceedings of the 2nd High-Assurance Systems Engineering Workshop (HASE '97), 1997

A Communication-Induced Checkpointing Protocol that Ensures Rollback-Dependency Trackability.
Proceedings of the Digest of Papers: FTCS-27, 1997

From serializable to causal transactions for collaborative applications.
Proceedings of the 23rd EUROMICRO Conference '97, 1997

Consistent State Restoration in Shared Memory Systems.
Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997

1996
Causal Delivery of Messages with Real-Time Data in Unreliable Networks.
Real-Time Systems, 1996

An Optimistic Protocol for a Linearizable Distributed Shared Memory System.
Parallel Processing Letters, 1996

A unified framework for the specification and run-time detection of dynamic properties in distributed computations.
Journal of Systems and Software, 1996

Erratum: Deadlock Models and a General Algorithm for Distributed Deadlock Detection.
J. Parallel Distrib. Comput., 1996

Logical Time: Capturing Causality in Distributed Systems.
IEEE Computer, 1996

From Group Communication to Transactions in Distributed Systems.
Commun. ACM, 1996

Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

On-The-Fly Detection Of Conjunctions Of Local Predicates In Distributed Computations.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

From Serializable to Causal Transactions (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Efficient Delta-Causal Broadcasting of Multimedia Applications (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

About State Recording in Asynchronous Computations (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

An Efficient Causal Ordering Algorithm for Mobile Computing Environments.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

Broadcast with Time and Causality Constraints for Multimedia Applications.
Proceedings of the 22rd EUROMICRO Conference '96, 1996

Efficient Message Logging for Uncoordinated Checkpointing Protocols.
Proceedings of the Dependable Computing, 1996

1995
An Implementation of Global Flush Primitives Using Counters.
Parallel Processing Letters, 1995

Deadlock Models and a General Algorithm for Distributed Deadlock Detection.
J. Parallel Distrib. Comput., 1995

Specification and Verification of Dynamic Properties in Distributed Computations.
J. Parallel Distrib. Comput., 1995

On-The-Fly Analysis of Distributed Computations.
Inf. Process. Lett., 1995

An introduction to snapshot algorithms in distributed computing.
Distributed Systems Engineering, 1995

Expressing and detecting control flow properties of distributed computations.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Debugging Distributed Executions by Using Language Recognition.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

Characterizing and Detecting The Set of Global States Seen by all Observers of a Distributed Computation.
Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995

Efficient Causally Ordered Communications for Multimedia Real-Time Applications.
Proceedings of the 4th International Symposium on High Performance Distributed Computing (HPDC '95), 1995

Deadlocks in Distributed Systems: Request Models and Definitions.
Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), 1995

Characterization of Consistent Global Checkpoints in Large-Scale Distributed Systems.
Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), 1995

From Causal Consistency to Sequential Consistency in Shared Memory Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Replaying Distributed Executions.
AADEBUG, 1995

Recognition of Patterns on Control Flows for Debugging Distributed Executions.
AADEBUG, 1995

1994
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms.
IEEE Trans. Parallel Distrib. Syst., 1994

Local States in Distributed Computations: A Few Relations and Formulas.
Operating Systems Review, 1994

Towards the Construction of Distributed Detection Programs, with an Application to Distributed Termination.
Distributed Computing, 1994

On-the-fly replay: a practical paradigm and its implementation for distributed debugging.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Inevitable global states: a concept to detect unstable properties of distributed computations in an observer independent way.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

On the Fly Testing of Regular Patterns in Distributed Computations.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

On Granularity of Events in Distributed Computations.
Proceedings of the Specification of Parallel Algorithms, 1994

Sequential Consistency in Distributed Systems.
Proceedings of the Theory and Practice in Distributed Systems, International Workshop, 1994

Definition and Implementation of a Flexible Communication Primitive for Distributed Programming.
Proceedings of the Applications in Parallel and Distributed Computing, 1994

An Efficient Implementation of Sequentially Consistent Distributed Shared Memories.
Proceedings of the Applications in Parallel and Distributed Computing, 1994

1993
Debugging tool for distributed Estelle programs.
Computer Communications, 1993

Detecting Atomic Sequences of Predicates in Distributed Computations.
Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, 1993

Termination Detection in a Very General Distributed Computing Model.
Proceedings of the 13th International Conference on Distributed Computing Systems, 1993

1992
About Logical Clocks for Distributed Systems.
Operating Systems Review, 1992

Distributed Evaluation: A Tool for Constructing Distributed Detection Programs.
Proceedings of the Theory of Computing and Systems, 1992

Synchronization and Concurrency Measures for Distributed Computations.
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

A General Method to Define Quorums.
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

A Distributed Kernel for Virtual Time Driven Applications.
Proceedings of the Computing and Information, 1992

1991
A Simple Taxonomy for Distributed Mutual Exclusion Algorithms.
Operating Systems Review, 1991

The Causal Ordering Abstraction and a Simple Way to Implement it.
Inf. Process. Lett., 1991

A Distributed Solution to the k-out of-M Resources Allocation Problem.
Proceedings of the Advances in Computing and Information, 1991

Implementation and Evaluation of Distributed Synchronization on a Distributed Memory Parallel Machine.
Proceedings of the Distributed Memory Computing, 2nd Euronean Conference, 1991

1990
Synchronization and control of distributed systems and programs.
Wiley series in parallel computing, Wiley, ISBN: 978-0-471-92453-1, 1990

1989
Prime Numbers as a Tool to Design Distributed Algorithms.
Inf. Process. Lett., 1989

1988
A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network.
Comput. J., 1988

Distributed algorithms and protocols.
Wiley, ISBN: 978-0-471-91754-0, 1988

1987
Calcul Réparti D'un Extrémum Et Du Routage Associé Dans Un Réseau Quelconque.
ITA, 1987

A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks.
Inf. Process. Lett., 1987

General and Efficient Decentralized Consensus Protocols.
Proceedings of the Distributed Algorithms, 1987

Detection of Stable Properties in Distributed Applications.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1983
Structured Specification of Communicating Systems.
IEEE Trans. Computers, 1983

1981
An Experience in Implementing Abstract Data Types.
Softw., Pract. Exper., 1981

Types in a Mixed Language System.
BIT, 1981

1980
Synchronization and Protection Features for Data Abstraction.
Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980


  Loading...