Hugues Fauconnier

From MaRDI portal
Person:391247

Available identifiers

zbMath Open fauconnier.huguesMaRDI QIDQ391247

List of research outcomes

PublicationDate of PublicationType
When is Recoverable Consensus Harder Than Consensus?2024-03-26Paper
Optimal algorithms for synchronous Byzantine \(k\)-set agreement2023-09-07Paper
Optimal algorithms for synchronous Byzantine \(k\)-set agreement2023-06-12Paper
Communication Complexity of Wait-Free Computability in Dynamic Networks2022-09-01Paper
Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement2022-06-08Paper
The assignment problem2021-10-06Paper
Making local algorithms wait-free: the case of ring coloring2019-11-22Paper
Making local algorithms wait-free: the case of ring coloring2019-06-21Paper
A characterization of \(t\)-resilient colorless task anonymous solvability2019-01-30Paper
https://portal.mardi4nfdi.de/entity/Q31749282018-07-18Paper
Uniform Consensus with Homonyms and Omission Failures2016-12-19Paper
t-Resilient Immediate Snapshot Is Impossible2016-12-01Paper
On the Space Complexity of Set Agreement2016-03-23Paper
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling2016-01-08Paper
Byzantine agreement with homonyms2015-09-11Paper
On implementing omega with weak reliability and synchrony assumptions2015-09-04Paper
Communication-efficient leader election and consensus with limited link synchrony2015-08-03Paper
The weakest failure detectors to solve certain fundamental problems in distributed computing2015-08-03Paper
Wait-freedom with advice2015-03-25Paper
Fast fault-tolerant agreement algorithms2015-03-10Paper
Sharing is harder than agreeing2014-12-12Paper
Wait-freedom with advice2014-12-05Paper
Linear space bootstrap communication schemes2014-12-02Paper
Partial synchrony based on set timeliness2014-07-23Paper
Byzantine agreement with homonyms2014-03-28Paper
Byzantine agreement with homonyms in synchronous systems2014-01-10Paper
On implementing omega in systems with weak reliability and synchrony assumptions2013-06-28Paper
Partial synchrony based on set timeliness2013-02-04Paper
Stabilizing leader election in partial synchronous systems with crash failures2012-03-07Paper
The disagreement power of an adversary2012-02-06Paper
The minimum information about failures for solving non-local tasks in message-passing systems2012-02-06Paper
Tight failure detection bounds on atomic object implementations2010-07-14Paper
Algorithms for Extracting Timeliness Graphs2010-06-17Paper
The Disagreement Power of an Adversary2009-11-19Paper
The Weakest Failure Detector for Message Passing Set-Agreement2008-11-20Paper
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors2008-09-02Paper
The perfectly synchronized round-based model of distributed computing2007-05-14Paper
Theoretical Aspects of Computing – ICTAC 20052006-11-01Paper
Distributed Computing2006-11-01Paper
Mutual exclusion in asynchronous systems with failure detectors2005-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44371262003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44360442003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q27668822002-01-28Paper
Parallélisation d'algorithmes avec un nombre fixe de processeurs1990-01-01Paper
Sémantique asynchrone et comportements infinis en CPS1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hugues Fauconnier