Stéphane Devismes
Présentation
Stéphane Devismes est actuellement professeur à l'Université de Picardie Jules Verne (Amiens, France) et membre de l'équipe ALCO du laboratoire MIS. Il a obtenu son doctorat à l'Université de Picardie Jules Verne en 2006. En 2006-2007, il a été maître de conférences à l'Université Denis Diderot (Paris VII). En 2007, il a effectué un post-doctorat d'un an au CNRS/Université Paris-Sud. De 2008 à 2021, il a été maître de conférences à l'Université Grenoble Alpes (France) et membre de l'équipe Synchrone du laboratoire VERIMAG. Ses recherches portent sur les questions théoriques du calcul distribué tolérant aux pannes, notamment en lien avec l'autostabilisation.
Domaines de recherche
Compétences
Publications
Publications
Self-stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal DiameterStabilization, Safety, and Security of Distributed Systems (SSS 2025), Oct 2025, Katmandou, Nepal. pp.192-210, ⟨10.1007/978-3-032-11127-2_16⟩ |
|
|
|
Analyse de l'autostabilisation de l'unisson synchrone via la satisfiabilité propositionnelleJournées Francophones de Programmation par Contraintes (JFPC 2025), Jun 2025, Dijon, France |
|
|
Outils d'analyse d'algorithmes distribués spécifiés dans le modèle à étatsALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint Valéry-sur-Somme, France |
Graph Exploration: The Impact of a Distance Constraint52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. ⟨10.4230/LIPIcs.ICALP.2025.68⟩ |
|
|
|
Temps, travail, espace : pourquoi choisir ? Un unisson autostabilisant et ses retombéesALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint-Valéry-Sur-Somme, France |
|
|
Being Efficient in Time, Space, and Workload: a Self-stabilizing Unison and its ConsequencesSTACS 2025: 42nd International Symposium on Theoretical Aspects of Computer Science, Mar 2025, Jena, Germany. pp.30:1-30:18, ⟨10.4230/LIPICS.STACS.2025.30⟩ |
Analyzing Self-Stabilization of Synchronous Unison via Propositional Satisfiability31st International Conference on Principles and Practice of Constraint Programming (CP 2025), Aug 2025, Glasgow, United Kingdom. pp.19:1--19:21, ⟨10.4230/LIPIcs.CP.2025.19⟩ |
|
|
|
Pour être César, il faut que tous les chemins viennent de la Domus AugustanaAlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2024, Saint-Briac-sur-Mer, France |
|
|
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficientPODC '24: 43rd ACM Symposium on Principles of Distributed Computing, Jun 2024, Nantes, France. pp.538-548, ⟨10.1145/3662158.3662803⟩ |
|
|
Nous aussi on fait du « log * » !AlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2024, Saint-Briac-sur-Mer, France |
On Self-stabilizing Leader Election in Directed NetworksPODC '24: 43rd ACM Symposium on Principles of Distributed Computing, Jun 2024, Nantes France, France. pp.527-537, ⟨10.1145/3662158.3662778⟩ |
|
|
|
Optimal Asynchronous Perpetual Grid ExplorationStabilization, Safety, and Security of Distributed Systems - 26th International Symposium, SSS 2024, Toshimitsu Masuzawa; Yoshiaki Katayama; Hirotsugu Kakugawa, Oct 2024, Nagoya, Japan. pp.89-105, ⟨10.1007/978-3-031-74498-3_6⟩ |
|
|
Exploring Worst Cases of Self-stabilizing Algorithms using Simulations25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Shlomi Dolev, Baruch Schieber, Oct 2023, New Jersey, United States. ⟨10.1007/978-3-031-44274-2⟩ |
|
|
Exploration en 3D par des robots désorientés : tu montes en bas ou tu descends en haut ?AlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France |
|
|
Pour battre à l'unisson, il faut que tous les chemins viennent de RomeAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese (Corse), France |
Certified Round Complexity of Self-Stabilizing Algorithms37th International Symposium on Distributed Computing, Oct 2023, L'Aquila, Italy. pp.1-22, ⟨10.4230/LIPIcs.DISC.2023.2⟩ |
|
|
|
Complexité certifiée d'algorithmes autostabilisants en rondes25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2023), May 2023, Cargese, France |
Self-stabilizing Synchronous Unison in Directed NetworksICDCN 2023: 24th International Conference on Distributed Computing and Networking, Jan 2023, Kharagpur India, France. pp.115-124, ⟨10.1145/3571306.3571397⟩ |
|
|
|
Model Checking of Distributed Algorithms using Synchronous Programs25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2023), Shlomi Dolev, Baruch Schieber, Oct 2023, Jersey City, NJ, United States. ⟨10.1007/978-3-031-44274-2⟩ |
|
|
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?FUN : Conference on Fun with Algorithms, May 2022, Island of Favignana, Sicily, Italy. ⟨10.4230/LIPIcs.FUN.2022.7⟩ |
|
|
Exploration perpétuelle : ça s'en va et ça revientAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France. pp.1-4, ⟨10.5281/zenodo.4640462⟩ |
|
|
Infinite Grid Exploration by Disoriented Robots8th Edition of the International Conference on NETworked and sYStems, NETYS, 2020, Marrakech, Morocco. pp.129-145, ⟨10.1007/978-3-030-67087-0_9⟩ |
|
|
Un jour sans finALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2021, La Rochelle, France |
|
|
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality9th International Conference, NETYS 2021, May 2021, Virtual, France. pp.95-110, ⟨10.1007/978-3-030-91014-3_7⟩ |
|
|
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common ChiralityInternational Conference on Distributed Computing and Networking, 2021, Nara, Japan. pp.76-85, ⟨10.1145/3427796.3427834⟩ |
|
|
On Implementing Stabilizing Leader Election with Weak Assumptions on Network DynamicsPODC '21: ACM Symposium on Principles of Distributed Computing, Jul 2021, Virtual Event, Italy. pp.21-31, ⟨10.1145/3465084.3467917⟩ |
Certification of an Exact Worst-Case Self-Stabilization TimeICDCN '21: International Conference on Distributed Computing and Networking 2021, Jan 2021, Nara Japan, France. pp.46-55, ⟨10.1145/3427796.3427832⟩ |
|
|
|
Self-stabilizing Systems in Spite of High Dynamics22nd International Conference on Distributed Computing and Networking, ICDCN'21, Jan 2021, Nara, Japan. pp.156-165, ⟨10.1145/3427796.3427838⟩ |
|
|
Élection Autostabilisante dans les Réseaux à Haute DynamicitéALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France |
|
|
SASA: a SimulAtor of Self-stabilizing Algorithms14th International Conference on Tests and Proofs, Jun 2020, Bergen, Norway. ⟨10.1007/978-3-030-50995-8⟩ |
|
|
Brief Announcement: Self-stabilizing Systems in Spite of High DynamicsPODC 2020 - ACM Symposium on Principles of Distributed Computing, Aug 2020, Salerne / Virtual, Italy. ⟨10.1145/3382734.3404502⟩ |
|
|
Vers l'infini et au delàALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France |
|
|
Finding Water on Poleless using Melomaniac Myopic Chameleon RobotsTenth International Conference on Fun with Algorithms (FUN 2020), Jun 2020, Island of Favignana, Trapani, Italy. pp.6:1-6:19, ⟨10.4230/LIPIcs.FUN.2021.6⟩ |
|
|
Squeezing Streams and Composition of Self-stabilizing Algorithms39th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2019, Copenhagen, Denmark. pp.21-38, ⟨10.1007/978-3-030-21759-4_2⟩ |
|
|
Brief Announcement: Infinite Grid Exploration by Disoriented Robots26th International Colloquium on Structural Information and Communication Complexity SIROCCO 2019, Jul 2019, L'Aquila, Italy |
|
|
Soyez efficace, rembobinezALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France |
|
|
Self-Stabilizing Distributed Cooperative Reset2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), Jul 2019, Dallas, United States. pp.379-389, ⟨10.1109/ICDCS.2019.00045⟩ |
|
|
Infinite Grid Exploration by Disoriented Robots26th International Colloquium, SIROCCO 2019, Jul 2019, L'Aquila, Italy. pp.340-344, ⟨10.1007/978-3-030-24922-9_25⟩ |
|
|
Silent self-stabilizing scheme for spanning-tree-like constructionsICDCN 2019, Jan 2019, Bangalore, India. pp.158-167, ⟨10.1145/3288599.3288607⟩ |
|
|
Silence dans la forêt !ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France |
|
|
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩ |
|
|
Stabilisation progressiveALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France |
|
|
Schéma général auto-stabilisant et silencieux de constructions de type arbres couvrantsALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France |
|
|
Eviter les collisions dans les réseaux 6TiSCHRencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication (CORES 2018), May 2018, Roscoff, France |
|
|
L-Exclusion autostabilisante revisitéeALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France |
|
|
Acyclic Strategy for Silent Self-Stabilization in Spanning ForestsSSS 2018 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2018, Tokyo, Japan. pp.186-202, ⟨10.1007/978-3-030-03232-6_13⟩ |
|
|
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps20th International Conference on Principles of Distributed Systems (OPODIS 2016), Dec 2016, Madrid, Spain. pp.10:1-10:16, ⟨10.4230/LIPIcs.OPODIS.2016.10⟩ |
|
|
Collision Prevention in Distributed 6TiSCH NetworksIEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2017, Rome, Italy. ⟨10.1109/WiMOB.2017.8115798⟩ |
|
|
Gradual Stabilization under τ-DynamicsEuro-Par 2016 - 22nd International Conference on Parallel and Distributed Computing, Aug 2016, Grenoble, France. pp.588-602, ⟨10.1007/978-3-319-43659-3_43⟩ |
|
|
Concurrence et allocation de ressources locales instantanément stabilisanteALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France |
|
|
A Framework for Certified Self-Stabilization36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2016, Heraklion, Greece. pp.36-51, ⟨10.1007/978-3-319-39570-8_3⟩ |
|
|
Élection autostabilisante en un nombre polynomial de pas de calculALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France |
|
|
Optimal Torus Exploration by Oblivious RobotsNETYS 2015 - Third International Conference on Networked Systems, May 2015, Agadir, Morocco. pp.183-199, ⟨10.1007/978-3-319-26850-7_13⟩ |
|
|
Stabilisation Instantanée ProbabilisteALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4 |
|
|
Self-Stabilizing Leader Election in Polynomial StepsSSS'2014, 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Sep 2014, Paderborn, Germany. pp.106-119, ⟨10.1007/978-3-319-11764-5_8⟩ |
|
|
Explorer une grille avec un minimum de robots amnésiques15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4 |
|
|
Algorithme autostabilisant avec convergence sûre construisant une $(f,g)$-alliance15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.13891 |
Fast Leader (Full) Recovery Despite Dynamic FaultsInternational Conference on Distributed Computing and Networking, Jan 2013, Mumbai, India. pp.428-433, ⟨10.1007/978-3-642-35668-1_30⟩ |
|
|
|
SR3: Secure Resilient Reputation-based Routing2013 IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), May 2013, Cambridge, France. ⟨10.1109/DCOSS.2013.33⟩ |
|
|
Routage sécurisé et résilient pour réseaux de capteurs sans fil15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4 |
|
|
Optimal Grid Exploration by Asynchronous Oblivious RobotsInternational Symposium on Stabilization, Safety, and Security of Distributed Systems, Oct 2012, Toronto, Canada. pp.64-76, ⟨10.1007/978-3-642-33536-5_7⟩ |
|
|
Analysis of Random Walks using Tabu ListsStructural Information and Communication Complexity - 19th International SIROCCO'12, Jun 2012, Reykjavik, Iceland |
|
|
Algorithme de k-partitionnement auto-stabilisant et compétitif14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France. pp.15 |
|
|
Snap-Stabilizing Committee Coordination25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, May 2011, Anchorage, Alaska, United States. pp.231-242, ⟨10.1109/IPDPS.2011.31⟩ |
|
|
Routage par marche aléatoire à listes tabous13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France. pp.14 |
|
|
Coordination de comités instantanément stabilisante13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France |
|
|
Rendez-vous d'agents amnésiques12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2010, Belle Dune, France. pp.8 |
|
|
A Self-Stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary NetworksCOCOON 2010, Jul 2010, Na Thrang, Vietnam. pp.80-89, ⟨10.1007/978-3-642-14031-0_11⟩ |
|
|
Communications Efficaces et Auto-Stabilisation12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2010, Belle-Dune, France. pp.id 19 |
Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks11th International Conference on Distributed Computing and Networking, ICDCN 2010, Jan 2010, Kolkata, India. pp.167-177, ⟨10.1007/978-3-642-11322-2_19⟩ |
|
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious RobotsSirocco 2009, May 2009, Piran, Slovenia. pp.195-208, ⟨10.1007/978-3-642-11476-2_16⟩ |
|
|
|
Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networksIPDPS, May 2009, Rome, Italy. pp.1-8, ⟨10.1109/IPDPS.2009.5161053⟩ |
|
|
Exploration Optimale Probabiliste d'un Anneau par des Robots Semi-Synchrones et Amnésiques11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France |
|
|
Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France |
|
|
Quand le consensus est plus simple que la diffusion fiable11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France |
|
|
Communication Efficiency in Self-Stabilizing Silent ProtocolsThe IEEE International Conference on Distributed Computing Systems (ICDCS 2009), Jun 2009, Montreal, Canada. pp.474-481, ⟨10.1109/ICDCS.2009.24⟩ |
|
|
Stabilisation instantanée dans les systèmes à passage de messages11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France |
Space-Optimal Deterministic RendezvousSecond International Workshop on Reliability, Availability, and Security (WRAS 2009), Dec 2009, Hiroshima, Japan. pp.332-337, ⟨10.1109/PDCAT.2009.13⟩ |
|
|
|
Snap-Stabilization in Message-Passing SystemsInternational Conference on Distributed Computing and Networking (ICDCN 2009), Jan 2009, Hyderabad, India. pp.281-286, ⟨10.1007/978-3-540-92295-7_34⟩ |
Brief Announcement: Snap-Stabilization in Message-Passing SystemsPrinciples of Distributed Computing (PODC 2008), Aug 2008, Toronto, Canada. pp.443-443, ⟨10.1145/1400751.1400838⟩ |
|
|
|
Weak vs. Self vs. Probabilistic StabilizationIEEE International Conference on Distributed Computing Systems (ICDCS 2008), Jun 2008, Beijing, China. pp.681-688, ⟨10.1109/ICDCS.2008.12⟩ |
Distributed Computing and Intelligent Technology - 21st International Conference, ICDCIT 2025Distributed Computing and Intelligent Technology ICDCIT 2025, 15507, Springer Nature Switzerland, 2025, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-81404-4⟩ |
|
Distributed Computing and Intelligent Technology20th International Conference, ICDCIT 2024, Bhubaneswar, India, January 17–20, 2024, Proceedings, 14501, Springer Nature Switzerland; Springer Nature Switzerland, 2024, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-50583-6⟩ |
Exploring Worst Cases of Self-stabilizing Algorithms Using SimulationsStabilization, Safety, and Security of Distributed Systems, 14310, Springer Nature Switzerland, pp.1-17, 2023, Lecture Notes in Computer Science, 978-3-031-44274-2. ⟨10.1007/978-3-031-44274-2_1⟩ |
|
Model Checking of Distributed Algorithms Using Synchronous ProgramsStabilization, Safety, and Security of Distributed Systems, 14310, Springer Nature Switzerland, pp.18-35, 2023, Lecture Notes in Computer Science, 978-3-031-44274-2. ⟨10.1007/978-3-031-44274-2_2⟩ |
Stabilization, Safety, and Security of Distributed SystemsSpringer International Publishing, 13751, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-21017-4⟩ |
|
|
|
Introduction to Distributed Self-Stabilizing AlgorithmsMorgan & Claypool, 8 (1), pp.1-165, 2019, Synthesis Lectures on Distributed Computing Theory, Michel Raynal, ⟨10.2200/S00908ED1V01Y201903DCT015⟩ |
Logique et démonstration automatique - Introduction à la logique propositionnelle et à la logique du premier ordre2012 |
Special issue of SSS 2020Information and Computation, pp.104955, 2022, ⟨10.1016/j.ic.2022.104955⟩ |
|
|
Versatility and Efficiency in Self-Stabilizing Distributed SystemsDistributed, Parallel, and Cluster Computing [cs.DC]. Université Grenoble Alpes, 2020 |
|
|
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics[Research Report] Université Grenoble Alpes, VERIMAG, UMR 5104, France; LIMOS, Université Clermont Auvergne, CNRS, UMR 6158, France; Université de Bordeaux, LaBRI, UMR 5800, France; Sorbonne Université, Paris, LIP6, UMR 7606, France. 2020 |
|
|
Self-Stabilizing Distributed Cooperative Reset[Research Report] Université Grenoble Alpes (France). 2019 |
|
|
Acyclic Strategy for Silent Self-Stabilization in Spanning Forests[Research Report] VERIMAG UMR 5104, Université Grenoble Alpes, France. 2018 |
|
|
Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions[Research Report] VERIMAG/LaBRI. 2018 |
|
|
A Framework for Certified Self-Stabilization[Technical Report] VERIMAG UMR 5104, Université Grenoble Alpes, France. 2016 |
|
|
Silent Self-stabilizing BFS Tree Algorithms Revised[Research Report] Université Grenoble Alpes. 2015 |
|
|
Optimal grid exploration by asynchronous oblivious robots[Research Report] ???. 2011 |
|
|
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots[Research Report] RR-6838, INRIA. 2009, pp.29 |
|
|
Snap-Stabilization in Message-Passing Systems[Research Report] RR-6446, INRIA. 2008, pp.29 |
|
|
Bounds for self-stabilization in unidirectional networks[Research Report] RR-6524, INRIA. 2008, pp.24 |
|
|
Communication Efficiency in Self-stabilizing Silent Protocols[Research Report] RR-6731, INRIA. 2008, pp.33 |
|
|
Weak vs. Self vs. Probabilistic Stabilization[Research Report] RR-6366, INRIA. 2007 |
|
|
Consensus is Easier Than Reliable Broadcast2008 |
|
|
Quelques Contributions à la Stabilisation InstantanéeRéseaux et télécommunications [cs.NI]. Université de Picardie Jules Verne, 2006. Français. ⟨NNT : ⟩ |