7 毕业博士 2013 - 2023

2003-2024 刊物

• 2024
  • L. Blin, G. Le Bouder, F. Petit : “Optimal Memory Requirement for Self-Stabilizing Token Circulation”, Lecture Notes in Computer Science (LNCS), Springer, Salerno, Italy (2024)
• 2023
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “Self-stabilizing Systems in Spite of High Dynamics”, Theoretical Computer Science, pp. 113966, (Elsevier) (2023)
  • S. Dubois, L. Feuilloley, F. Petit, M. Rabie : “When Should You Wait Before Updating? Toward a Robustness Refinement”, (2023)
  • L. Blin, C. Johnen, G. Le Bouder, F. Petit : “Silent Anonymous Snap-Stabilizing Termination Detection”, 2022 41^st International Symposium on Reliable Distributed Systems (SRDS), Vienna, Austria, pp. 156-165, (IEEE), (ISBN: 978-1-6654-9753-4) (2023)
• 2022
  • L. Blin, C. Johnen, G. Le Bouder, F. Petit : “Détection de terminaison silencieuse, anonyme, stabilisante instantanément”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
  • S. Devismes, F. Petit, K. Altisen, G. Di Luna, A. Fernandez Anta : “Stabilization, Safety, and Security of Distributed Systems”, vol. 13751, Lecture Notes in Computer Science, (Springer International Publishing) (2022)
• 2021
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics”, PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, pp. 21-31, (ACM) (2021)
  • S. Devismes, A. Lamani, F. Petit, P. Raymond, S. Tixeuil : “Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots”, The Computer Journal, vol. 64 (1), The Computer Journal, pp. 132-154, (Oxford University Press (UK)) (2021)
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “Self-stabilizing Systems in Spite of High Dynamics”, 22^nd International Conference on Distributed Computing and Networking, ICDCN'21, ICDCN '21: International Conference on Distributed Computing and Networking 2021, Nara, Japan, pp. 156–165 (2021)
• 2020
  • S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Almost Universal Anonymous Rendezvous in the Plane”, (2020)
  • S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Deterministic Treasure Hunt in the Plane with Angular Hints”, Algorithmica, vol. 82 (11), pp. 3250-3281, (Springer Verlag) (2020)
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “Élection Autostabilisante dans les Réseaux à Haute Dynamicité”, ALGOTEL 2020 – 22^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France (2020)
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics”, PODC 2020 - ACM Symposium on Principles of Distributed Computing n°227-229, Salerne / Virtual, Italy, (ACM) (2020)
  • S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Almost Universal Anonymous Rendezvous in the Plane”, SPAA '20: Proceedings of the 32^nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, pp. 117-127, (ACM) (2020)
  • A. Casteigts, S. Dubois, F. Petit, J. Robson : “Robustness: A new form of heredity motivated by dynamic networks”, Theoretical Computer Science, vol. 806, pp. 429-445, (Elsevier) (2020)
  • K. Altisen, S. Devismes, A. Durand, C. Johnen, F. Petit : “On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics”, (2020)
• 2019
  • S. Dubois, R. Guerraoui, P. Kuznetsov, F. Petit, P. Sens : “The weakest failure detector for eventual consistency”, Distributed Computing, vol. 32 (6), pp. 479-492, (Springer Verlag) (2019)
  • S. Devismes, A. Lamani, F. Petit, S. Tixeuil : “Optimal torus exploration by oblivious robots”, Computing, vol. 101 (9), pp. 1241-1264, (Springer Verlag) (2019)
  • S. Bouchard, M. Bournat, Y. Dieudonné, S. Dubois, F. Petit : “Asynchronous approach in the plane: a deterministic polynomial algorithm”, Distributed Computing, vol. 32 (4), pp. 317-337, (Springer Verlag) (2019)
  • S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Trouver un trésor plus rapidement avec des conseils angulaires”, ALGOTEL 2019 - 21^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France (2019)
  • K. Altisen, S. Devismes, S. Dubois, F. Petit : “Introduction to Distributed Self-Stabilizing Algorithms”, vol. 8 (1), Synthesis Lectures on Distributed Computing Theory, 1-165 pages, (Morgan & Claypool) (2019)
  • Y. Dieudonné, Sh. Dolev, F. Petit, M. Segal : “Explicit Communication Among Stigmergic Robots”, International Journal of Foundations of Computer Science, vol. 30 (02), pp. 315-332, (World Scientific Publishing) (2019)
  • K. Altisen, S. Devismes, A. Durand, F. Petit : “Gradual stabilization”, Journal of Parallel and Distributed Computing, vol. 123, pp. 26-45, (Elsevier) (2019)
