Hugues Fauconnier

According to our database1, Hugues Fauconnier authored at least 73 papers between 1987 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector.
Proceedings of the Parallel Computing Technologies, 2019

On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion.
Proceedings of the Advanced Information Networking and Applications, 2019

2018
A Characterization of t-Resilient Colorless Task Anonymous Solvability.
Proceedings of the Structural Information and Communication Complexity, 2018

An Anonymous Wait-Free Weak-Set Object Implementation.
Proceedings of the Networked Systems - 6th International Conference, 2018

The Assignment Problem.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

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

Set-Consensus Collections are Decidable.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Asynchronous Consensus with Bounded Memory.
Proceedings of the Networked Systems - 4th International Conference, 2016

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

2015
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling.
Proceedings of the Structural Information and Communication Complexity, 2015

On the Space Complexity of Set Agreement?
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.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

Leader Election in Rings with Homonyms.
Proceedings of the Networked Systems - Second 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

2013
Adaptive Register Allocation with a Linear Number of Registers.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.
Proceedings of the Networked Systems - First International Conference, 2013

Uniform Consensus with Homonyms and Omission Failures.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Linear Space Bootstrap Communication Schemes.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Homonyms with Forgeable Identifiers.
Proceedings of the Structural Information and Communication Complexity, 2012

Wait-freedom with advice.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Byzantine Agreement with Homonyms in Synchronous Systems.
Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

2011
Objets partagés et détecteurs de défaillances.
Technique et Science Informatiques, 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

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

Guidelines for the Verification of Population Protocols.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

2010
Stabilizing leader election in partial synchronous systems with crash failures.
J. Parallel Distrib. Comput., 2010

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

Approximation of delta-Timeliness.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

Algorithms for Extracting Timeliness Graphs.
Proceedings of the Structural Information and Communication Complexity, 2010

2009
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems.
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 disagreement power of an adversary: extended abstract.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Partial synchrony based on set timeliness.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Message-efficient omission-tolerant consensus with limited synchrony.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Fault-Tolerant Consensus in Unknown and Anonymous Networks.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Two Consensus Algorithms with Atomic Registers and Failure Detector Omega.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008
On implementing omega in systems with weak reliability and synchrony assumptions.
Distributed Computing, 2008

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

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

With Finite Memory Consensus Is Easier Than Reliable Broadcast.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

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

From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Robust Stabilizing Leader Election.
Proceedings of the Stabilization, 2007

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

Clock Synchronization in the Byzantine-Recovery Failure Model.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Consensus with Byzantine Failures and Little System Synchrony.
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

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

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

Fast fault-tolerant agreement algorithms.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Revisiting Failure Detection and Consensus in Omission Failure Environments.
Proceedings of the Theoretical Aspects of Computing, 2005

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

Communication-efficient leader election and consensus with limited link synchrony.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Designing Modular Services in the Scattered Byzantine Failure Model.
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

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

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

On implementing omega with weak reliability and synchrony assumptions.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

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

Latency Measures and Lower Bounds for Consensus with Failure Detectors.
Proceedings of the SIROCCO 9, 2002

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

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

2001
Stable Leader Election.
Proceedings of the Distributed Computing, 15th International Conference, 2001

An example of Real-Time Group Communication System.
Proceedings of the 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 2001

2000
Thrifty Generic Broadcast.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Fault-Tolerant Genuine Atomic Multicast to Multiple Groups.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999
Real-Time Fault-Tolerant Atomic Broadcast.
Proceedings of the Eighteenth Symposium on Reliable Distributed Systems, 1999

Synchronized Phased Systems.
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.
ACM Trans. Program. Lang. Syst., 1995

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

1987
Semantique Asynchrone et Comportements Infinis en CSP.
Theor. Comput. Sci., 1987


  Loading...