Hugues Fauconnier

Pierre Fraigniaud

Mikaël Rabie

Theor. Comput. Sci., 2025

2024

Non-negotiating Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2024

The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Some New Results With k-Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 12th International Conference, 2024

2023

Optimal algorithms for synchronous Byzantine k-set agreement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

2022

Distributed computability: Relating k-immediate snapshot and x-set agreement.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Optimal Algorithms for Synchronous Byzantine k-Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

When is Recoverable Consensus Harder Than Consensus?

[BibT_eX]

[DOI]

Panagiota Fatourou

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

A TLA+ Formal Proof of a Cross-Chain Swap.

[BibT_eX]

[DOI]

Zeinab Nehaï

François Bobot

Sara Tucci Piergiovanni

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021

The assignment problem.

[BibT_eX]

[DOI]

Giuliano Losa

Theor. Comput. Sci., 2021

On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2021

2020

t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems.

[BibT_eX]

[DOI]

CoRR, 2020

k-Immediate Snapshot and x-Set Agreement: How Are They Related?

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Communication Complexity of Wait-Free Computability in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

Byzantine k-Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 8th International Conference, 2020

2019

Making Local Algorithms Wait-Free: the Case of Ring Coloring.

[BibT_eX]

[DOI]

Armando Castañeda

Theory Comput. Syst., 2019

Editorial, special issue of NETYS 2015.

[BibT_eX]

[DOI]

Ahmed Bouajjani

Computing, 2019

Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Mikaël Rabie

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies, 2019

Towards Synthesis of Distributed Algorithms with SMT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 7th International Conference, 2019

On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Networking and Applications, 2019

2018

Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2018

A Characterization of t-Resilient Colorless Task Anonymous Solvability.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

Proceedings of the Structural Information and Communication Complexity, 2018

An Anonymous Wait-Free Weak-Set Object Implementation.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

A characterization of colorless anonymous t-resilient task computability.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

CoRR, 2017

2016

t-Resilient Immediate Snapshot Is Impossible.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Set-Consensus Collections are Decidable.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Asynchronous Consensus with Bounded Memory.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 4th International Conference, 2016

2015

Linear space bootstrap communication schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Wait-freedom with advice.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Beyond One Third Byzantine Failures.

[BibT_eX]

[DOI]

Cheng Wang

Anne-Marie Kermarrec

CoRR, 2015

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

On the Space Complexity of Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Fair Synchronization in the Presence of Process Crashes and its Weakest Failure Detector.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

Leader Election in Rings with Homonyms.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - Second International Conference, 2014

An Exercise in Concurrency: From Non-blocking Objects to Fair Objects.

[BibT_eX]

[DOI]

Carole Delporte

Proceedings of the 17th International Conference on Network-Based Information Systems, 2014

2013

Byzantine agreement with homonyms in synchronous systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Byzantine agreement with homonyms.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Adaptive Register Allocation with a Linear Number of Registers.

[BibT_eX]

[DOI]

Leslie Lamport

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - First International Conference, 2013

Uniform Consensus with Homonyms and Omission Failures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012

Partial synchrony based on set timeliness.

[BibT_eX]

[DOI]

Marcos K. Aguilera

Distributed Comput., 2012

Homonyms with Forgeable Identifiers.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

2011

Objets partagés et détecteurs de défaillances.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2011

The minimum information about failures for solving non-local tasks in message-passing systems.

[BibT_eX]

[DOI]

Distributed Comput., 2011

The disagreement power of an adversary.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Impersonal Failure Detection

[BibT_eX]

[DOI]

CoRR, 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Guidelines for the Verification of Population Protocols.

[BibT_eX]

[DOI]

Julien Clément

Mihaela Sighireanu

Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

2010

Stabilizing leader election in partial synchronous systems with crash failures.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

Tight failure detection bounds on atomic object implementations.

[BibT_eX]

[DOI]

J. ACM, 2010

Approximation of delta-Timeliness.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: byzantine agreement with homonyms.

[BibT_eX]

[DOI]

Anne-Marie Kermarrec

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