• 2018
  • M. Bournat, S. Dubois, F. Petit : “Gracefully Degrading Gathering in Dynamic Rings”, Stabilization, Safety, and Security of Distributed Systems - 20^th International Symposium, SSS 2018, vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 349-364, (Springer) (2018)
  • S. Bouchard, M. Bournat, Y. Dieudonné, S. Dubois, F. Petit : “Approche asynchrone dans le plan : un algorithme déterministe polynomial”, ALGOTEL 2018 - 20^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France (2018)
  • K. Altisen, S. Devismes, A. Durand, F. Petit : “Stabilisation progressive”, ALGOTEL 2018 - 20^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France (2018)
  • M. Bournat, S. Dubois, F. Petit : “Gracefully Degrading Gathering in Dynamic Rings”, (2018)
  • S. Bouchard, Y. Dieudonné, F. Petit, A. Pelc : “On Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities”, Information Processing Letters, vol. 133, pp. 39-43, (Elsevier) (2018)
  • S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Deterministic Treasure Hunt in the Plane with Angular Hints”, 29^th International Symposium on Algorithms and Computation, ISAAC 2018, vol. 123, Leibniz International Proceedings in Informatics (LIPIcs), Jiaoxi Township, Taiwan, Province of China, pp. 48:1-48:13, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2018)
• 2017
  • S. Bouchard, M. Bournat, Y. Dieudonné, S. Dubois, F. Petit : “Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm”, 31^st International Symposium on Distributed Computing, DISC 2017, Vienna, Austria (2017)
  • M. Bournat, S. Dubois, F. Petit : “Computability of Perpetual Exploration in Highly Dynamic Rings”, The 37^th IEEE International Conference on Distributed Computing Systems (ICDCS 2017), Atlanta, United States (2017)
  • K. Altisen, A. Cournier, S. Devismes, A. Durand, F. Petit : “Self-Stabilizing Leader Election in Polynomial Steps”, Information and Computation, vol. 254 (3), pp. 330-366, (Elsevier) (2017)
  • M. Bournat, S. Dubois, F. Petit : “Quel est le nombre optimal de robots pour explorer un anneau hautement dynamique ?”, ALGOTEL 2017 - 19^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France (2017)
• 2016
  • M. Bournat, S. Dubois, F. Petit : “Computability of Perpetual Exploration in Highly Dynamic Rings”, (2016)
  • A. Cournier, Ajoy K. Datta, S. Devismes, F. Petit, V. Villain : “The expressive power of snap-stabilization”, Theoretical Computer Science, vol. 626, pp. 40–66, (Elsevier) (2016)
  • B. Bonakdarpour, S. Devismes, F. Petit : “Snap-Stabilizing Committee Coordination”, Journal of Parallel and Distributed Computing, vol. 87, pp. 26-42, (Elsevier) (2016)
  • K. Altisen, S. Devismes, A. Durand, F. Petit : “Gradual Stabilization under τ-Dynamics”, Euro-Par 2016 - 22^nd International Conference on Parallel and Distributed Computing, vol. 9833, Lecture Notes in Computer Science, Grenoble, France, pp. 588-602, (Springer) (2016)
  • E. Caron, A. Datta, F. Petit, C. Tedeschi : “Self-Stabilizing Prefix Tree Based Overlay Networks”, International Journal of Foundations of Computer Science, vol. 27 (5), pp. 607-630, (World Scientific Publishing) (2016)
  • N. Braud‑Santoni, S. Dubois, M. Kaaouachi, F. Petit : “The Next 700 Impossibility Results in Time-Varying Graphs”, International Journal of Networking and Computing, vol. 6 (1), pp. 27-41, (Higashi Hiroshima : Dept. of Computer Engineering, Hiroshima University) (2016)
• 2015
  • S. Dubois, R. Guerraoui, P. Kuznetsov, F. Petit, P. Sens : “The Weakest Failure Detector for Eventual Consistency”, 34^th Annual ACM Symposium on Principles of Distributed Computing (PODC-2015), Donostia-San Sebastián, Spain, Donostia-San Sebastián, Spain, pp. 375-384 (2015)
  • S. Dubois, M. Kaaouachi, F. Petit : “Dynamisme et Domination”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • K. Altisen, A. Cournier, S. Devismes, A. Durand, F. Petit : “Élection autostabilisante en un nombre polynomial de pas de calcul”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • N. Braud‑Santoni, S. Dubois, M. Kaaouachi, F. Petit : “A Generic Framework for Impossibility Results in Time-Varying Graphs”, Parallel and Distributed Processing Symposium Workshop (IPDPSW), 2015 IEEE International, Hyderabad, India, pp. 483-489, (IEEE) (2015)
  • Ajoy K. Datta, A. Lamani, L. Larmore, F. Petit : “Enabling Ring Exploration with Myopic Oblivious Robots”, Parallel and Distributed Processing Symposium Workshop (IPDPSW), 2015 IEEE International, Hyderabad, India (2015)
  • S. Devismes, A. Lamani, F. Petit, S. Tixeuil : “Optimal Torus Exploration by Oblivious Robots”, NETYS 2015 - Third International Conference on Networked Systems, vol. 9466, Lecture Notes in Computer Science, Agadir, Morocco, pp. 183-199, (Springer) (2015)
  • S. Dubois, M. Kaaouachi, F. Petit : “Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems”, 17^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'15), vol. 9212, Lecture Notes in Computer Science, Edmonton, AB, Canada, pp. 51-66, (Springer) (2015)
• 2014
  • N. Braud‑Santoni, S. Dubois, M. Kaaouachi, F. Petit : “The Next 700 Impossibility Results in Time-Varying Graphs”, (2014)
  • F. Bonnet, X. Défago, F. Petit, M. Potop‑Butucaru, S. Tixeuil : “Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols”, 2014 IEEE 33^rd International Symposium on Reliable Distributed Systems Workshops, Nara, Japan, pp. 50-59, (IEEE) (2014)
  • K. Altisen, A. Cournier, S. Devismes, A. Durand, F. Petit : “Self-Stabilizing Leader Election in Polynomial Steps”, SSS'2014, 16^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 8756, Lecture Notes in Computer Science, Paderborn, Germany, pp. 106-119, (Springer) (2014)
  • Ajoy K. Datta, A. Lamani, L. Larmore, F. Petit : “Explorer un anneau avec des robots amnésiques et myopes”, ALGOTEL 2014 -- 16^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Le Bois-Plage-en-Ré, France, pp. 1-4 (2014)
• 2013
  • A. Datta, A. Lamani, L. Larmore, F. Petit : “Ring Exploration with Oblivious Myopic Robots”, SAFECOMP 2013 - Workshop ASCoMS (Architecting Safety in Collaborative Mobile Systems) of the 32^nd International Conference on Computer Safety, Reliability and Security, Toulouse, France, pp. 335-342 (2013)
  • S. Devismes, F. Petit, S. Tixeuil : “Optimal probabilistic ring exploration by semi-synchronous oblivious robots”, Theoretical Computer Science, vol. 498, pp. 10-27, (Elsevier) (2013)
  • F. Petit, A. Lamani, S. Devismes, S. Tixeuil, P. Raymond : “Explorer une grille avec un minimum de robots amnésiques”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4 (2013)
  • A. Cournier, S. Dubois, A. Lamani, F. Petit, V. Villain : “Acheminement de messages instantanément stabilisant pour arbres couvrants”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4 (2013)
  • A. Datta, A. Lamani, L. Larmore, F. Petit : “Brief Announcement: Ring Exploration by Oblivious Robots With Vision Limited to 2 or 3”, 15^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, vol. 8255, Lecture Notes in Computer Science, Osaka, Japan, pp. 363-366, (Springer Berlin / Heidelberg) (2013)
  • E. Bampas, A. Lamani, F. Petit, M. Valero : “Self-Stabilizing Balancing Algorithm for Containment-Based Trees”, 15^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, vol. 8255, Lecture Notes in Computer Science, Osaka, Japan, pp. 191-205, (Springer Berlin / Heidelberg) (2013)
  • A. Datta, A. Lamani, L. Larmore, F. Petit : “Ring Exploration by Oblivious Agents with Local Vision”, 33^rd International Conference on Distributed Computing (ICDCS), Philadelphia, United States, pp. 347-356 (2013)
  • Y. Dieudonné, F. Levé, F. Petit, V. Villain : “Deterministic Geoleader Election in Disoriented Anonymous Systems”, Theoretical Computer Science, vol. 506, pp. 43-54, (Elsevier) (2013)
  • X. Défago, F. Petit, V. Villain : “Special Issue on Stabilization, Safety, and Security”, Theoretical Computer Science, vol. 512, pp. 1-142, (Elsevier) (2013)
  • A. Cournier, S. Dubois, A. Lamani, F. Petit, V. Villain : “The Snap-stabilizing message forwarding algorithm on tree topologies”, Theoretical Computer Science, vol. 496, pp. 89-112, (Elsevier) (2013)
  • F. Petit : “Note sous Cass. Soc. 28 novembre 2012, Le droit à une représentation syndicale spécifique chez les pilotes de ligne”, Droit Social, (Librairie technique et économique [1938-2011] - Dalloz [2012-....]) (2013)
