{"id":119,"date":"2017-08-06T15:11:27","date_gmt":"2017-08-06T13:11:27","guid":{"rendered":"https:\/\/wp-systeme.lip6.fr\/estate\/?page_id=119"},"modified":"2022-10-04T09:51:40","modified_gmt":"2022-10-04T07:51:40","slug":"publications","status":"publish","type":"page","link":"https:\/\/wp-systeme.lip6.fr\/estate\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\u2022<\/td>\nL\u00e9lia Blin, Colette Johnen, Gabriel Le Bouder, and Franck Petit. Silent Anonymous Snap-Stabilizing Termination Detection. 41st International Symposium on Reliable Distributed Systems, SRDS 2022<\/em>, IEEE publisher, 2022.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9lia 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<\/em>, LIPIcs, volume 217, 24:1-24:12, 2022.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes, David Ilcinkas, and Colette Johnen. Optimized silent self-stabilizing scheme for tree-based constructions. Algorithmica<\/em>, 84(1):85\u2013123, 2022.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Michael Raskin, Malte Renken, and Viktor Zamaraev. Sharp thresholds in random simple temporal graphs. 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. Algorithmica<\/em>, pages 1\u201349, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. Journal of Computer and System Sciences<\/em>, 121:1\u201317, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, and S\u00e9bastien Tixeuil. Terminating exploration of A<\/span> grid by an optimal number of asynchronous oblivious robots. Comput. J.<\/em>, 64(1):132\u2013154, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nQuentin Bramas, Pascal Lafourcade, and St\u00e9phane Devismes. Finding water on poleless using melomaniac myopic chameleon robots. In Martin Farach–<\/span>Colton, Giuseppe Prencipe, and Ryuhei Uehara, editors, 10th International Conference on Fun with Algorithms, FUN<\/span> 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy<\/em>, volume 157, 6:1\u20136:19. Schloss Dagstuhl – Leibniz-Zentrum f\u00fc<\/span><\/span>r Informatik, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, Pierre Corbineau, and St\u00e9<\/span><\/span>phane Devismes. Certification of an exact worst-case self-stabilization time. In ICDCN<\/span> ’21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5-8, 2021<\/em>, 46\u201355. ACM<\/span>, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nColette Johnen, Luciana Arantes, and Pierre Sens. FIFO<\/span> and atomic broadcast algorithms with bounded message size for dynamic systems. In 40th International Symposium on Reliable Distributed Systems, SRDS<\/span> 2021, Chicago, IL, USA, September 20-23, 2021<\/em>, 277\u2013287. IEEE<\/span>, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nSayaka Kamei, Anissa Lamani, Fukuhito Ooshita, S\\\u2019e<\/span>bastien Tixeuil, and Koichi Wada. Asynchronous gathering in a torus. In Conference on Principles of Distributed Systems, OPODIS<\/span> 2021, Strasbourg, France, December 13-15, 2021<\/em>. LIPICS<\/span>, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Ana\u00efs Durand, Colette Johnen, and Franck Petit. On implementing stabilizing leader election with weak assumptions on network dynamics. In PODC<\/span> ’21: ACM<\/span> Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021<\/em>, 21\u201331. 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, J\u00e9r\u00e9mie Decouchant, Giovanni Farina, Vincent Rahli, and S\u00e9bastien Tixeuil. Practical byzantine reliable broadcast on partially connected networks. In 41st IEEE<\/span> International Conference on Distributed Computing Systems, ICDCS<\/span> 2021, Washington DC, USA, July 7-10, 2021<\/em>, 506\u2013516. IEEE<\/span>, 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Ana\u00efs Durand, Colette Johnen, and Franck Petit. Self-stabilizing systems in spite of high dynamics. In ICDCN<\/span> ’21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5-8, 2021<\/em>, 156\u2013165. 2021.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud 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)<\/em>. Schloss Dagstuhl-Leibniz-Zentrum f\u00fc<\/span>r Informatik, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, Andrzej Pelc, and Franck Petit. Deterministic treasure hunt in the plane with angular hints. Algorithmica<\/em>, 82(11):3250\u20133281, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9bastien 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<\/span> 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings<\/em>, volume 12129, 112\u2013128. Springer, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, and Andrzej Pelc. Want to gather? no need to chatter! In Yuval Emek and Christian Cachin, editors, PODC<\/span> ’20: ACM<\/span> Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020<\/em>, 253\u2013262. ACM<\/span>, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, Andrzej Pelc, and Franck Petit. Almost universal anonymous rendezvous in the plane. In Christian Scheideler and Michael Spear, editors, SPAA<\/span> ’20: 32nd ACM<\/span> Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020<\/em>, 117\u2013127. ACM<\/span>, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud 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)<\/em>, 45\u201359. Cham, 2020. Springer International Publishing.<\/td>\n<\/tr>\n
\u2022<\/td>\nQuentin Bramas, St\u00e9phane Devismes, and Pascal Lafourcade. Infinite grid exploration by disoriented robots. In Chryssis Georgiou and Rupak Majumdar, editors, Networked Systems – 8th International Conference, NETYS<\/span> 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings<\/em>, volume 12129, 129\u2013145. Springer, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, Ajoy K. Datta, St\u00e9phane Devismes, Ana\u00efs Durand, and Lawrence L. Larmore. Election in unidirectional rings with homonyms. J. Parallel Distributed Comput.<\/em>, 146:79\u201395, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, and Erwan Jahier. Sasa: A<\/span> 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]<\/em>, volume 12165, 143\u2013154. Springer, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes and Neeraj Mittal, editors. Stabilization, Safety, and Security of Distributed Systems – 22nd International Symposium, SSS<\/span> 2020, Austin, TX, USA, November 18-21, 2020, Proceedings<\/em>, volume 12514, Springer, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9bastien Tixeuil. Boosting the efficiency of byzantine-tolerant reliable communication. In St\u00e9phane Devismes and Neeraj Mittal, editors, Stabilization, Safety, and Security of Distributed Systems – 22nd International Symposium, SSS<\/span> 2020, Austin, TX, USA, November 18-21, 2020, Proceedings<\/em>, volume 12514, 29\u201344. Springer, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Ana\u00efs Durand, Colette Johnen, and Franck Petit. Brief announcement: self-stabilizing systems in spite of high dynamics. In PODC<\/span> ’20: ACM<\/span> Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020<\/em>, 227\u2013229. 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nMohammed Haddad, Colette Johnen, and Sven K\u00f6hler. Polynomial silent self-stabilizing p-star decomposition\\textdagger <\/span>. Comput. J.<\/em>, 63(2):253\u2013266, 2020.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Marjorie Bournat, Yoann Dieudonn\u00e9, Swan Dubois, and Franck Petit. Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput.<\/em>, 32(4):317\u2013337, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9bastien Tixeuil. Multi-hop byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc.<\/em>, 25(1):9:1\u20139:23, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and S\u00e9bastien Tixeuil. Approximate agreement under mobile byzantine faults. Theor. Comput. Sci.<\/em>, 758:17\u201329, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nAna\u00efs 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<\/span> 2019, Pisa, Italy, October 22-25, 2019, Proceedings<\/em>, 133\u2013148. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes, David Ilcinkas, and Colette Johnen. Silent self-stabilizing scheme for spanning-tree-like constructions. In Nitin\u00a0Vaidya R.\u00a0C.\u00a0Hansdah, Dilip\u00a0Krishnaswamy, editor, Proceedings of the 20th International Conference on Distributed Computing and Networking, ICDCN<\/span> 2019, Bangalore, India, January 04-07, 2019<\/em>, 158\u2013167. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Swan Dubois, Franck Petit, and John\u00a0Michael Robson. Robustness: a new form of heredity motivated by dynamic networks. Theoretical Computer Science<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes and Colette Johnen. Self-stabilizing distributed cooperative reset. In Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS 2019)<\/em>, pages 379-389, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nAjoy\u00a0Kumar Datta, St\u00e9phane Devismes, Colette Johnen, and Lawrence\u00a0L. 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)<\/em>. Pisa, Italia, October, 21-25 2019. Proceedings<\/em>, volume 11914, 99\u2013104. Springer, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nQuentin Bramas, St\u00e9<\/span><\/span>phane Devismes, and Pascal Lafourcade. Infinite grid exploration by disoriented robots. In Keren Censor–<\/span>Hillel and Michele Flammini, editors, Structural Information and Communication Complexity – 26th International Colloquium, SIROCCO<\/span> 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings<\/em>, volume 11639, 340\u2013344. Springer, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9<\/span><\/span>phane Devismes, Anissa Lamani, Franck Petit, and S\u00e9<\/span><\/span>bastien Tixeuil. Optimal torus exploration by oblivious robots. Computing<\/em>, 101(9):1241\u20131264, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, Pierre Corbineau, and St\u00e9<\/span><\/span>phane Devismes. Squeezing streams and composition of self-stabilizing algorithms. In Jorge\u00a0A. P\u00e9<\/span><\/span>rez and Nobuko Yoshida, editors, Formal Techniques for Distributed Objects, Components, and Systems – 39th IFIP<\/span> WG<\/span> 6.1 International Conference, FORTE<\/span> 2019, Held as Part of the 14th International Federated Conference on Distributed Computing Techniques, DisCoTec 2019, Kongens Lyngby, Denmark, June 17-21, 2019, Proceedings<\/em>, volume 11535, 21\u201338. Springer, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9<\/span><\/span>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<\/span> 2019<\/em>, 158\u2013167. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nChristian 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<\/em>, 132:299\u2013309, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Joseph\u00a0G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. In 46th International Colloquium on Automata, Languages, and Programming (ICALP<\/span> 2019)<\/em>. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Yves M\u00e9<\/span><\/span>tivier, John\u00a0Michael Robson, and Akka Zemmari. Counting in one-hop beeping networks. Theoretical Computer Science<\/em>, 2019. (In Press.).<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Swan Dubois, and Franck Petit. Introduction to distributed self-stabilizing algorithms. Synthesis Lectures on Distributed Computing Theory<\/em>, 8(1):1\u2013165, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Yves M\u00e9tivier, John\u00a0Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms: examples, emulation, and analysis. Information and Computation<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Yves M\u00e9tivier, John\u00a0Michael Robson, and Akka Zemmari. Deterministic leader election takes $\\theta (d+\\log n)$ bit rounds. Algorithmica<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Computing parameters of sequence-based dynamic graphs. Theory of Computing Systems<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nMatthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, and Y.\u00a0Neggaz. Maintaining a distributed spanning forest in highly dynamic networks. The Computer Journal<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nMarjorie 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<\/em>, to appear. Springer, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nAjoy\u00a0Kumar Datta, St\u00e9phane Devismes, and Lawrence\u00a0L. Larmore. A silent self-stabilizing algorithm for the generalized minimal \\emph k<\/span>-dominating set problem. Theor. Comput. Sci.<\/em>, 753:35\u201363, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Ana\u00efs Durand, and Franck Petit. Gradual stabilization. J. Parallel Distrib. Comput.<\/em>, 123:26\u201345, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, and Ana\u00efs Durand. Acyclic strategy for silent self-stabilization in spanning forests. In Petr\u00a0Kuznetsov Taisuke\u00a0Izumi, editor, Stabilization, Safety, and Security of Distributed Systems – 20th International Symposium, SSS<\/span> 2018, Tokyo, Japan, November 4-7, 2018, Proceedings<\/em>, volume 11201, 186\u2013202. Springer, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9bastien 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<\/span> 2018, Tokyo, Japan, November 4-7, 2018, Proceedings<\/em>, volume 11201, 170\u2013185. Springer, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and S\u00e9bastien 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<\/span> 2018, Tokyo, Japan, November 4-7, 2018, Proceedings<\/em>, volume 11201, 398\u2013403. Springer, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9lia 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<\/em>, 117:50 \u2013 62, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9<\/span><\/span>lia Blin and S\u00e9<\/span><\/span>bastien Tixeuil. Compact self-stabilizing leader election for general networks. In 13th Latin American Theoretical Informatics Symposium (LATIN<\/span> 2018), Buenos Aires, Argentina, April 16-19, 2018, Proceedings<\/em>, 161\u2013173. 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Yoann Dieudonn\u00e9<\/span>, Andrzej Pelc, and Franck Petit. On deterministic rendezvous at a node of agents with arbitrary velocities. Information Processing Letters<\/em>, 133():39 \u2013 43, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9<\/span>lia Blin and S\u00e9<\/span>bastien Tixeuil. Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Computing<\/em>, 31(2):139\u2013166, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9bastien Tixeuil. Multi-hop byzantine reliable broadcast made practical. In 8th Latin-American Symposium on Dependable Computing, LADC<\/span> 2018, Foz do Igua\u00e7u, Brazil, October 8-10, 2018<\/em>, 155\u2013160. IEEE<\/span>, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9<\/span><\/span>lia Blin and S\u00e9<\/span><\/span>bastien Tixeuil. Brief announcement: compact self-stabilizing leader election in arbitrary graphs. In 31st International Symposium on Distributed Computing, DISC<\/span> 2017, October 16-20, 2017, Vienna, Austria<\/em>, 43:1\u201343:3. 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, and Anissa Lamani. Byzantine gathering in polynomial time. In 45th International Colloquium on Automata, Languages, and Programming (ICALP<\/span> 2018)<\/em>, to appear. 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Swan Dubois, Franck Petit, and John\u00a0Michael Robson. Robustness in highly dynamic networks. CoRR<\/em>, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nGewu Bu and Maria Potop–<\/span>Butucaru. BAN-GZKP:<\/span> optimal zero knowledge proof based scheme for wireless body area networks. In 14th IEEE<\/span> International Conference on Mobile Ad Hoc and Sensor Systems, MASS<\/span> 2017, Orlando, FL, USA, October 22-25, 2017<\/em>, 55\u201363. IEEE<\/span> Computer Society, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nWafa Badreddine, Nesrine Khernane, Maria Potop-Butucaru, and Claude Chaudet. Convergecast in wireless body area networks. Ad Hoc Networks<\/em>, 66:40\u201351, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nGewu Bu and Maria Potop-Butucaru. Total order reliable convergecast in WBAN<\/span>. In Proceedings of the 18th International Conference on Distributed Computing and Networking<\/em>, 26. ACM, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and S\u00e9bastien Tixeuil. Optimal storage under unsynchronized mobile byzantine faults. In 36th IEEE<\/span> Symposium on Reliable Distributed Systems, SRDS<\/span> 2017, Hong Kong, Hong Kong, September 26-29, 2017<\/em>, 154\u2013163. IEEE<\/span> Computer Society, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes, David Ilcinkas, and Colette Johnen. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps<\/span>. Discrete Mathematics & Theoretical Computer Science<\/em>, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, Pierre Corbineau, and St\u00e9<\/span><\/span>phane Devismes. A framework for certified self-stabilization. Logical Methods in Computer Science<\/em>, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, and Ana\u00efs Durand. Concurrency in snap-stabilizing local resource allocation. J. Parallel Distrib. Comput.<\/em>, 102:42\u201356, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud 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<\/span> 2017)<\/em>, 42\u201356. 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, Ajoy\u00a0Kumar Datta, St\u00e9phane Devismes, Ana\u00efs Durand, and Lawrence\u00a0L. Larmore. Leader election in asymmetric labeled unidirectional rings. In 31st IEEE<\/span> International Parallel and Distributed Processing Symposium, (IPDPS<\/span> 2017), Orlando, FL, USA, May 29 – June 2, 2017<\/em>, 182\u2013191. IEEE<\/span> Computer Society, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane 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<\/em>, volume\u00a070, 10:1\u201310:16. Madrid, Spain, December 13-16 2016. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Yves M\u00e9tivier, John\u00a0Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms (extended abstract). In 20th Int. Conference on Principles of Distributed Systems (OPODIS)<\/em>, 15:1\u201315:16. 2016.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9<\/span>bastien Bouchard, Marjorie Bournat, Yoann Dieudonn\u00e9<\/span>, Swan Dubois, and Franck Petit. Asynchronous approach in the plane: a deterministic polynomial algorithm. In 31st International Symposium on Distributed Computing (DISC 2017)<\/em>, 8:1\u20138:16. 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nMarjorie Bournat, Swan Dubois, and Franck Petit. Computability of perpetual exploration in highly dynamic rings. In 37th IEEE<\/span> International Conference on Distributed Computing Systems, (ICDCS<\/span> 2017)<\/em>, 794\u2013804. 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nMarjorie Bournat, Ajoy\u00a0K. 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)<\/em>, 54\u201369. Lyon, France, 2016. Springer Berlin \/ Heidelberg.<\/td>\n<\/tr>\n
\u2022<\/td>\nMohammed Haddad, Colette Johnen, and Sven K\u00f6<\/span><\/span>hler. Polynomial silent self-stabilizing p-star decomposition (short paper). In Stabilization, Safety, and Security of Distributed Systems – 18th International Symposium, SSS<\/span> 2016, Lyon, France, November 7-10, 2016, Proceedings<\/em>, 185\u2013189. 2016.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. The computational complexity of finding temporal paths under waiting time constraints. CoRR<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9<\/span><\/span>lia Blin, Swan Dubois, and Laurent Feuilloley. Silent MST<\/span> approximation for tiny memory. CoRR<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nL\u00e9<\/span><\/span>lia Blin, Laurent Feuilloley, and Gabriel\u00a0Le Bouder. Memory lower bounds for self-stabilization. CoRR<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nPierre Cast\u00e9ran. An explicit Semantics for Event-B Refinement<\/em>. Springer, To Appear.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Swan Dubois, Franck Petit, and John\u00a0Michael Robson. Robustness: a new form of heredity motivated by dynamic networks. CoRR<\/em>, 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSilvia Bonomi, Giovanni Farina, and S\u00e9<\/span>bastien Tixeuil. Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures<\/span>. Technical Report, Sorbonne Universit\u00e9<\/span>, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France ; Dipartimento di Ingegneria Informatica Automatica e Gestionale \u201dAntonio Ruberti\u201d, Universit\u00e0<\/span> degli Studi di Roma La Sapienza, Rome, Italy<\/span>, February 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts. A Journey through Dynamic Networks (with Excursions)<\/em>. PhD thesis, Universit\u00e9 de Bordeaux, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts. Robustness in highly-dynamic networks. Discrete Math Seminar, Simon Fraser University<\/span>, June 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts. Robustness: a new form of heredity motivated by highly-dynamic networks. Invited talk at AATG @ ICALP (Algorithmic Aspects of Temporal Graphs)<\/span>, July 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nFranck Petit. Robustness in highly dynamic networks. Invited talk at CoDyn, Second Workshop on Computing in Dynamic Networks<\/span>, October 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSwan 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\u00e8<\/span>mes et Applications R\u00e9<\/span>partis \u00e0 Sorbonne Universit\u00e9<\/span>.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts. Algorithmique de la mobilit\u00e9<\/span>. http:\/\/www.labri.fr\/perso\/acasteig\/teaching\/algomob\/, 2017. Module de Master 2 (48h), parcours R\u00e9<\/span>seaux de Communication et Internet \u00e0 U. Bordeaux.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes. Leader Election in Asymmetric Labeled Unidirectional Rings<\/span>. Meeting ANR DESCARTES<\/span>, October 3rd 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen. PADEC: A Framework for Certified Self-Stabilization<\/span>. Meeting ANR DESCARTES<\/span>, October 3rd 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen. PADEC: A Framework for Certified Self-Stabilization<\/span>. S\u00e9minaire du LaBRI<\/span>, March 5th 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes. Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions<\/span>. Meeting ANR DESCARTES<\/span>, March 28th 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes. A lower bound of graph exploration by a swarm of oblivious robots<\/span>. Workshop Morover<\/span>, November 15th 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes. A lower bound of graph exploration by a swarm of oblivious robots<\/span>. Workshop GRASTA (GRAph Searching, Theory and Applications)<\/span>, September 25th 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nPierre Corbineau. Coq in practice: Certification of self-stabilizing algorithms<\/span>. S\u00e9minaires SIESTE, ENS Lyon<\/span>, Feb 27th 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nPierre Corbineau. PADEC: A Framework for Certified Self-Stabilization<\/span>. Workshop COQ en STOCK<\/span>, October 19th 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9<\/span><\/span>phane Devismes and Colette Johnen. Soyez efficace, rembobinez. In ALGOTEL 2019 – 21\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, and Ana\u00efs Durand. Silence dans la for\u00eat !<\/span> In ALGOTEL 2019 – 21\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Narbonne, France, June 3-7 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Joseph\u00a0G. Peters, and Jason Schoeters. Trouver des spanneur peu denses dans les cliques temporelles. In ALGOTEL 2019 – 21\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. 2019.<\/td>\n<\/tr>\n
\u2022<\/td>\nSt\u00e9phane Devismes, David Ilcinkas, and Colette Johnen. Sch\u00e9ma g\u00e9n\u00e9ral auto-stabilisant et silencieux de constructions de type arbres couvrants. In ALGOTEL 2018 – 20\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Roscoff, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen, St\u00e9phane Devismes, Ana\u00efs Durand, and Franck Petit. Stabilisation progressive. In ALGOTEL 2018 – 20\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Roscoff, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9<\/span>bastien Bouchard, Marjorie Bournat, Yoann Dieudonn\u00e9<\/span>, Swan Dubois, and Franck Petit. Approche asynchrone dans le plan : un algorithme d\u00e9<\/span>terministe polynomial. In ALGOTEL 2018 – 20\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Roscoff, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nS\u00e9<\/span>bastien Bouchard, Yoann Dieudonn\u00e9<\/span>, and Bertrand Ducourthial. Rassemblement byzantin dans les r\u00e9<\/span>seaux. In ALGOTEL 2018 – 20\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Roscoff, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nFabienne Carrier, Ajoy\u00a0K. Datta, St\u00e9<\/span>phane Devismes, and Lawrence Larmore. L<\/span>-exclusion auto-stabilisante revisit\u00e9<\/span>e. In ALGOTEL 2018 – 20\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Roscoff, 2018.<\/td>\n<\/tr>\n
\u2022<\/td>\nPierre Cast\u00e9<\/span>ran. Hydra ludica: une preuve d’impossibilit\u00e9<\/span> de prouver simplement. JFLA 2018<\/span>, Janvier 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nAna\u00efs Durand. Election et anneaux unidirectionnels en pr\u00e9sence d’homonymes. In ALGOTEL 2017 – 19\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Quiberon, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nKarine Altisen and Pierre Corbineau. Composition certifi\u00e9 d’algorithmes autostabilisants silencieux. In ALGOTEL 2017 – 19\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Quiberon, May 30 – June 2 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nArnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Calcul de param\u00e8tres minimaux dans les graphes dynamiques. In ALGOTEL 2017 – 19\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Quiberon, 2017.<\/td>\n<\/tr>\n
\u2022<\/td>\nMohammed Haddad, Colette Johnen, and Sven K\u00f6<\/span>hler. Polynomial Silent Self-Stabilizing Maximal p-Star Decomposition<\/span>. In ALGOTEL 2017 – 19\u00e8<\/span>mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9<\/span>l\u00e9<\/span>communications<\/span><\/em>. Quiberon, 2017.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
\u00a9 \"\"<\/a><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u2022 L\u00e9lia 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. \u2022 L\u00e9lia 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 … Continuer la lecture de Publications<\/span> →<\/span><\/a><\/p>\n","protected":false},"author":37,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-119","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/pages\/119","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/users\/37"}],"replies":[{"embeddable":true,"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/comments?post=119"}],"version-history":[{"count":43,"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/pages\/119\/revisions"}],"predecessor-version":[{"id":550,"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/pages\/119\/revisions\/550"}],"wp:attachment":[{"href":"https:\/\/wp-systeme.lip6.fr\/estate\/wp-json\/wp\/v2\/media?parent=119"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}