default search action
Franck Petit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c76]Lélia Blin, Gabriel Le Bouder, Franck Petit:
Optimal Memory Requirement for Self-stabilizing Token Circulation. SIROCCO 2024: 101-118 - 2023
- [j44]Yoann Dieudonné
, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. Algorithmica 85(10): 3110-3143 (2023) - [j43]Karine Altisen, Stéphane Devismes
Self-stabilizing systems in spite of high dynamics. Theor. Comput. Sci. 964: 113966 (2023) - [c75]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? - Toward a Robustness Refinement. SAND 2023: 7:1-7:15 - [i28]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? Toward a Robustness Refinement. CoRR abs/2304.05831 (2023) - 2022
- [c74]Lélia Blin, Colette Johnen
Silent Anonymous Snap-Stabilizing Termination Detection. SRDS 2022: 156-165 - [e6]Stéphane Devismes
Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings. Lecture Notes in Computer Science 13751, Springer 2022, ISBN 978-3-031-21016-7 [contents] - 2021
- [j42]Stéphane Devismes
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64(1): 132-154 (2021) - [c73]Karine Altisen, Stéphane Devismes
Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165 - [c72]Karine Altisen, Stéphane Devismes, Anaïs Durand
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31 - 2020
- [j41]Sébastien Bouchard
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11): 3250-3281 (2020) - [j40]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806: 429-445 (2020) - [c71]Karine Altisen, Stéphane Devismes
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229 - [c70]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. SPAA 2020: 117-127 - [i27]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR abs/2005.00875 (2020) - [i26]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. CoRR abs/2005.00880 (2020)
2010 – 2019
- 2019
- [b1]Karine Altisen, Stéphane Devismes
Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00885-6 - [j39]Stéphane Devismes
Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019) - [j38]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné
Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput. 32(4): 317-337 (2019) - [j37]Swan Dubois, Rachid Guerraoui
The weakest failure detector for eventual consistency. Distributed Comput. 32(6): 479-492 (2019) - [j36]Yoann Dieudonné, Shlomi Dolev
Explicit Communication Among Stigmergic Robots. Int. J. Found. Comput. Sci. 30(2): 315-332 (2019) - [j35]Karine Altisen, Stéphane Devismes
Gradual stabilization. J. Parallel Distributed Comput. 123: 26-45 (2019) - [i25]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR abs/1905.04106 (2019) - 2018
- [j34]Sébastien Bouchard
On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133: 39-43 (2018) - [c69]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC 2018: 48:1-48:13 - [c68]Marjorie Bournat, Swan Dubois, Franck Petit:
Gracefully Degrading Gathering in Dynamic Rings. SSS 2018: 349-364 - [i24]Marjorie Bournat, Swan Dubois
Gracefully Degrading Gathering in Dynamic Rings. CoRR abs/1805.05137 (2018) - 2017
- [j33]Karine Altisen, Alain Cournier, Stéphane Devismes
Self-stabilizing leader election in polynomial steps. Inf. Comput. 254: 330-366 (2017) - [c67]Marjorie Bournat, Swan Dubois
Computability of Perpetual Exploration in Highly Dynamic Rings. ICDCS 2017: 794-804 - [c66]Sébastien Bouchard
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. DISC 2017: 8:1-8:16 - [i23]Arnaud Casteigts, Swan Dubois
Robustness in Highly Dynamic Networks. CoRR abs/1703.03190 (2017) - [i22]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR abs/1710.08291 (2017) - 2016
- [j32]Eddy Caron, Ajoy Kumar Datta, Franck Petit
Self-Stabilizing Prefix Tree Based Overlay Networks. Int. J. Found. Comput. Sci. 27(5): 607-630 (2016) - [j31]Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi, Franck Petit
The Next 700 Impossibility Results in Time-Varying Graphs. Int. J. Netw. Comput. 6(1): 27-41 (2016) - [j30]Borzoo Bonakdarpour, Stéphane Devismes
Snap-stabilizing committee coordination. J. Parallel Distributed Comput. 87: 26-42 (2016) - [j29]Alain Cournier, Ajoy Kumar Datta, Stéphane Devismes
The expressive power of snap-stabilization. Theor. Comput. Sci. 626: 40-66 (2016) - [c65]Karine Altisen, Stéphane Devismes
Gradual Stabilization Under \tau -Dynamics. Euro-Par 2016: 588-602 - [e5]Borzoo Bonakdarpour, Franck Petit
Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings. Lecture Notes in Computer Science 10083, 2016, ISBN 978-3-319-49258-2 [contents] - [i21]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois
Asynchronous approach in the plane: A deterministic polynomial algorithm. CoRR abs/1612.02168 (2016) - [i20]Marjorie Bournat, Swan Dubois
Computability of Perpetual Exploration in Highly Dynamic Rings. CoRR abs/1612.05767 (2016) - 2015
- [j28]Michel Raynal, Franck Petit
Special Issue on Distributed Computing and Networking. Theor. Comput. Sci. 561: 87 (2015) - [c64]Nicolas Braud-Santoni
A Generic Framework for Impossibility Results in Time-Varying Graphs. IPDPS Workshops 2015: 483-489 - [c63]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Enabling Ring Exploration with Myopic Oblivious Robots. IPDPS Workshops 2015: 490-499 - [c62]Stéphane Devismes
Optimal Torus Exploration by Oblivious Robots. NETYS 2015: 183-199 - [c61]Swan Dubois
The Weakest Failure Detector for Eventual Consistency. PODC 2015: 375-384 - [c60]Swan Dubois
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems. SSS 2015: 51-66 - [i19]Swan Dubois
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems. CoRR abs/1502.00378 (2015) - [i18]Swan Dubois
The Weakest Failure Detector for Eventual Consistency. CoRR abs/1505.03469 (2015) - 2014
- [c59]François Bonnet
Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols. SRDS Workshops 2014: 50-59 - [c58]Karine Altisen, Alain Cournier, Stéphane Devismes
Self-stabilizing Leader Election in Polynomial Steps. SSS 2014: 106-119 - [i17]Nicolas Braud-Santoni, Swan Dubois
The Next 700 Impossibility Results in Time-Varying Graphs. CoRR abs/1412.6007 (2014) - 2013
- [j27]Alain Cournier, Swan Dubois
The snap-stabilizing message forwarding algorithm on tree topologies. Theor. Comput. Sci. 496: 89-112 (2013) - [j26]Stéphane Devismes
Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498: 10-27 (2013) - [j25]Yoann Dieudonné, Florence Levé, Franck Petit
Deterministic geoleader election in disoriented anonymous systems. Theor. Comput. Sci. 506: 43-54 (2013) - [j24]Xavier Défago
Preface. Theor. Comput. Sci. 512: 1 (2013) - [c57]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration by Oblivious Agents with Local Vision. ICDCS 2013: 347-356 - [c56]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration with Oblivious Myopic Robots. ASCoMS@SAFECOMP 2013 - [c55]Evangelos Bampas
Self-stabilizing Balancing Algorithm for Containment-Based Trees. SSS 2013: 191-205 - [c54]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. SSS 2013: 363-366 - 2012
- [j23]Yoann Dieudonné, Franck Petit
Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428: 47-57 (2012) - [c53]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. ICDCN 2012: 46-60 - [c52]Stéphane Devismes
Optimal Grid Exploration by Asynchronous Oblivious Robots. SSS 2012: 64-76 - [c51]Eddy Caron, Florent Chuffart, Anissa Lamani, Franck Petit:
Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems. SSS 2012: 239-252 - [c50]François Bonnet
Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols. SSS 2012: 282-284 - [c49]Stéphane Devismes
On efficiency of unison. TADDS 2012: 20-25 - [i16]Yoann Dieudonné, Florence Levé, Franck Petit, Vincent Villain:
Deterministic Leader Election Among Disoriented Anonymous Sensors. CoRR abs/1202.4486 (2012) - [i15]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration with Oblivious Myopic Robots. CoRR abs/1205.5003 (2012) - [i14]Eddy Caron, Florent Chuffart, Anissa Lamani, Franck Petit:
Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems. CoRR abs/1207.1337 (2012) - [i13]Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero:
Self-Stabilizing Balancing Algorithm for Containment-Based Trees. CoRR abs/1212.3418 (2012) - 2011
- [j22]Fabienne Carrier, Stéphane Devismes
Asymptotically Optimal Deterministic Rendezvous. Int. J. Found. Comput. Sci. 22(5): 1143-1159 (2011) - [j21]Ajoy Kumar Datta, Franck Petit
Stabilization, Safety, and Security of Distributed Systems (SSS 2009). Theor. Comput. Sci. 412(33): 4227 (2011) - [j20]Stéphane Devismes
Autour de l'autostabilisation. 1. Techniques généralisant l'approche. Tech. Sci. Informatiques 30(7): 873-894 (2011) - [j19]Stéphane Devismes
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. Tech. Sci. Informatiques 30(7): 895-922 (2011) - [c48]Borzoo Bonakdarpour, Stéphane Devismes
Snap-Stabilizing Committee Coordination. IPDPS 2011: 231-242 - [e4]Xavier Défago
Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Grenoble, France, October 10-12, 2011. Proceedings. Lecture Notes in Computer Science 6976, Springer 2011, ISBN 978-3-642-24549-7 [contents] - [i12]Stéphane Devismes
Optimal grid exploration by asynchronous oblivious robots. CoRR abs/1105.2461 (2011) - [i11]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. CoRR abs/1107.6014 (2011) - 2010
- [j18]Eddy Caron, Frédéric Desprez, Franck Petit
Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems. Parallel Process. Lett. 20(1): 15-30 (2010) - [j17]Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit
Deterministic Robot-Network Localization is Hard. IEEE Trans. Robotics 26(2): 331-339 (2010) - [c47]Yoann Dieudonné, Franck Petit
Brief announcement: leader election vs pattern formation. PODC 2010: 404-405 - [c46]Bertrand Ducourthial, Sofiane Khalfallah
Best-effort group service in dynamic networks. SPAA 2010: 233-242 - [c45]Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. SSS 2010: 546-559 - [c44]Yoann Dieudonné, Franck Petit, Vincent Villain:
Leader Election Problem versus Pattern Formation Problem. DISC 2010: 267-281 - [e3]Franck Petit, Sébastien Tixeuil:
Proceedings of the Third International Workshop on Reliability, Availability, and Security, WRAS 2010, conjunction with PODC 2010 Zurich, Switzerland, July 29, 2010. ACM 2010, ISBN 978-1-4503-0642-3 [contents] - [i10]Anissa Lamani, Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. CoRR abs/1006.3432 (2010)
2000 – 2009
- 2009
- [j16]Yoann Dieudonné, Franck Petit
Scatter of Robots. Parallel Process. Lett. 19(1): 175-184 (2009) - [c43]Yoann Dieudonné, Franck Petit:
Self-stabilizing Deterministic Gathering. ALGOSENSORS 2009: 230-241 - [c42]Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal
Deaf, Dumb, and Chatting Asynchronous Robots. OPODIS 2009: 71-85 - [c41]Fabienne Carrier, Stéphane Devismes
Space-Optimal Deterministic Rendezvous. PDCAT 2009: 342-347 - [c40]Yoann Dieudonné, Shlomi Dolev
Brief announcement: deaf, dumb, and chatting robots. PODC 2009: 308-309 - [c39]Stéphane Devismes
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots. SIROCCO 2009: 195-208 - [e2]Rachid Guerraoui
Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Lecture Notes in Computer Science 5873, Springer 2009, ISBN 978-3-642-05117-3 [contents] - [i9]Stéphane Devismes
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots. CoRR abs/0902.1834 (2009) - [i8]Yoann Dieudonné, Franck Petit, Vincent Villain:
Leader Election Problem Versus Pattern Formation Problem. CoRR abs/0902.2851 (2009) - [i7]Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot. CoRR abs/0902.3549 (2009) - [i6]Yoann Dieudonné, Franck Petit:
Self-stabilizing Determinsitic Gathering. CoRR abs/0905.0747 (2009) - 2008
- [j15]Christian Boulinier, Franck Petit
Synchronous vs. Asynchronous Unison. Algorithmica 51(1): 61-80 (2008) - [j14]Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit
Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. 108(5): 273-278 (2008) - [j13]Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit
Circle formation of weak mobile robots. ACM Trans. Auton. Adapt. Syst. 3(4): 16:1-16:20 (2008) - [c38]Christian Boulinier, Mathieu Levert, Franck Petit:
Snap-Stabilizing Waves in Anonymous Networks. ICDCN 2008: 191-202 - [c37]Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit
On the solvability of the localization problem in robot networks. ICRA 2008: 480-485 - [c36]Christian Boulinier, Franck Petit
Self-stabilizing wavelets and rho-hops coordination. IPDPS 2008: 1-8 - [c35]Yoann Dieudonné, Franck Petit:
Squaring the Circle with Weak Mobile Robots. ISAAC 2008: 354-365 - [c34]Carole Delporte-Gallet, Stéphane Devismes
With Finite Memory Consensus Is Easier Than Reliable Broadcast. OPODIS 2008: 41-57 - [c33]Eddy Caron, Ajoy Kumar Datta, Franck Petit
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems. SRDS 2008: 207-216 - [i5]Bertrand Ducourthial, Sofiane Khalfallah, Franck Petit:
Best-effort Group Service in Dynamic Networks. CoRR abs/0810.3836 (2008) - 2007
- [j12]Alain Bui, Ajoy Kumar Datta, Franck Petit
Snap-stabilization and PIF in tree networks. Distributed Comput. 20(1): 3-19 (2007) - [j11]Yoann Dieudonné, Franck Petit
Circle formation of weak robots and Lyndon words. Inf. Process. Lett. 101(4): 156-162 (2007) - [j10]Franck Petit
Optimal snap-stabilizing depth-first token circulation in tree networks. J. Parallel Distributed Comput. 67(1): 1-12 (2007) - [c32]Yoann Dieudonné, Franck Petit:
Robots and Demons (The Code of the Origins). FUN 2007: 108-119 - [c31]Yoann Dieudonné, Franck Petit:
Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System. OPODIS 2007: 132-142 - [c30]Yoann Dieudonné, Franck Petit:
Swing Words to Make Circle Formation Quiescent. SIROCCO 2007: 166-179 - [c29]Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi:
Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems. SSS 2007: 82-96 - [i4]Christian Boulinier, Franck Petit:
Self-Stabilizing Wavelets and r-Hops Coordination. CoRR abs/0706.4015 (2007) - [i3]Yoann Dieudonné, Franck Petit:
Scatter of Weak Robots. CoRR abs/cs/0701179 (2007) - 2006
- [j9]Alain Cournier, Stéphane Devismes
Snap-Stabilizing Depth-First Search on Arbitrary Networks. Comput. J. 49(3): 268-280 (2006) - [c28]Eddy Caron, Frederic Desprez, Charles Fourdrignier, Franck Petit, Cédric Tedeschi:
A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. HiPC 2006: 171-182 - [c27]Christian Boulinier, Franck Petit, Vincent Villain:
Toward a Time-Optimal Odd Phase Clock Unison in Trees. SSS 2006: 137-151 - [c26]Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit:
Circle Formation of Weak Mobile Robots. SSS 2006: 262-275 - [i2]Yoann Dieudonné, Franck Petit:
Circle Formation of Weak Robots and Lyndon Words. CoRR abs/cs/0605096 (2006) - [i1]Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit:
Circle Formation of Weak Mobile Robots. CoRR abs/cs/0607060 (2006) - 2005
- [j8]Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit
Group Mutual Exclusion in Token Rings. Comput. J. 48(2): 239-252 (2005) - [j7]Alain Cournier, Ajoy Kumar Datta, Franck Petit
Optimal snap-stabilizing PIF algorithms in un-oriented trees. J. High Speed Networks 14(2): 185-200 (2005) - [c25]Eddy Caron, Frederic Desprez, Cédric Tedeschi, Franck Petit
A Peer-to-Peer Extension of Network-Enabled Server Systems. e-Science 2005: 430-437 - [c24]Christian Boulinier, Franck Petit, Vincent Villain:
Synchronous vs. Asynchronous Unison. Self-Stabilizing Systems 2005: 18-32 - 2004
- [j6]Colette Johnen, Franck Petit
Autostabilisation et protocoles réseau. Tech. Sci. Informatiques 23(8): 1027-1056 (2004) - [c23]Alain Cournier, Stéphane Devismes
Snap-Stabilizing Depth-First Search on Arbitrary Networks. OPODIS 2004: 267-282 - [c22]Christian Boulinier, Franck Petit
When graph theory helps self-stabilization. PODC 2004: 150-159 - 2003
- [c21]Alain Cournier, Ajoy Kumar Datta, Franck Petit
Enabling Snap-Stabilizatio. ICDCS 2003: 12-19 - [c20]Eddy Caron, Frederic Desprez, Franck Petit
A Hierarchical Resource Reservation Algorithm for Network Enabled. IPDPS 2003: 26 - [c19]Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit:
Self-Stabilizing Atomicity Refinement Allowing Neighborhood Concurrency. Self-Stabilizing Systems 2003: 102-112 - 2002
- [c18]Alain Cournier, Ajoy Kumar Datta, Franck Petit
Snap-Stabilizing PIF Algorithm in Arbitrary Networks. ICDCS 2002: 199-206 - [c17]Joffroy Beauquier, Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit
Group Mutual Exclusion In Tree Networks. ICPADS 2002: 111-116 - 2001
- [j5]Ajoy Kumar Datta, Shivashankar Gurumurthy, Franck Petit, Vincent Villain:
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks. Stud. Inform. Univ. 1(1): 1-22 (2001) - [c16]Alain Cournier, Franck Petit
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks. ICDCS 2001: 91-98 - [c15]Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit
Token Based Group Mutual Exclusion for Asynchronous Rings. ICDCS 2001: 691-694 - [c14]Alain Cournier, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Optimal Snap-Stabilizing PIF in Un-Oriented Trees. OPODIS 2001: 71-90 - [c13]Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Group Mutual Exclusion in Token Rings. SIROCCO 2001: 61-76 - [c12]Franck Petit:
Fast Self-Stabilizing Depth-First Token Circulation. WSS 2001: 200-215 - 2000
- [j4]Franck Petit, Vincent Villain:
Self-stabilizing Depth-first Token Circulation in Asynchronous Message-passing Systems. Comput. Artif. Intell. 19(5): 391-415 (2000) - [j3]Ajoy Kumar Datta, Colette Johnen, Franck Petit
Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Comput. 13(4): 207-218 (2000) - [j2]Franck Petit
Optimality and Self-Stabilization in Rooted Tree Networks. Parallel Process. Lett. 10(1): 3-14 (2000) - [c11]Ajoy Kumar Datta, Shivashankar Gurumurthy, Franck Petit
Self-Stabilizing Network Orientation Algorithms in Arbitrary Rooted Networks. ICDCS 2000: 576-583 - [c10]Sébastien Cantarell, Franck Petit:
Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings. OPODIS 2000: 71-90
1990 – 1999
- 1999
- [j1]Franck Petit
Optimality and Self-Stabilization in Rooted Tree Networks. Parallel Process. Lett. 9(3): 313-323 (1999) - [c9]Alain Bui, Ajoy Kumar Datta, Franck Petit
Space optimal PIF algorithm: self-stabilized with no extra space. IPCCC 1999: 20-26 - [c8]Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Snpa-Stabilizing PIF Algorithm in Trees. SIROCCO 1999: 32-46 - [c7]Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Optimal PIF in Tree Networks. WDAS 1999: 1-16 - [c6]Franck Petit, Vincent Villain:
Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms. WDAS 1999: 91-106 - [c5]Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
State-optimal snap-stabilizing PIF in tree networks. WSS 1999: 78-85 - [e1]Franck Petit, R. Gomez Cardenas:
Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, Hanoi, Vietnam, October 20-22, 1999. Studia Informatica Universalis, Suger, Saint-Denis, rue Catulienne, France 1999, ISBN 2-912590-10-8 [contents] - 1998
- [c4]Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain:
Self-stabilizing depth-first token circulation in arbitrary rooted networks. SIROCCO 1998: 229-243 - 1997
- [c3]Franck Petit
A Space-Efficient and Self-Stabilizing Depth-First Token Circulation Protocol for Asynchronous Message-Passing Systems (Short Version). Euro-Par 1997: 476-479 - [c2]Franck Petit
Color Optimal Self-Stabilizing Depth-First Token Circulation. ISPAN 1997: 317-323 - [c1]Franck Petit:
Highly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees. OPODIS 1997: 221-236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: