Emmanuel Godard

Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023

A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement.

[BibT_eX]

[DOI]

Yannis Coutouly

Proceedings of the 37th International Symposium on Distributed Computing, 2023

2020

Leader-based de-anonymization of an anonymous read/write memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Back to the Coordinated Attack Problem.

[BibT_eX]

[DOI]

Eloi Perdereau

Math. Struct. Comput. Sci., 2020

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Snap-Stabilizing Tasks in Anonymous Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Mutex-based Desanonymization of an Anonymous Read/Write Memory.

[BibT_eX]

[DOI]

CoRR, 2019

Anonymous Read/Write Memory: Leader Election and De-anonymization.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Mutex-Based De-anonymization of an Anonymous Read/Write Memory.

[BibT_eX]

[DOI]

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

2016

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions.

[BibT_eX]

[DOI]

Antoine Naudin

CoRR, 2016

k-Set Agreement in Communication Networks with Omission Faults.

[BibT_eX]

[DOI]

Eloi Perdereau

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

2015

A characterization of oblivious message adversaries for which Consensus is solvable.

[BibT_eX]

[DOI]

Étienne Coulouma

Joseph G. Peters

Theor. Comput. Sci., 2015

On the expressivity of time-varying graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Anonymous Graph Exploration with Binoculars.

[BibT_eX]

[DOI]

Antoine Naudin

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

2014

What Do We Need to Know to Elect in Networks with Unknown Participants?

[BibT_eX]

[DOI]

Antoine Naudin

Proceedings of the Structural Information and Communication Complexity, 2014

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard.

[BibT_eX]

[DOI]

Dorian Mazauric

Proceedings of the Algorithms for Sensor Systems, 2014

2013

A Characterization of Dynamic Networks Where Consensus Is Solvable.

[BibT_eX]

[DOI]

Étienne Coulouma

Proceedings of the Structural Information and Communication Complexity, 2013

2012

Election in partially anonymous networks with arbitrary knowledge in message passing systems.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks

[BibT_eX]

[DOI]

CoRR, 2012

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.

[BibT_eX]

[DOI]

Algorithmica, 2012

Brief announcement: waiting in dynamic networks.

[BibT_eX]

[DOI]

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

2011

Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults.

[BibT_eX]

[DOI]

Joseph G. Peters

Proceedings of the Structural Information and Communication Complexity, 2011

Minimal Obstructions for the Coordinated Attack Problem and Beyond.

[BibT_eX]

[DOI]

Tristan Fevat

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Termination Detection of Local Computations

[BibT_eX]

[DOI]

Gerard Tel

CoRR, 2010

2008

Local Terminations and Distributed Computability in Anonymous Networks.

[BibT_eX]

[DOI]

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

2007

About the Termination Detection in the Asynchronous Message Passing Model.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Mobile Agent Algorithms Versus Message Passing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2004

Characterizations of Classes of Graphs Recognizable by Local Computations.

[BibT_eX]

[DOI]

Anca Muscholl

Theory Comput. Syst., 2004

2003

Deducible and Equivalent Structural Knowledges in Distributed Algorithms.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Acyclic and k-distance coloring of the grid.

[BibT_eX]

[DOI]

Guillaume Fertin

André Raspaud

Inf. Process. Lett., 2003

2002

A self-stabilizing enumeration algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Minimum feedback vertex set and acyclic coloring.

[BibT_eX]

[DOI]

Guillaume Fertin

André Raspaud

Inf. Process. Lett., 2002

Equivalence of Structural Knowledges in Distributed Algorithms.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

Termination Detection of Distributed Algorithms by Graph Relabelling Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformation, First International Conference, 2002

A Characterization of Families of Graphs in Which Election Is Possible.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

1998

The Power of Local Computations in Graphs with Initial Knowledge.

[BibT_eX]

[DOI]