Algorithms for Extracting Timeliness Graphs.

[BibT_eX]

[DOI]

Mikel Larrea

Proceedings of the Structural Information and Communication Complexity, 2010

2009

Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The disagreement power of an adversary: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Message-efficient omission-tolerant consensus with limited synchrony.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Fault-Tolerant Consensus in Unknown and Anonymous Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Two Consensus Algorithms with Atomic Registers and Failure Detector Omega.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008

On implementing omega in systems with weak reliability and synchrony assumptions.

[BibT_eX]

[DOI]

Distributed Comput., 2008

The Weakest Failure Detector for Message Passing Set-Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Sharing is harder than agreeing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

With Finite Memory Consensus Is Easier Than Reliable Broadcast.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Agreement without knowing everybody: a first step to dynamicity.

[BibT_eX]

[DOI]

Mohssen Abboud

Proceedings of the 8th international conference on New technologies in distributed systems, 2008

Agreement and consistency without knowing the number of processes.

[BibT_eX]

[DOI]

Mohssen Abboud

Proceedings of the 8th international conference on New technologies in distributed systems, 2008

2007

The perfectly synchronized round-based model of distributed computing.

[BibT_eX]

[DOI]

Bastian Pochon

Inf. Comput., 2007

From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Robust Stabilizing Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

Secretive Birds: Privacy in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Clock Synchronization in the Byzantine-Recovery Failure Model.

[BibT_eX]

[DOI]

Emmanuelle Anceaume

Michel Hurfin

Josef Widder

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Consensus with Byzantine Failures and Little System Synchrony.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

When Birds Die: Making Population Protocols Fault-Tolerant.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2006

2005

Mutual exclusion in asynchronous systems with failure detectors.

[BibT_eX]

[DOI]

Petr Kouznetsov

J. Parallel Distributed Comput., 2005

(Almost) All Objects Are Universal in Message Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

Fast fault-tolerant agreement algorithms.

[BibT_eX]

[DOI]

Stephanie Lorraine Horn

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Revisiting Failure Detection and Consensus in Omission Failure Environments.

[BibT_eX]

[DOI]

Felix C. Freiling

Proceedings of the Theoretical Aspects of Computing, 2005

2004

The weakest failure detectors to solve certain fundamental problems in distributed computing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Communication-efficient leader election and consensus with limited link synchrony.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Designing Modular Services in the Scattered Byzantine Failure Model.

[BibT_eX]

[DOI]

Emmanuelle Anceaume

Michel Hurfin

Gérard Le Lann

Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

2003

Early Stopping in Global Data Computation.

[BibT_eX]

[DOI]

Jean-Michel Hélary

IEEE Trans. Parallel Distributed Syst., 2003

Distributed Programming for Dummies: A Shifting Transformation Technique.

[BibT_eX]

[DOI]

Bastian Pochon

Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), 2003

On implementing omega with weak reliability and synchrony assumptions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

Failure Detection Lower Bounds on Registers and Consensus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Latency Measures and Lower Bounds for Consensus with Failure Detectors.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

Early stopping in aglobal data computation.

[BibT_eX]

[DOI]

Jean-Michel Hélary

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

A Realistic Look At Failure Detectors.

[BibT_eX]

[DOI]

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

2001

Stable Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

An example of Real-Time Group Communication System.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 2001

2000

Thrifty Generic Broadcast.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 14th International Conference, 2000

Fault-Tolerant Genuine Atomic Multicast to Multiple Groups.

[BibT_eX]

Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999

Real-Time Fault-Tolerant Atomic Broadcast.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Synchronized Phased Systems.

[BibT_eX]

Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

1995

Local and Temporal Predicates In Distributed Systems.

[BibT_eX]

[DOI]

Bernadette Charron-Bost

ACM Trans. Program. Lang. Syst., 1995

1990

Parallélisation d'algorithmes avec un nombre fixe de processeurs.

[BibT_eX]

[DOI]

Maurice Nivat

RAIRO Theor. Informatics Appl., 1990

1987

Semantique Asynchrone et Comportements Infinis en CSP.

[BibT_eX]

[DOI]