Franck Petit

Orcid: 0000-0002-0948-7842

According to our database1, Franck Petit authored at least 110 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Almost Universal Anonymous Rendezvous in the Plane.
Algorithmica, October, 2023

Self-stabilizing systems in spite of high dynamics.
Theor. Comput. Sci., 2023

When Should You Wait Before Updating? - Toward a Robustness Refinement.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022
Silent Anonymous Snap-Stabilizing Termination Detection.
Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022

2021
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots.
Comput. J., 2021

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Robustness: A new form of heredity motivated by dynamic networks.
Theor. Comput. Sci., 2020

Deterministic Treasure Hunt in the Plane with Angular Hints.
Algorithmica, 2020

Almost Universal Anonymous Rendezvous in the Plane.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Introduction to Distributed Self-Stabilizing Algorithms
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02013-1, 2019

Gradual stabilization.
J. Parallel Distributed Comput., 2019

Explicit Communication Among Stigmergic Robots.
Int. J. Found. Comput. Sci., 2019

The weakest failure detector for eventual consistency.
Distributed Comput., 2019

Asynchronous approach in the plane: a deterministic polynomial algorithm.
Distributed Comput., 2019

Optimal torus exploration by oblivious robots.
Computing, 2019

2018
On deterministic rendezvous at a node of agents with arbitrary velocities.
Inf. Process. Lett., 2018

Gracefully Degrading Gathering in Dynamic Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2017
Self-stabilizing leader election in polynomial steps.
Inf. Comput., 2017

Robustness in Highly Dynamic Networks.
CoRR, 2017

Computability of Perpetual Exploration in Highly Dynamic Rings.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
The expressive power of snap-stabilization.
Theor. Comput. Sci., 2016

Snap-stabilizing committee coordination.
J. Parallel Distributed Comput., 2016

The Next 700 Impossibility Results in Time-Varying Graphs.
Int. J. Netw. Comput., 2016

Self-Stabilizing Prefix Tree Based Overlay Networks.
Int. J. Found. Comput. Sci., 2016

Gradual Stabilization Under \tau -Dynamics.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Special Issue on Distributed Computing and Networking.
Theor. Comput. Sci., 2015

Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Enabling Ring Exploration with Myopic Oblivious Robots.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

A Generic Framework for Impossibility Results in Time-Varying Graphs.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

2014
Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014

2013
Deterministic geoleader election in disoriented anonymous systems.
Theor. Comput. Sci., 2013

Optimal probabilistic ring exploration by semi-synchronous oblivious robots.
Theor. Comput. Sci., 2013

Preface.
Theor. Comput. Sci., 2013

The snap-stabilizing message forwarding algorithm on tree topologies.
Theor. Comput. Sci., 2013

Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Self-stabilizing Balancing Algorithm for Containment-Based Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Ring Exploration with Oblivious Myopic Robots.
Proceedings of the SAFECOMP 2013, 2013

Ring Exploration by Oblivious Agents with Local Vision.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012
Self-stabilizing gathering with strong multiplicity detection.
Theor. Comput. Sci., 2012

Deterministic Leader Election Among Disoriented Anonymous Sensors
CoRR, 2012

On efficiency of unison.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Optimal Grid Exploration by Asynchronous Oblivious Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

2011
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche.
Tech. Sci. Informatiques, 2011

Autour de l'autostabilisation. 1. Techniques généralisant l'approche.
Tech. Sci. Informatiques, 2011

Stabilization, Safety, and Security of Distributed Systems (SSS 2009).
Theor. Comput. Sci., 2011

Asymptotically Optimal Deterministic Rendezvous.
Int. J. Found. Comput. Sci., 2011

2010
Deterministic Robot-Network Localization is Hard.
IEEE Trans. Robotics, 2010

Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems.
Parallel Process. Lett., 2010

Leader Election Problem versus Pattern Formation Problem.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Snap-Stabilizing Linear Message Forwarding.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Best-effort group service in dynamic networks.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Brief announcement: leader election vs pattern formation.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Scatter of Robots.
Parallel Process. Lett., 2009

Self-stabilizing Determinsitic Gathering
CoRR, 2009

Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot
CoRR, 2009

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
CoRR, 2009

