David Ilcinkas

Jérôme Leroux

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient.

[BibT_eX]

[DOI]

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

2023

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison.

[BibT_eX]

[DOI]

CoRR, 2023

Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions.

[BibT_eX]

[DOI]

Stéphane Devismes

Colette Johnen

Algorithmica, 2022

2021

Exploration of Dynamic Cactuses with Sub-logarithmic Overhead.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

2020

Exploration of carrier-based time-varying networks: The power of waiting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Beachcombing on strips and islands.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Deciding and verifying network properties locally with few output bits.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Framing Algorithms for Approximate Multicriteria Shortest Paths.

[BibT_eX]

[DOI]

Nicolas Hanusse

Antonin Lentz

Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019

Oblivious Robots on Graphs: Exploration.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

On asynchronous rendezvous in general graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Disconnected components detection and rooted shortest-path tree maintenance in networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

Linear Search by a Pair of Distinct-Speed Robots.

[BibT_eX]

[DOI]

Algorithmica, 2019

Silent self-stabilizing scheme for spanning-tree-like constructions.

[BibT_eX]

[DOI]

Stéphane Devismes

Colette Johnen

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

Structural Information in Distributed Computing.

[BibT_eX]

[DOI]

, 2019

2018

Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

On mobile agent verifiable problems.

[BibT_eX]

[DOI]

Evangelos Bampas

Inf. Comput., 2018

2017

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.

[BibT_eX]

[DOI]

Stéphane Devismes

Colette Johnen

Discret. Math. Theor. Comput. Sci., 2017

Robustness of the Rotor-Router Mechanism.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

The impact of dynamic events on the number of errors in networks.

[BibT_eX]

[DOI]

Christian Glacet

Nicolas Hanusse

Theor. Comput. Sci., 2016

2015

Brief Announcement: Routing the Internet with Very Few Entries.

[BibT_eX]

[DOI]

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

2014

Distributedly Testing Cycle-Freeness.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Exploration of Constantly Connected Dynamic Graphs Based on Cactuses.

[BibT_eX]

[DOI]

Ralf Klasing

Proceedings of the Structural Information and Communication Complexity, 2014

2013

Worst-case optimal exploration of terrains with obstacles.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.

[BibT_eX]

[DOI]

Algorithmica, 2013

On the Communication Complexity of Distributed Name-Independent Routing Schemes.

[BibT_eX]

[DOI]

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

2012

More efficient periodic traversal in anonymous undirected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles.

[BibT_eX]

[DOI]

Paola Flocchini

Nicola Santoro

Algorithmica, 2012

2011

Asynchronous deterministic rendezvous in bounded terrains.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

How many oblivious robots can explore a line.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Derandomizing random walks in undirected graphs using locally fair exploration strategies.

[BibT_eX]

[DOI]

Distributed Comput., 2011

On the Power of Waiting When Exploring Public Transportation Systems.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

The Impact of Edge Deletions on the Number of Errors in Networks.

[BibT_eX]

[DOI]

Christian Glacet

Nicolas Hanusse

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

Fast radio broadcasting with advice.

[BibT_eX]

[DOI]

Dariusz R. Kowalski

Theor. Comput. Sci., 2010

Remembering without memory: Tree exploration by asynchronous oblivious robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Communication algorithms with advice.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimal Exploration of Terrains with Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

The cost of monotonicity in distributed graph searching.

[BibT_eX]

[DOI]

Nicolas Nisse

David Soguet

Distributed Comput., 2009

Distributed computing with advice: information sensitivity of graph coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2009

Labeling Schemes for Tree Representation.

[BibT_eX]

[DOI]

Algorithmica, 2009

Euler Tour Lock-In Problem in the Rotor-Router Model.

[BibT_eX]

[DOI]

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

2008

Setting port numbers for fast graph exploration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Label-guided graph exploration by a finite automaton.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Tree exploration with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Impact of Asynchrony on the Behavior of Rational Selfish Agents.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Impact of memory size on graph exploration capability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.

[BibT_eX]

[DOI]

Paola Flocchini

Nicola Santoro

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

2006

Complexité en espace de l'exploration de graphes.

[BibT_eX]

[DOI]

PhD thesis, 2006

Oracle size: a new measure of difficulty for communication tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Tree Exploration with an Oracle.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

2005

Graph exploration by a finite automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

2004

Digraphs Exploration with Little Memory.

[BibT_eX]

[DOI]