• 2012
  • E. Bampas, A. Lamani, F. Petit, M. Valero : “Self-Stabilizing Balancing Algorithm for Containment-Based Trees”, (2012)
  • E. Caron, F. Chuffart, A. Lamani, F. Petit : “Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems”, (2012)
  • A. K.Datta, A. Lamani, L. Lawrence L., F. Petit : “Ring Exploration with Oblivious Myopic Robots”, (2012)
  • Y. Dieudonné, F. Petit : “Self-stabilizing gathering with strong multiplicity detection”, Theoretical Computer Science, vol. 428, pp. 47-57, (Elsevier) (2012)
  • E. Caron, F. Chuffart, A. Cournier, A. Lamani, F. Petit, C. Tedeschi, V. Villain : “Fault-Tolerant and Dynamic Service Discovery System”, 41 pages (2012)
  • F. Bonnet, X. Défago, F. Petit, M. Potop‑Butucaru, S. Tixeuil : “Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 7596, Lecture Notes in Computer Science, Toronto, Canada, pp. 282-284, (Springer) (2012)
  • S. Devismes, A. Lamani, F. Petit, P. Raymond, S. Tixeuil : “Optimal Grid Exploration by Asynchronous Oblivious Robots”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 7596, Lecture Notes in Computer Science, Toronto, Canada, pp. 64-76, (Springer) (2012)
  • E. Caron, F. Chuffart, A. Lamani, F. Petit : “Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems”, 14^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), vol. 7596, Lecture Notes in Computer Science, Toronto, Canada, pp. 239-252, (Springer) (2012)
  • A. Cournier, S. Dubois, A. Lamani, F. Petit, V. Villain : “Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies”, ICDCN 2012 - 13^th International Conference on Distributed Computing and Networking, vol. 7129, Lecture Notes in Computer Science, Hong Kong, China, pp. 46-60, (Springer) (2012)
• 2011
  • F. Carrier, S. Devismes, F. Petit, Y. Rivierre : “Asymptotically Optimal Deterministic Rendezvous”, International Journal of Foundations of Computer Science, vol. 22 (5), pp. 1143-1159, (World Scientific Publishing) (2011)
  • A. Cournier, S. Dubois, A. Lamani, F. Petit, V. Villain : “Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies”, (2011)
  • B. Bonakdarpour, S. Devismes, F. Petit : “Snap-Stabilizing Committee Coordination”, 25^th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, United States, pp. 231-242, (IEEE) (2011)
  • X. Défago, F. Petit, V. Villain : “Proceedings of the 13^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011)”, SSS 2011 - 13^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 6976, Lecture Notes in Computer Science, (Springer) (2011)
  • B. Bonakdarpour, S. Devismes, F. Petit : “Coordination de comités instantanément stabilisante”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
  • A. Lamani, A. Cournier, S. Dubois, F. Petit, V. Villain : “Acheminement de Messages Instantanément Stabilisant : Solution Optimale sur les Topologies Linéaires”, Rencontres francophones du Parallélisme, Saint Malo, France (2011)
  • S. Devismes, F. Petit, V. Villain : “Autour de l’autostabilisation. 1. Techniques généralisant l’approche”, Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, vol. 30 (7), pp. 873-894, (Lavoisier) (2011)
  • S. Devismes, F. Petit, V. Villain : “Autour de l’autostabilisation. 2. Techniques spécialisant l’approche”, Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, vol. 30 (7), pp. 895-922, (Lavoisier) (2011)
  • S. Devismes, A. Lamani, F. Petit, P. Raymond, S. Tixeuil : “Optimal grid exploration by asynchronous oblivious robots”, (2011)
  • A. Datta, F. Petit, R. Guerraoui : “Special Issue on Stabilization, Safety, and Security of Distributed Systems”, Theoretical Computer Science, vol. 412, (Elsevier) (2011)
