| • |
Lélia Blin, Colette Johnen, Gabriel Le Bouder, and Franck Petit. Silent Anonymous Snap-Stabilizing Termination Detection. 41st International Symposium on Reliable Distributed Systems, SRDS 2022, IEEE publisher, 2022. |
| • |
Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder. Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, LIPIcs, volume 217, 24:1-24:12, 2022. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Optimized silent self-stabilizing scheme for tree-based constructions. Algorithmica, 84(1):85–123, 2022. |
| • |
Arnaud Casteigts, Michael Raskin, Malte Renken, and Viktor Zamaraev. Sharp thresholds in random simple temporal graphs. 2021. |
| • |
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. Algorithmica, pages 1–49, 2021. |
| • |
Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. Journal of Computer and System Sciences, 121:1–17, 2021. |
| • |
Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, and Sébastien Tixeuil. Terminating exploration of A grid by an optimal number of asynchronous oblivious robots. Comput. J., 64(1):132–154, 2021. |
| • |
Quentin Bramas, Pascal Lafourcade, and Stéphane Devismes. Finding water on poleless using melomaniac myopic chameleon robots. In Martin Farach–Colton, Giuseppe Prencipe, and Ryuhei Uehara, editors, 10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy, volume 157, 6:1–6:19. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021. |
| • |
Karine Altisen, Pierre Corbineau, and Stéphane Devismes. Certification of an exact worst-case self-stabilization time. In ICDCN ’21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5-8, 2021, 46–55. ACM, 2021. |
| • |
Colette Johnen, Luciana Arantes, and Pierre Sens. FIFO and atomic broadcast algorithms with bounded message size for dynamic systems. In 40th International Symposium on Reliable Distributed Systems, SRDS 2021, Chicago, IL, USA, September 20-23, 2021, 277–287. IEEE, 2021. |
| • |
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, S\’ebastien Tixeuil, and Koichi Wada. Asynchronous gathering in a torus. In Conference on Principles of Distributed Systems, OPODIS 2021, Strasbourg, France, December 13-15, 2021. LIPICS, 2021. |
| • |
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, and Franck Petit. On implementing stabilizing leader election with weak assumptions on network dynamics. In PODC ’21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, 21–31. 2021. |
| • |
Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, and Sébastien Tixeuil. Practical byzantine reliable broadcast on partially connected networks. In 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021, 506–516. IEEE, 2021. |
| • |
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, and Franck Petit. Self-stabilizing systems in spite of high dynamics. In ICDCN ’21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5-8, 2021, 156–165. 2021. |
| • |
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. |
| • |
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, and Franck Petit. Deterministic treasure hunt in the plane with angular hints. Algorithmica, 82(11):3250–3281, 2020. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Broadcasting information in multi-hop networks prone to mobile byzantine faults. In Chryssis Georgiou and Rupak Majumdar, editors, Networked Systems – 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings, volume 12129, 112–128. Springer, 2020. |
| • |
Sébastien Bouchard, Yoann Dieudonné, and Andrzej Pelc. Want to gather? no need to chatter! In Yuval Emek and Christian Cachin, editors, PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, 253–262. ACM, 2020. |
| • |
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, and Franck Petit. Almost universal anonymous rendezvous in the plane. In Christian Scheideler and Michael Spear, editors, SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, 117–127. ACM, 2020. |
| • |
Arnaud Casteigts, Mathieu Raffinot, and Jason Schoeters. Vectortsp: a traveling salesperson problem with racetrack-like acceleration constraints. In 16th Int. Symp. on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 45–59. Cham, 2020. Springer International Publishing. |
| • |
Quentin Bramas, Stéphane Devismes, and Pascal Lafourcade. Infinite grid exploration by disoriented robots. In Chryssis Georgiou and Rupak Majumdar, editors, Networked Systems – 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings, volume 12129, 129–145. Springer, 2020. |
| • |
Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, and Lawrence L. Larmore. Election in unidirectional rings with homonyms. J. Parallel Distributed Comput., 146:79–95, 2020. |
| • |
Karine Altisen, Stéphane Devismes, and Erwan Jahier. Sasa: A simulator of self-stabilizing algorithms. In Wolfgang Ahrendt and Heike Wehrheim, editors, Tests and Proofs – 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed], volume 12165, 143–154. Springer, 2020. |
| • |
Stéphane Devismes and Neeraj Mittal, editors. Stabilization, Safety, and Security of Distributed Systems – 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18-21, 2020, Proceedings, volume 12514, Springer, 2020. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Boosting the efficiency of byzantine-tolerant reliable communication. In Stéphane Devismes and Neeraj Mittal, editors, Stabilization, Safety, and Security of Distributed Systems – 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18-21, 2020, Proceedings, volume 12514, 29–44. Springer, 2020. |
| • |
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, and Franck Petit. Brief announcement: self-stabilizing systems in spite of high dynamics. In PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, 227–229. 2020. |
| • |
Mohammed Haddad, Colette Johnen, and Sven Köhler. Polynomial silent self-stabilizing p-star decomposition\textdagger . Comput. J., 63(2):253–266, 2020. |
| • |
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit. Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput., 32(4):317–337, 2019. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Multi-hop byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc., 25(1):9:1–9:23, 2019. |
| • |
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Approximate agreement under mobile byzantine faults. Theor. Comput. Sci., 758:17–29, 2019. |
| • |
Anaïs Durand and Shay Kutten. Reducing the number of messages in self-stabilizing protocols. In Stabilization, Safety, and Security of Distributed Systems – 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings, 133–148. 2019. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Silent self-stabilizing scheme for spanning-tree-like constructions. In Nitin Vaidya R. C. Hansdah, Dilip Krishnaswamy, editor, Proceedings of the 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, January 04-07, 2019, 158–167. 2019. |
| • |
Arnaud Casteigts, Swan Dubois, Franck Petit, and John Michael Robson. Robustness: a new form of heredity motivated by dynamic networks. Theoretical Computer Science, 2019. |
| • |
Stéphane Devismes and Colette Johnen. Self-stabilizing distributed cooperative reset. In Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS 2019), pages 379-389, 2019. |
| • |
Ajoy Kumar Datta, Stéphane Devismes, Colette Johnen, and Lawrence L. Larmore. Brief announcement: analysis of a memory-efficient self-stabilizing bfs spanning tree construction. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019). Pisa, Italia, October, 21-25 2019. Proceedings, volume 11914, 99–104. Springer, 2019. |
| • |
Quentin Bramas, Stéphane Devismes, and Pascal Lafourcade. Infinite grid exploration by disoriented robots. In Keren Censor–Hillel and Michele Flammini, editors, Structural Information and Communication Complexity – 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, volume 11639, 340–344. Springer, 2019. |
| • |
Stéphane Devismes, Anissa Lamani, Franck Petit, and Sébastien Tixeuil. Optimal torus exploration by oblivious robots. Computing, 101(9):1241–1264, 2019. |
| • |
Karine Altisen, Pierre Corbineau, and Stéphane Devismes. Squeezing streams and composition of self-stabilizing algorithms. In Jorge A. Pérez and Nobuko Yoshida, editors, Formal Techniques for Distributed Objects, Components, and Systems – 39th IFIP WG 6.1 International Conference, FORTE 2019, Held as Part of the 14th International Federated Conference on Distributed Computing Techniques, DisCoTec 2019, Kongens Lyngby, Denmark, June 17-21, 2019, Proceedings, volume 11535, 21–38. Springer, 2019. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Silent self-stabilizing scheme for spanning-tree-like constructions. In the 20th International Conference on Distributed Computing and Networking, ICDCN 2019, 158–167. 2019. |
| • |
Christian Glacet, Nicolas Hanusse, David Ilcinkas, and Colette Johnen. Disconnected components detection and rooted shortest-path tree maintenance in networks. Journal of Parallel and Distributed Computing, 132:299–309, 2019. |
| • |
Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). 2019. |
| • |
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Counting in one-hop beeping networks. Theoretical Computer Science, 2019. (In Press.). |
| • |
Karine Altisen, Stéphane Devismes, Swan Dubois, and Franck Petit. Introduction to distributed self-stabilizing algorithms. Synthesis Lectures on Distributed Computing Theory, 8(1):1–165, 2019. |
| • |
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms: examples, emulation, and analysis. Information and Computation, 2019. |
| • |
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Deterministic leader election takes $\theta (d+\log n)$ bit rounds. Algorithmica, 2019. |
| • |
Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Computing parameters of sequence-based dynamic graphs. Theory of Computing Systems, 2019. |
| • |
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, and Y. Neggaz. Maintaining a distributed spanning forest in highly dynamic networks. The Computer Journal, 2019. |
| • |
Marjorie Bournat, Swan Dubois, and Franck Petit. Gracefully degrading gathering in dynamic rings. In SSS’2018, 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, to appear. Springer, 2018. |
| • |
Ajoy Kumar Datta, Stéphane Devismes, and Lawrence L. Larmore. A silent self-stabilizing algorithm for the generalized minimal \emph k-dominating set problem. Theor. Comput. Sci., 753:35–63, 2019. |
| • |
Karine Altisen, Stéphane Devismes, Anaïs Durand, and Franck Petit. Gradual stabilization. J. Parallel Distrib. Comput., 123:26–45, 2019. |
| • |
Karine Altisen, Stéphane Devismes, and Anaïs Durand. Acyclic strategy for silent self-stabilization in spanning forests. In Petr Kuznetsov Taisuke Izumi, editor, Stabilization, Safety, and Security of Distributed Systems – 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings, volume 11201, 186–202. Springer, 2018. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Reliable broadcast in dynamic networks with locally bounded byzantine failures. In Taisuke Izumi and Petr Kuznetsov, editors, Stabilization, Safety, and Security of Distributed Systems – 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings, volume 11201, 170–185. Springer, 2018. |
| • |
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Brief announcement: optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps. In Taisuke Izumi and Petr Kuznetsov, editors, Stabilization, Safety, and Security of Distributed Systems – 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings, volume 11201, 398–403. Springer, 2018. |
| • |
Lélia Blin, Fadwa Boubekeur, and Swan Dubois. A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. Journal of Parallel and Distributed Computing, 117:50 – 62, 2018. |
| • |
Lélia Blin and Sébastien Tixeuil. Compact self-stabilizing leader election for general networks. In 13th Latin American Theoretical Informatics Symposium (LATIN 2018), Buenos Aires, Argentina, April 16-19, 2018, Proceedings, 161–173. 2018. |
| • |
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, and Franck Petit. On deterministic rendezvous at a node of agents with arbitrary velocities. Information Processing Letters, 133():39 – 43, 2018. |
| • |
Lélia Blin and Sébastien Tixeuil. Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Computing, 31(2):139–166, 2018. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Multi-hop byzantine reliable broadcast made practical. In 8th Latin-American Symposium on Dependable Computing, LADC 2018, Foz do Iguaçu, Brazil, October 8-10, 2018, 155–160. IEEE, 2018. |
| • |
Lélia Blin and Sébastien Tixeuil. Brief announcement: compact self-stabilizing leader election in arbitrary graphs. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, 43:1–43:3. 2017. |
| • |
Sébastien Bouchard, Yoann Dieudonné, and Anissa Lamani. Byzantine gathering in polynomial time. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), to appear. 2018. |
| • |
Arnaud Casteigts, Swan Dubois, Franck Petit, and John Michael Robson. Robustness in highly dynamic networks. CoRR, 2017. |
| • |
Gewu Bu and Maria Potop–Butucaru. BAN-GZKP: optimal zero knowledge proof based scheme for wireless body area networks. In 14th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2017, Orlando, FL, USA, October 22-25, 2017, 55–63. IEEE Computer Society, 2017. |
| • |
Wafa Badreddine, Nesrine Khernane, Maria Potop-Butucaru, and Claude Chaudet. Convergecast in wireless body area networks. Ad Hoc Networks, 66:40–51, 2017. |
| • |
Gewu Bu and Maria Potop-Butucaru. Total order reliable convergecast in WBAN. In Proceedings of the 18th International Conference on Distributed Computing and Networking, 26. ACM, 2017. |
| • |
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien Tixeuil. Optimal storage under unsynchronized mobile byzantine faults. In 36th IEEE Symposium on Reliable Distributed Systems, SRDS 2017, Hong Kong, Hong Kong, September 26-29, 2017, 154–163. IEEE Computer Society, 2017. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. Discrete Mathematics & Theoretical Computer Science, 2017. |
| • |
Karine Altisen, Pierre Corbineau, and Stéphane Devismes. A framework for certified self-stabilization. Logical Methods in Computer Science, 2017. |
| • |
Karine Altisen, Stéphane Devismes, and Anaïs Durand. Concurrency in snap-stabilizing local resource allocation. J. Parallel Distrib. Comput., 102:42–56, 2017. |
| • |
Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. A generic framework for computing parameters of sequence-based dynamic graphs. In Proc. of 24th Intl. Conference on Structural Information and Communication Complexity (SIROCCO 2017), 42–56. 2017. |
| • |
Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, and Lawrence L. Larmore. Leader election in asymmetric labeled unidirectional rings. In 31st IEEE International Parallel and Distributed Processing Symposium, (IPDPS 2017), Orlando, FL, USA, May 29 – June 2, 2017, 182–191. IEEE Computer Society, 2017. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps. In OPODIS 2016, the 20th International Conference on Principles of Distributed Systems, volume 70, 10:1–10:16. Madrid, Spain, December 13-16 2016. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik. |
| • |
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms (extended abstract). In 20th Int. Conference on Principles of Distributed Systems (OPODIS), 15:1–15:16. 2016. |
| • |
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit. Asynchronous approach in the plane: a deterministic polynomial algorithm. In 31st International Symposium on Distributed Computing (DISC 2017), 8:1–8:16. 2017. |
| • |
Marjorie Bournat, Swan Dubois, and Franck Petit. Computability of perpetual exploration in highly dynamic rings. In 37th IEEE International Conference on Distributed Computing Systems, (ICDCS 2017), 794–804. 2017. |
| • |
Marjorie Bournat, Ajoy K. Datta, and Swan Dubois. Self-stabilizing robots in highly dynamic environments. In 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), 54–69. Lyon, France, 2016. Springer Berlin / Heidelberg. |
| • |
Mohammed Haddad, Colette Johnen, and Sven Köhler. Polynomial silent self-stabilizing p-star decomposition (short paper). In Stabilization, Safety, and Security of Distributed Systems – 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings, 185–189. 2016. |
| • |
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. The computational complexity of finding temporal paths under waiting time constraints. CoRR, 2019. |
| • |
Lélia Blin, Swan Dubois, and Laurent Feuilloley. Silent MST approximation for tiny memory. CoRR, 2019. |
| • |
Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder. Memory lower bounds for self-stabilization. CoRR, 2019. |
| • |
Pierre Castéran. An explicit Semantics for Event-B Refinement. Springer, To Appear. |
| • |
Arnaud Casteigts, Swan Dubois, Franck Petit, and John Michael Robson. Robustness: a new form of heredity motivated by dynamic networks. CoRR, 2019. |
| • |
Silvia Bonomi, Giovanni Farina, and Sébastien Tixeuil. Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. Technical Report, Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France ; Dipartimento di Ingegneria Informatica Automatica e Gestionale ”Antonio Ruberti”, Università degli Studi di Roma La Sapienza, Rome, Italy, February 2018. |
| • |
Arnaud Casteigts. A Journey through Dynamic Networks (with Excursions). PhD thesis, Université de Bordeaux, 2018. |
| • |
Arnaud Casteigts. Robustness in highly-dynamic networks. Discrete Math Seminar, Simon Fraser University, June 2017. |
| • |
Arnaud Casteigts. Robustness: a new form of heredity motivated by highly-dynamic networks. Invited talk at AATG @ ICALP (Algorithmic Aspects of Temporal Graphs), July 2018. |
| • |
Franck Petit. Robustness in highly dynamic networks. Invited talk at CoDyn, Second Workshop on Computing in Dynamic Networks, October 2017. |
| • |
Swan Dubois and Franck Petit. Graphes dynamiques et auto-stabilisation. https://www-master.ufr-info-p6.jussieu.fr:8083/2017/ARA, 2017. Module de Master 2 (14h), parcours Systèmes et Applications Répartis à Sorbonne Université. |
| • |
Arnaud Casteigts. Algorithmique de la mobilité. http://www.labri.fr/perso/acasteig/teaching/algomob/, 2017. Module de Master 2 (48h), parcours Réseaux de Communication et Internet à U. Bordeaux. |
| • |
Stéphane Devismes. Leader Election in Asymmetric Labeled Unidirectional Rings. Meeting ANR DESCARTES, October 3rd 2017. |
| • |
Karine Altisen. PADEC: A Framework for Certified Self-Stabilization. Meeting ANR DESCARTES, October 3rd 2017. |
| • |
Karine Altisen. PADEC: A Framework for Certified Self-Stabilization. Séminaire du LaBRI, March 5th 2018. |
| • |
Stéphane Devismes. Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions. Meeting ANR DESCARTES, March 28th 2018. |
| • |
Stéphane Devismes. A lower bound of graph exploration by a swarm of oblivious robots. Workshop Morover, November 15th 2017. |
| • |
Stéphane Devismes. A lower bound of graph exploration by a swarm of oblivious robots. Workshop GRASTA (GRAph Searching, Theory and Applications), September 25th 2018. |
| • |
Pierre Corbineau. Coq in practice: Certification of self-stabilizing algorithms. Séminaires SIESTE, ENS Lyon, Feb 27th 2018. |
| • |
Pierre Corbineau. PADEC: A Framework for Certified Self-Stabilization. Workshop COQ en STOCK, October 19th 2017. |
| • |
Stéphane Devismes and Colette Johnen. Soyez efficace, rembobinez. In ALGOTEL 2019 – 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. 2019. |
| • |
Karine Altisen, Stéphane Devismes, and Anaïs Durand. Silence dans la forêt ! In ALGOTEL 2019 – 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Narbonne, France, June 3-7 2019. |
| • |
Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Trouver des spanneur peu denses dans les cliques temporelles. In ALGOTEL 2019 – 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. 2019. |
| • |
Stéphane Devismes, David Ilcinkas, and Colette Johnen. Schéma général auto-stabilisant et silencieux de constructions de type arbres couvrants. In ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Roscoff, 2018. |
| • |
Karine Altisen, Stéphane Devismes, Anaïs Durand, and Franck Petit. Stabilisation progressive. In ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Roscoff, 2018. |
| • |
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit. Approche asynchrone dans le plan : un algorithme déterministe polynomial. In ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Roscoff, 2018. |
| • |
Sébastien Bouchard, Yoann Dieudonné, and Bertrand Ducourthial. Rassemblement byzantin dans les réseaux. In ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Roscoff, 2018. |
| • |
Fabienne Carrier, Ajoy K. Datta, Stéphane Devismes, and Lawrence Larmore. L-exclusion auto-stabilisante revisitée. In ALGOTEL 2018 – 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Roscoff, 2018. |
| • |
Pierre Castéran. Hydra ludica: une preuve d’impossibilité de prouver simplement. JFLA 2018, Janvier 2017. |
| • |
Anaïs Durand. Election et anneaux unidirectionnels en présence d’homonymes. In ALGOTEL 2017 – 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Quiberon, 2017. |
| • |
Karine Altisen and Pierre Corbineau. Composition certifié d’algorithmes autostabilisants silencieux. In ALGOTEL 2017 – 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Quiberon, May 30 – June 2 2017. |
| • |
Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Calcul de paramètres minimaux dans les graphes dynamiques. In ALGOTEL 2017 – 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Quiberon, 2017. |
| • |
Mohammed Haddad, Colette Johnen, and Sven Köhler. Polynomial Silent Self-Stabilizing Maximal p-Star Decomposition. In ALGOTEL 2017 – 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Quiberon, 2017. |