Brief announcement: deaf, dumb, and chatting robots.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Space-Optimal Deterministic Rendezvous.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Deaf, Dumb, and Chatting Asynchronous Robots.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Self-stabilizing Deterministic Gathering.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Circle formation of weak mobile robots.
ACM Trans. Auton. Adapt. Syst., 2008

Space efficient and time optimal distributed BFS tree construction.
Inf. Process. Lett., 2008

Synchronous vs. Asynchronous Unison.
Algorithmica, 2008

Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems.
Proceedings of the 27th IEEE Symposium on Reliable Distributed Systems (SRDS 2008), 2008

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

Squaring the Circle with Weak Mobile Robots.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Self-stabilizing wavelets and rho-hops coordination.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

On the solvability of the localization problem in robot networks.
Proceedings of the 2008 IEEE International Conference on Robotics and Automation, 2008

Snap-Stabilizing Waves in Anonymous Networks.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007
Optimal snap-stabilizing depth-first token circulation in tree networks.
J. Parallel Distributed Comput., 2007

Circle formation of weak robots and Lyndon words.
Inf. Process. Lett., 2007

Snap-stabilization and PIF in tree networks.
Distributed Comput., 2007

Scatter of Weak Robots
CoRR, 2007

Self-Stabilizing Wavelets and r-Hops Coordination
CoRR, 2007

Swing Words to Make Circle Formation Quiescent.
Proceedings of the Structural Information and Communication Complexity, 2007

Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Robots and Demons (The Code of the Origins).
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006
Snap-Stabilizing Depth-First Search on Arbitrary Networks.
Comput. J., 2006

Toward a Time-Optimal Odd Phase Clock Unison in Trees.
Proceedings of the Stabilization, 2006

A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems.
Proceedings of the High Performance Computing, 2006

2005
Optimal snap-stabilizing PIF algorithms in un-oriented trees.
J. High Speed Networks, 2005

Group Mutual Exclusion in Token Rings.
Comput. J., 2005

A Peer-to-Peer Extension of Network-Enabled Server Systems.
Proceedings of the First International Conference on e-Science and Grid Technologies (e-Science 2005), 2005

2004
Autostabilisation et protocoles réseau.
Tech. Sci. Informatiques, 2004

When graph theory helps self-stabilization.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Self-Stabilizing Atomicity Refinement Allowing Neighborhood Concurrency.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

A Hierarchical Resource Reservation Algorithm for Network Enabled.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Enabling Snap-Stabilizatio.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002
Group Mutual Exclusion In Tree Networks.
Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

Snap-Stabilizing PIF Algorithm in Arbitrary Networks.
Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

2001
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks.
Stud. Inform. Univ., 2001

Fast Self-Stabilizing Depth-First Token Circulation.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

Optimal Snap-Stabilizing PIF in Un-Oriented Trees.
Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001

Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Token Based Group Mutual Exclusion for Asynchronous Rings.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000
Optimality and Self-Stabilization in Rooted Tree Networks.
Parallel Process. Lett., 2000

Self-stabilizing depth-first token circulation in arbitrary rooted networks.
Distributed Comput., 2000

Self-stabilizing Depth-first Token Circulation in Asynchronous Message-passing Systems.
Comput. Artif. Intell., 2000

Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999
State-optimal snap-stabilizing PIF in tree networks.
Proceedings of the 1999 ICDCS Workshop on Self-stabilizing Systems, 1999

Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms.
Proceedings of the Distributed Data & Structures 2, 1999

Optimal PIF in Tree Networks.
Proceedings of the Distributed Data & Structures 2, 1999

Snpa-Stabilizing PIF Algorithm in Trees.
Proceedings of the SIROCCO'99, 1999

Space optimal PIF algorithm: self-stabilized with no extra space.
Proceedings of the IEEE International Performance Computing and Communications Conference, 1999

1997
Highly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees.
Proceedings of the On Principles Of Distributed Systems, 1997

Color Optimal Self-Stabilizing Depth-First Token Circulation.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

A Space-Efficient and Self-Stabilizing Depth-First Token Circulation Protocol for Asynchronous Message-Passing Systems (Short Version).
Proceedings of the Euro-Par '97 Parallel Processing, 1997


  Loading...