• 2010
  • Y. Dieudonné, F. Petit, V. Villain : “Leader Election Problem versus Pattern Formation Problem”, 24^th International Symposium Distributed Computing DISC, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 267-281, (Springer) (2010)
  • A. Cournier, S. Dubois, A. Lamani, F. Petit, V. Villain : “Snap-Stabilizing Linear Message Forwarding”, 12^th International Symposium Stabilization, Safety, and Security of Distributed Systems, SSS, vol. 6366, Lecture Notes in Computer Science, New York, NY, United States, pp. 546-559, (Springer) (2010)
  • A. Lamani, A. Cournier, S. Dubois, F. Petit, V. Villain : “Snap-Stabilizing Linear Message Forwarding”, (2010)
  • B. Ducourthial, S. Khalfallah, F. Petit : “Best-effort group service in dynamic networks”, SPAA 2010: Proceedings of the 22^nd Annual ACM Symposium on Parallel Algorithms and Architectures, Thira, Santorini, Greece, pp. 233-242, (ACM) (2010)
  • F. Carrier, S. Devismes, F. Petit, Y. Rivierre : “Rendez-vous d’agents amnésiques”, 12^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle Dune, France, pp. 8 (2010)
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems”, Parallel Processing Letters, vol. 20 (1), pp. 15-30, (World Scientific Publishing) (2010)
  • Y. Dieudonné, F. Petit, V. Villain : “Brief Announcement: Leader Election vs Pattern Formation”, PODC '10 - 29^th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, Zurich, Switzerland, pp. 404-405, (ACM) (2010)
  • Y. Dieudonné, Sh. Dolev, F. Petit, M. Segal : “Des Robots Sourds-Muets Bien Bavards”, 12^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle Dune, France (2010)
  • Y. Dieudonné, O. Labbani‑Igbida, F. Petit : “Deterministic Robot-Network Localization is Hard”, IEEE Transactions on Robotics, vol. 26 (2), pp. 331-339, (IEEE) (2010)
  • F. Petit, S. Tixeuil : “Reliability, Availibility, and Security, 3^rd International Workshop (WRAS 2010)”, (2010)
  • F. Petit, S. Tixeuil : “WRAS ’10: Proceedings of the Third International Workshop on Reliability, Availability, and Security”, (ACM), (ISBN: 978-1-4503-0642-3) (2010)
• 2009
  • Y. Dieudonné, Sh. Dolev, F. Petit, M. Segal : “Deaf, Dumb, and Chatting Robots: Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robots”, Thirteenth International Conference On Principle Of DIstributed Systems (OPODIS 2009), vol. 5923, Lecture Notes in Computer Science, Springer, Nîmes, France, pp. 71-85, (Springer) (2009)
  • F. Carrier, S. Devismes, F. Petit, Y. Rivierre : “Space-Optimal Deterministic Rendezvous”, Second International Workshop on Reliability, Availability, and Security (WRAS 2009), Hiroshima, Japan, pp. 332-337, (IEEE) (2009)
  • S. Devismes, F. Petit, S. Tixeuil : “Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots”, Proceedings of Sirocco 2009, vol. 5869, Lecture Notes in Computer Science, Piran, Slovenia, pp. 195-208, (Springer) (2009)
  • S. Devismes, F. Petit, S. Tixeuil : “Exploration Optimale Probabiliste d’un Anneau par des Robots Semi-Synchrones et Amnésiques”, 11^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Carry-Le-Rouet, France (2009)
  • C. Delporte‑Gallet, S. Devismes, H. Fauconnier, F. Petit, S. Toueg : “Quand le consensus est plus simple que la diffusion fiable”, 11^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Carry-Le-Rouet, France (2009)
  • Y. Dieudonné, F. Petit, V. Villain : “Leader Election Problem Versus Pattern Formation Problem”, (2009)
  • S. Devismes, F. Petit, S. Tixeuil : “Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots”, 29 pages (2009)
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “Peer-to-Peer Service Discovery for Grid Computing”, chapter in Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications, (IGI Global, Information Science Publishing) (2009)
  • F. Petit, R. Guerraoui : “Proceedings of the 11^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009)”, vol. 5873, Lecture Notes in Computer Science, (Springer), (ISBN: 978-3-642-24549-7) (2009)
  • Y. Dieudonné, F. Petit : “Squaring the Circle with Weak Mobile Robots”, AlgoTel, Carry-Le-Rouet, France (2009)
  • Y. Dieudonné, F. Petit : “Self-stabilizing Deterministic Gathering”, (2009)
• 2008
  • B. Ducourthial, S. Khalfallah, F. Petit : “Best-effort Group Service in Dynamic Networks”, (2008)
  • E. Caron, A. Datta, F. Petit, C. Tedeschi : “Self-stabilization in tree-structured P2P Service Discovery Systems”, 27^th International Symposium on Reliable Distributed Systems (SRDS 2008), Naples, Italy (2008)
  • B. Ducourthial, S. Khalfallah, F. Petit : “Algorithme de gestion de groupe pour réseaux ad hoc fortement dynamiques”, 10^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), Saint-Malo, France, pp. 21-24 (2008)
  • Y. Dieudonné, F. Petit : “Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System”, 10^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), Saint-Malo, France, pp. 69-72 (2008)
• 2007
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “Snap-stabilizing Prefix Tree for Peer-to-peer Systems”, SSS 2007 - 9^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 4838, Lecture Notes in Computer Science, Paris, France, pp. 15, (Springer Verlag Berlin Heidelberg) (2007)
  • Ch. Boulinier, F. Petit : “Self-Stabilizing Wavelets and r-Hops Coordination”, (2007)
  • Y. Dieudonné, F. Petit : “Scatter of Weak Robots”, (2007)
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “Snap-stabilizing Prefix Tree for Peer-to-peer Systems”, 20 pages (2007)
• 2006
  • E. Caron, F. Desprez, Ch. Fourdrignier, F. Petit, C. Tedeschi : “A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems”, High Performance Computing - HiPC 2006, vol. 4297, LNCS, Bangalore, India, pp. 171-182, (Springer-Verlag Berlin Heidelberg) (2006)
  • E. Caron, Ch. Fourdrignier, F. Petit, C. Tedeschi : “Mécanisme de réparations pour un système P2P de découverte de services”, Perpi'2006 - Conférences conjointes RenPar'17 / SympA'2006 / CFSE'5 / JC'2006, Canet en Roussillon, France, pp. 8 (2006)
  • E. Caron, F. Desprez, Ch. Fourdrignier, F. Petit, C. Tedeschi : “A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems”, (2006)
  • Y. Dieudonné, F. Petit : “Circle Formation of Weak Robots and Lyndon Words”, (2006)
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi, Ch. Fourdrignier : “A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems”, 15 pages (2006)
• 2005
  • A. Cournier, S. Devismes, F. Petit, V. Villain : “Snap-Stabilizing Depth-First Search on Arbitrary Networks”, The Computer Journal, vol. 49 (3), pp. 268-280, (Oxford University Press (UK)) (2005)
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “A Peer-to-Peer Extension of Network-Enabled Server Systems”, First International Conference on e-Science and Grid Computing (e-Science'05), Melbourne, Australia, pp. 1-8, (IEEE) (2005)
• 2004
  • E. Caron, F. Desprez, F. Petit, C. Tedeschi : “Resource Localization Using Peer-To-Peer Technology for Network Enabled Servers”, (2004)
  • C. Johnen, F. Petit, S. Tixeuil : “Autostabilisation et protocoles réseau”, Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, vol. 23 (4), pp. 1027-1056, (Lavoisier) (2004)
• 2003
  • E. Caron, F. Desprez, F. Petit, V. Villain : “A Hierarchical Resource Reservation Algorithm for Network Enabled Servers”, (2003)
  • E. Caron, F. Desprez, F. Petit, V. Villain : “A Hierarchical Resource Reservation Algorithm for Network Enabled Servers”, IPDPS 2017 - International workshop on Large-Scale Parallel Processing, Nice, France (2003)
  • E. Caron, F. Desprez, F. Petit, V. Villain : “A Hierarchical Resource Reservation Algorithm for Network Enabled Servers”, (2003)