Research activity

1998-2025 Publications

• 2025
  • F. Bonnet, Q. Bramas, P. Courtieu, X. Défago, L. Rieg, S. Tixeuil, X. Urbain : “Comment se rassembler (avec certitude) quand on est confus et désorienté”, ALGOTEL 2025 – 27^es Rencontres Francophones sur les AspectsAlgorithmiques des Télécommunications, Saint Valery-sur-Somme, France (2025)
  • M. Legheraba, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Des noeuds anonymes hissés au rang de stars”, ALGOTEL 2025 – 27^es Rencontres Francophones sur les AspectsAlgorithmiques des Télécommunications, Saint Valery-sur-Somme, France (2025)
  • M. Legheraba, S. Galkiewicz, M. Potop‑Butucaru, S. Tixeuil : “Les étoiles montantes de l’apprentissage distribué”, ALGOTEL 2025 – 27^es Rencontres Francophones sur les AspectsAlgorithmiques des Télécommunications, Saint Valery-sur-Somme, France (2025)
  • F. Bonnet, Q. Bramas, P. Courtieu, X. Défago, L. Rieg, S. Tixeuil, X. Urbain : “Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm”, SIROCCO 2025, vol. 15671, LNCS, Delphi, Greece, pp. 127-143, (Springer Nature Switzerland) (2025)
  • Q. Bramas, H. Kakugawa, S. Kamei, A. Lamani, F. Ooshita, M. Shibata, S. Tixeuil : “A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines”, Structural Information and Communication Complexity. SIROCCO 2025., vol. 15671, Lecture Notes in Computer Science, Delphi, Greece, pp. 159-175, (Springer Nature Switzerland) (2025)
  • S. Ayoubi, G. Blanc, H. Jmila, S. Tixeuil : “Privacy benchmarking of intrusion detection sytems”, AINA-2025 : 39^th International Conference on Advanced Information Networking and Applications, vol. 248, Lecture Notes on Data Engineering and Communications Technologies, Barcelone, Spain, pp. 406-417, (Springer Nature Switzerland), (ISBN: 978-3-031-87772-8) (2025)
  • S. Ayoubi, S. Tixeuil, G. Blanc, H. Jmila : “FREIDA: a concrete tool for reproducible evaluation of IDS using a data-driven approach”, CRiSIS 2024: Risks and Security of Internet and Systems: 19^th International Conference, vol. 15456, Aix-en-Provence, France, pp. 40-55, (Springer Nature Switzerland), (ISBN: 978-3-031-89350-6) (2025)
  • G. Nibert, S. Tixeuil, B. Polvé, N. Bakalafoua M'Boussi, X. Nguyen : “Preventing WebRTC IP Address Leaks”, Risks and Security of Internet and Systems, vol. 15456, Lecture Notes in Computer Science, Aix-en-Provence, France, pp. 365-381, (Springer Nature Switzerland), (ISBN: 978-3-031-89350-6) (2025)
  • M. Legheraba, S. Galkiewicz, M. Potop‑Butucaru, S. Tixeuil : “HEAL: Resilient and Self-* Hub-Based Learning”, Advanced Information Networking and Applications. AINA 2025, vol. 246, Lecture Notes on Data Engineering and Communications Technologies, Barcelona (ES), Spain, pp. 200-211, (Springer Nature Switzerland) (2025)
  • M. Dresler, S. Mansour, S. Talhaoui, Y. Yamauchi, S. Tixeuil : “On Dynamics of Basic Network Creation Games With Non‐Uniform Communication Interest”, Concurrency and Computation: Practice and Experience, vol. 37 (4-5), pp. e8361, (Wiley) (2025)
  • S. Bonomi, G. Farina, S. Tixeuil : “On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks”, (2025)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil, K. Wada : “Gathering on Rings for Myopic Asynchronous Robots with Lights”, Theory of Computing Systems, vol. 69 (1), pp. 8, (Springer Verlag) (2025)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents”, 28^th International Conference on Principles of Distributed Systems (OPODIS 2024), vol. 324, Leibniz International Proceedings in Informatics (LIPIcs), Lucca, Italy, pp. 9:1-9:16, (Schloss Dagstuhl – Leibniz-Zentrum für Informatik), (ISBN: 978-3-95977-360-7) (2025)
• 2024
  • M. Legheraba, S. Galkiewicz, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “HEAL: Resilient and Self-* Hub-based Learning”, (2024)
  • S. Ayoubi, S. Tixeuil, G. Blanc, H. Jmila : “Demo: towards reproducible evaluations of ML-based IDS using data-driven approaches”, CCS '24: ACM SIGSAC Conference on Computer and Communications Security, Salt Lake City, UT, United States, pp. 5081-5083, (Association for Computing Machinery) (2024)
  • M. Legheraba, S. Galkiewicz, M. Potop‑Butucaru, S. Tixeuil : “HEAL: Resilient and Self-* Hub-based Learning”, (2024)
  • S. Bonomi, G. Farina, S. Tixeuil : “Reliable communication in dynamic networks with locally bounded byzantine faults”, Journal of Parallel and Distributed Computing, vol. 193, pp. 104952, (Elsevier) (2024)
  • Q. Bramas, S. Kamei, A. Lamani, S. Tixeuil : “Stand-up indulgent gathering on lines”, Theoretical Computer Science, vol. 1016, pp. 114796, (Elsevier) (2024)
  • L. Blin, A. Durand, S. Tixeuil : “Resource efficient stabilization for local tasks despite unknown capacity links”, Theoretical Computer Science, vol. 1013 (1), pp. 114744, (Elsevier) (2024)
  • M. Legheraba, M. Potop‑Butucaru, S. Tixeuil : “Brief Announcement: A Self-* and Persistent Hub Sampling Service”, Stabilization, Safety, and Security of Distributed Systems, vol. 14931, Lecture Notes in Computer Science, Nagoya, Aichi, Japan, pp. 461-465, (Springer Nature Switzerland), (ISBN: 978-3-031-74498-3) (2024)
  • B. Chan Yip Hon, B. Zaghdoudi, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Challenger: Blockchain-based Massively Multiplayer Online Game Architecture”, International Conference on Networked Systems (NETYS), vol. 14783, Lecture Notes in Computer Science, Rabat (MOROCCO), Morocco, pp. 50-66, (Springer Nature Switzerland) (2024)
  • Sh. Khozam, G. Blanc, S. Tixeuil, É. Totel : “DDoS mitigation while preserving QoS: a deep reinforcement learning-based approach”, 2024 IEEE 10^th International Conference on Network Softwarization (NetSoft), Saint Louis, MO, United States, pp. 369-374, (IEEE), (ISBN: 979-8-3503-6958-8) (2024)
  • T. An, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “ABD-HFL: Byzantine-resistant Decentralized Hierarchical Federated Learning”, (2024)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents”, 3^rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol. 292, Leibniz International Proceedings in Informatics (LIPIcs), Patras, Greece, pp. 25:1-25:5, (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik), (ISBN: 978-3-95977-315-7) (2024)
  • Q. Bramas, J.‑R. Luttringer, S. Tixeuil : “Online Space-Time Travel Planning in Dynamic Graphs”, 3^rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), vol. 292, Patras, Greece, pp. 7:1-7:14, (Schloss Dagstuhl), (ISBN: 978-3-95977-315-7) (2024)
  • A. Pham, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Comment Saboter l’Apprentissage Collectif par Commérage”, AlgoTel 2024 – 26^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Briac-sur-Mer, France (2024)
  • Q. Bramas, J.‑R. Luttringer, S. Tixeuil : “Le guide du routard temporel”, AlgoTel 2024 – 26^es Rencontres Francophones sur lesAspects Algorithmiques des Télécommunications, Saint-Briac-sur-Mer, France (2024)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “On n’explore que deux fois”, AlgoTel 2024 – 26^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Briac-sur-Mer, France (2024)
  • Q. Bramas, S. Kamei, A. Lamani, S. Tixeuil : “Stand-Up Indulgent Gathering on Rings”, International Colloquium on Structural Information and Communication Complexity, vol. 14662, Lecture Notes in Computer Science, Vietri sul Mare, Italy, pp. 119-137, (Springer) (2024)
  • M. Legheraba, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Emergent Peer-to-Peer Multi-Hub Topology”, (2024)
  • G. Nibert, S. Tixeuil, B. Polvé, N. Bakalafoua M'Boussi, X. Nguyen : “Empêcher les fuites d’adresses IP liées à WebRTC”, RESSI 2024 - Rendez-Vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, Eppe-Sauvage, France (2024)
  • A. Pham, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Data Poisoning Attacks in Gossip Learning”, Advanced Information Networking and Applications, vol. 200, Lecture Notes on Data Engineering and Communications Technologies, Kitakyūshū, Japan, pp. 213-224, (Springer Nature Switzerland), (ISBN: 978-3-031-57853-3) (2024)
  • A. Pham, M. Potop‑Butucaru, S. Tixeuil, S. Fdida : “Data Poisoning Attacks in Gossip Learning”, (2024)
• 2023
  • S. Bonomi, G. Farina, S. Tixeuil : “Reliable Broadcast despite Mobile Byzantine Faults”, (2023)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents”, SSS 2023: Stabilization, Safety, and Security of Distributed Systems, vol. 14310, Lecture Notes in Computer Science, Jersey City, NJ, United States, pp. 380-384, (Springer Nature Switzerland), (ISBN: 978-3-031-44274-2) (2023)
  • R. Eguchi, F. Ooshita, M. Inoue, S. Tixeuil : “Meeting Times of Non-atomic Random Walks”, Stabilization, Safety, and Security of Distributed Systems, vol. 14310, Lecture Notes in Computer Science, Jersey City, NJ, United States, pp. 297-311, (Springer Nature Switzerland), (ISBN: 978-3-031-44274-2) (2023)
  • Q. Bramas, J.‑R. Luttringer, S. Tixeuil : “Offline Constrained Backward Time Travel Planning”, SSS 2023: Stabilization, Safety, and Security of Distributed Systems, vol. 14310, Lecture Notes in Computer Science, Jersey City, NJ, United States, pp. 466-480, (Springer Nature Switzerland), (ISBN: 978-3-031-44274-2) (2023)
  • Q. Bramas, J.‑R. Luttringer, S. Tixeuil : “Offline Constrained Backward Time Travel Planning”, Stabilization, Safety, and Security of Distributed Systems, vol. 14310, Lecture Notes in Computer Science, Jersey City, NJ, United States, pp. 466-480, (Springer Nature Switzerland), (ISBN: 978-3-031-44274-2) (2023)
  • Q. Bramas, S. Kamei, A. Lamani, S. Tixeuil : “Stand-Up Indulgent Gathering on Lines”, SSS 2023: Stabilization, Safety, and Security of Distributed Systems, vol. 14310, Lecture Notes in Computer Science, Jersey City, NJ, United States, pp. 451-465, (Springer Nature Switzerland), (ISBN: 978-3-031-44274-2) (2023)
  • M. Shibata, S. Tixeuil : “Semi‐uniform deployment of mobile robots in perfect $\ell$‐ary trees”, Concurrency and Computation: Practice and Experience, vol. 35 (19), pp. e7432, (Wiley) (2023)
  • K. Okumura, S. Tixeuil : “Fault-Tolerant Offline Multi-Agent Path Planning”, Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37 (10), Washington DC, United States, pp. 11647-11654 (2023)
  • S. Bonomi, G. Farina, S. Tixeuil : “Comment extraire un discours cohérent de la confusion générale”, AlgoTel 2023 - 25^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Cargese, France (2023)
  • Q. Bramas, A. Lamani, S. Tixeuil : “Rendez-vous avec un lapin”, AlgoTel 2023 - 25^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Cargese, France (2023)
  • S. Ayoubi, G. Blanc, H. Jmila, S. Tixeuil, Th. Silverston : “Evaluation Framework for ML-based IDS”, RESSI 2023 : Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, Neuvy-sur-Barangeon, France (2023)
  • X. Défago, A. Heriban, S. Tixeuil, K. Wada : “Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space”, Robotics and Autonomous Systems, vol. 163, pp. 104378, (Elsevier) (2023)
  • Q. Bramas, A. Lamani, S. Tixeuil : “The agreement power of disagreement”, Theoretical Computer Science, vol. 954, pp. 113772, (Elsevier) (2023)
  • Q. Bramas, S. Kamei, A. Lamani, S. Tixeuil : “Stand-Up Indulgent Gathering on Lines”, (2023)
  • S. Ayoubi, G. Blanc, H. Jmila, Th. Silverston, S. Tixeuil : “Data-driven evaluation of intrusion detectors: a methodological framework”, Foundations and Practice of Security, vol. LNCS-13877, Lecture Notes in Computer Science, Ottawa, ON, Canada, pp. 142-157, (Springer), (ISBN: 978-3-031-30122-3) (2023)
  • Q. Bramas, A. Lamani, S. Tixeuil : “Stand Up Indulgent Gathering”, Theoretical Computer Science, vol. 939, pp. 63-77, (Elsevier) (2023)
• 2022
  • S. Tixeuil : “Realistic Self-stabilization”, 26^th International Conference on Principles of Distributed Systems (OPODIS 2022), Bruxelles, Belgium (2022)
  • S. Kamei, S. Tixeuil : “An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids”, The Computer Journal, (Oxford University Press (UK)) (2022)
  • S. Tanaka, F. Bonnet, S. Tixeuil, Y. Tamura : “Quixo is Solved”, Advances in Computer Games (ACG 2021), vol. 13262, Lecture Notes in Computer Science, Maastricht, Netherlands, pp. 85-95, (Springer International Publishing) (2022)
  • J. Oglio, K. Hood, M. Nesterenko, S. Tixeuil : “QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator”, ApPLIED '22: Proceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, Salerno, Italy, pp. 40-46, (ACM) (2022)
  • F. Mathieu, S. Tixeuil : “Fun with FUN”, FUN with Algorithms, vol. 226, LIPIcs, Favignana, Italy, pp. 21:1-21:13, (Schloss Dagstuhl) (2022)
  • S. Bonomi, J. Decouchant, G. Farina, V. Rahli, S. Tixeuil : “Comment réduire efficacement l’entropie des sources malveillantes d’information”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
  • F. Mathieu, S. Tixeuil : “Il était une fois Algotel”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
  • Q. Bramas, A. Lamani, S. Tixeuil : “Qui ne se ressemble pas s’assemble”, AlgoTel 2022 - 24^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint-Rémy-Lès-Chevreuse, France (2022)
  • G. Blanc, Th. Silverston, S. Tixeuil : “GRIFIN: cognitive and programmable security for resilient next-generation networks”, RESSI 2022 : Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, Chambon-sur-Lac, France (2022)
  • F. Ooshita, S. Tixeuil : “Ring exploration with myopic luminous robots”, Information and Computation, vol. 285, pp. 104702, (Elsevier) (2022)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Swarms of Mobile Robots: Towards Versatility with Safety”, Leibniz Transactions on Embedded Systems, vol. 8 (2), Distributed Hybrid Systems, pp. 02:1–02:36, (European Design and Automation Association (EDAA) \ EMbedded Systems Special Interest Group (EMSIG) and Schloss Dagstuhl -- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing.) (2022)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps”, Theoretical Computer Science, (Elsevier) (2022)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil, K. Wada : “Asynchronous Gathering in a Torus”, 25^th International Conference on Principles of Distributed Systems (OPODIS 2021), vol. 217, Leibniz International Proceedings in Informatics (LIPIcs), Strasbourg, France, pp. 9:1-9:17, (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik) (2022)
• 2021
  • M. Shibata, S. Tixeuil : “Semi-Uniform Deployment of Mobile Robots in Perfect l-ary Trees”, 2021 Ninth International Symposium on Computing and Networking (CANDAR), Matsue, Japan, pp. 168-174, (IEEE) (2021)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Computer Aided Formal Design of Swarm Robotics Algorithms”, Stabilization, Safety, and Security of Distributed Systems. SSS 2021, vol. 13046, Lecture Notes in Computer Science, Online, Sweden, pp. 469-473, (Springer International Publishing) (2021)
  • Q. Bramas, A. Lamani, S. Tixeuil : “The Agreement Power of Disagreement”, Stabilization, Safety, and Security of Distributed Systems. SSS 2021, vol. 13046, Lecture Notes in Computer Science, Online, Sweden, pp. 273-288, (Springer International Publishing) (2021)
  • Q. Bramas, A. Lamani, S. Tixeuil : “Stand up Indulgent Gathering”, ALGOSENSORS 2021, vol. 12961, Lecture Notes in Computer Science, Lisbon, Portugal, pp. 17-28, (Springer International Publishing) (2021)
  • Q. Bramas, A. Lamani, S. Tixeuil : “The agreement power of disagreement”, (2021)
  • H. Yasumi, F. Ooshita, M. Inoue, S. Tixeuil : “Uniform bipartition in the population protocol model with arbitrary graphs”, Theoretical Computer Science, (Elsevier) (2021)
  • S. Bonomi, J. Decouchant, G. Farina, V. Rahli, S. Tixeuil : “Practical Byzantine Reliable Broadcast on Partially Connected Networks”, 2021 IEEE 41^st International Conference on Distributed Computing Systems (ICDCS), DC, United States, pp. 506-516, (IEEE) (2021)
  • S. Bonomi, G. Farina, S. Tixeuil : “Bloquer efficacement les "fake news" sans connaître leurs réseaux de propagation”, ALGOTEL 2021 — 23^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Rochelle, France (2021)
  • A. Heriban, S. Tixeuil : “Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds”, Parallel Processing Letters, vol. 31 (01), pp. 2150002, (World Scientific Publishing) (2021)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Computer Aided Formal Design of Swarm Robotics Algorithms”, (2021)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil, K. Wada : “Asynchronous Gathering in a Torus”, (2021)
  • S. Bonomi, G. Farina, S. Tixeuil : “Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults”, Networked Systems, 8^th International Conference, NETYS 2020, vol. 12129, Lecture Notes in Computer Science, Marrakech, Morocco, pp. 112-128, (Springer, Cham) (2021)
  • Y. Amoussou‑Guenou, S. Baarir, M. Potop‑Butucaru, N. Sznajder, L. Tible, S. Tixeuil : “On the Encoding and Solving of Partial Information Games”, Networked Systems, vol. 12129, Lecture Notes in Computer Science, Marrakech, Morocco, pp. 60-76, (Springer International Publishing), (ISBN: 978-3-030-67087-0) (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)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Comment s’assurer de garder le contact (et nos distances)”, ALGOTEL 2021 - 23^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Rochelle, France (2021)
  • A. Heriban, S. Tixeuil : “Unreliable Sensors for Reliable Efficient Robots”, (2021)
• 2020
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized verification of algorithms for oblivious robots on a ring”, Formal Methods in System Design, vol. 56, pp. 55-89, (Springer Verlag) (2020)
  • H. Yasumi, F. Ooshita, M. Inoue, S. Tixeuil : “Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs”, 24^th International Conference on Principles of Distributed Systems (OPODIS 2020), vol. 184, Leibniz International Proceedings in Informatics (LIPIcs), Strasbourg, France, pp. 33:1-33:16, (Schloss Dagstuhl--Leibniz-Zentrum für Informatik) (2020)
  • Q. Bramas, A. Lamani, S. Tixeuil : “Stand Up Indulgent Rendezvous”, Stabilization, Safety, and Security of Distributed Systems, vol. 12514, Lecture Notes in Computer Science (LNCS), Austin, TX, United States, pp. 45-59, (Springer, Cham), (ISBN: 978-3-030-64348-5) (2020)
  • S. Bonomi, G. Farina, S. Tixeuil : “Boosting the Efficiency of Byzantine-Tolerant Reliable Communication”, Stabilization, Safety, and Security of Distributed Systems, Austin, United States, pp. 29-44 (2020)
  • M. Shibata, S. Tixeuil : “Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings”, Stabilization, Safety, and Security of Distributed Systems, Austin, United States, pp. 264-279 (2020)
  • H. Yasumi, F. Ooshita, M. Inoue, S. Tixeuil : “Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs”, (2020)
  • S. Bonomi, G. Farina, S. Tixeuil : “Boosting the Efficiency of Byzantine-tolerant Reliable Communication”, (2020)
  • X. Défago, A. Heriban, S. Tixeuil, K. Wada : “Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space”, 2020 International Symposium on Reliable Distributed Systems (SRDS), Shanghai, China, pp. 113-122, (IEEE) (2020)
  • S. Tanaka, F. Bonnet, S. Tixeuil, Y. Tamura : “Quixo Is Solved”, (2020)
  • L. Blin, A. Durand, S. Tixeuil : “Resource Efficient Stabilization for Local Tasks despite Unknown Capacity Links”, (2020)
  • L. Blin, A. Durand, S. Tixeuil : “On peut tromper mille personnes mille fois, mais pas plus”, ALGOTEL 2020 - 22^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France, pp. 156-165, (ACM) (2020)
  • S. Bonomi, G. Farina, S. Tixeuil : “Une méthode efficace pour éviter la propagation des fake news”, ALGOTEL 2020 – 22^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France (2020)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Du discrètement continu au continûment discret”, ALGOTEL 2020 – 22^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France (2020)
  • N. Ammar, L. Noirie, S. Tixeuil : “Autonomous Identification of IoT Device Types based on a Supervised Classification”, ICC 2020 - 2020 IEEE International Conference on Communications (ICC), Virtual conference, Ireland (2020)
  • L. Blin, S. Tixeuil : “Compact self-stabilizing leader election for general networks”, Journal of Parallel and Distributed Computing, (Elsevier) (2020)
  • Sh. Das, S. Tixeuil : “Special issue on Structural Information and Communication Complexity”, Theoretical Computer Science, vol. 811, pp. 1-2, (Elsevier) (2020)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil, K. Wada : “Gathering on Rings for Myopic Asynchronous Robots With Lights”, 23^rd International Conference on Principles of Distributed Systems (OPODIS 2019), vol. 153, Leibniz International Proceedings in Informatics (LIPIcs), Neuchatel, Netherlands, pp. 27:1-27:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2020)
• 2019
  • X. Défago, A. Heriban, S. Tixeuil, K. Wada : “Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space”, 33^rd International Symposium on Distributed Computing (DISC 2019), vol. 146, Leibniz International Proceedings in Informatics (LIPIcs), Budapest, Hungary, pp. 41:1-41:3, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2019)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Distributed Online Data Aggregation in Dynamic Graphs”, NETYS 2019 - 7^th International Conference on Networked Systems, vol. 11704, Lecture Notes in Computer Science, Marrakech, Morocco, pp. 365-380 (2019)
  • S. Bonomi, G. Farina, S. Tixeuil : “Multi-hop Byzantine reliable broadcast with honest dealer made practical”, Journal of the Brazilian Computer Society, vol. 25 (1), (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)
  • N. Ammar, L. Noirie, S. Tixeuil : “Autonomous IoT Device Identification Prototype”, Network Traffic Measurement and Analysis Conference 2019, Paris, France, pp. https://tma.roc.cnam.fr/proceedings/tma_demo_2.pdf, (IEEE) (2019)
  • A. Heriban, S. Tixeuil : “Mobile Robots with Uncertain Visibility Sensors”, SIROCCO 2019 - 26^th International Colloquium on Structural Information and Communication Complexity, vol. 11639, Lecture Notes in Computer Science, L'Aquila, Italy, pp. 349-352, (Springer) (2019)
  • N. Ammar, L. Noirie, S. Tixeuil : “Network-Protocol-Based IoT Device Identification”, 2019 Fourth International Conference on Fog and Mobile Edge Computing (FMEC), Rome, Italy, pp. 204-209, (IEEE) (2019)
  • Q. Bramas, S. Tixeuil : “Les 4 Robots Fantastiques”, ALGOTEL 2019 - 21^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France (2019)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Manuel de savoir-prouver à l’usage des roboteux et des distributeux”, ALGOTEL 2019 - 21^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, pp. 1-4 (2019)
  • N. Ammar, L. Noirie, S. Tixeuil : “Amélioration de l’identification du type des objets connectés par classification supervisée”, CORES2019 - Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Jardins de Saint Benoît, France (2019)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots”, 7^th International Conference on NETworked sYStems (NETYS 2019), vol. 11704, Lecture Notes in Computer Science, Marrakech, Morocco, pp. 93-09 (2019)
  • S. Bonomi, G. Farina, S. Tixeuil : “Multi-hop Byzantine Reliable Broadcast with Honest Dealer Made Practical”, (2019)
  • Th. Balabonski, A. Delga, L. Rieg, S. Tixeuil, X. Urbain : “Synchronous Gathering without Multiplicity Detection: a Certified Algorithm”, Theory of Computing Systems, vol. 63 (2), pp. 200-218, (Springer Verlag) (2019)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Approximate Agreement under Mobile Byzantine Faults”, Theoretical Computer Science, vol. 758, pp. 17-29, (Elsevier) (2019)
  • Q. Bramas, D. Foreback, M. Nesterenko, S. Tixeuil : “Packet Efficient Implementation of the Omega Failure Detector”, Theory of Computing Systems, vol. 63 (2), pp. 237-260, (Springer Verlag) (2019)
  • X. Défago, M. Potop‑Butucaru, S. Tixeuil : “Fault-Tolerant Mobile Robots”, chapter in Distributed Computing by Mobile Entities, vol. 11340, Lecture Notes in Computer Science, pp. 234-251, (Springer) (2019)
  • M. Potop‑Butucaru, N. Sznajder, S. Tixeuil, X. Urbain : “Formal Methods for Mobile Robots”, chapter in Distributed Computing by Mobile Entities,Current Research in Moving and Computing n°11340, Theoretical Computer Science and General Issues, pp. 278-313, (Springer International Publishing), (ISBN: 978-3-030-11071-0) (2019)
  • D. Foreback, M. Nesterenko, S. Tixeuil : “Churn Possibilities and Impossibilities”, NETYS 2018 - 6^th International Conference on Networked Systems, vol. 11028, Lecture Notes in Computer Science, Essaouira, Morocco, pp. 303-317, (Springer) (2019)
  • E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop‑Butucaru, S. Tixeuil : “On asynchronous rendezvous in general graphs”, Theoretical Computer Science, vol. 753, pp. 80-90, (Elsevier) (2019)
  • M. Ghaffari, M. Nesterenko, S. Tixeuil, S. Tucci, Y. Yamauchi : “Stabilization, Safety, and Security of Distributed Systems.21^st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings.”, vol. 11914, Lecture Notes in Computer Science, (Springer) (2019)
• 2018
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps”, 20^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 398-403, (Springer) (2018)
  • S. Bonomi, G. Farina, S. Tixeuil : “Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures”, SSS 2018 - 20^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 170-185, (Springer) (2018)
  • Q. Bramas, S. Tixeuil : “Arbitrary Pattern Formation with Four Robots”, SSS 2018 - 20^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 333-348, (Springer) (2018)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots”, Stabilization, Safety, and Security of Distributed Systems. SSS 2018., vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 404-408, (Springer-Verlag) (2018)
  • F. Ooshita, S. Tixeuil : “Ring Exploration with Myopic Luminous Robots”, SSS 2018 - 20^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 11201, Lecture Notes in Computer Science, Tokyo, Japan, pp. 301-316, (Springer) (2018)
  • S. Bonomi, G. Farina, S. Tixeuil : “Multi-hop Byzantine Reliable Broadcast Made Practical”, LADC 2018 - 8^th Latin-American Symposium on Dependable Computing, Foz do Iguau, Brazil, pp. 155-160, (IEEE) (2018)
  • T. Izumi, D. Kaino, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “On time complexity for connectivity-preserving scattering of mobile robots”, Theoretical Computer Science, vol. 738, pp. 42-52, (Elsevier) (2018)
  • Y. Amoussou‑Guenou, S. Baarir, M. Potop‑Butucaru, N. Sznajder, L. Tible, S. Tixeuil : “On the encoding and solving partial information games”, (2018)
  • S. Bonomi, G. Farina, S. Tixeuil : “Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures”, (2018)
  • M. Inoue, S. Tixeuil : “Short Paper: Tight Bounds for Universal and Cautious Self-stabilizing 1-Maximal Matching”, NETYS 2018 - 6^th International Conference on Networked Systems, vol. 11028, Lecture Notes in Computer Science, Essaouira, Morocco, pp. 334-339, (Springer) (2018)
  • N. Ammar, L. Noirie, S. Tixeuil : “Identification du type des objets connectés par les informations des protocoles réseaux”, Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Roscoff, France (2018)
  • L. Blin, S. Tixeuil : “Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative”, Distributed Computing, vol. 31 (2), pp. 139-166, (Springer Verlag) (2018)
  • L. Blin, S. Tixeuil : “Compact Self-Stabilizing Leader Election for General Networks”, LATIN 2018 - 13^th Latin American Symposium on Theoretical Informatics, vol. 10807, Lecture Notes in Computer Science, Buenos Aires, Argentina, pp. 161-173, (Springer) (2018)
  • Th. Balabonski, R. Pelle, L. Rieg, S. Tixeuil : “A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs”, ICDCN '18 Proceedings of the 19^th International Conference on Distributed Computing and Networking, Varanasi, India, pp. 1-10, (ACM Press) (2018)
  • J. Adamek, M. Nesterenko, J. Robinson, S. Tixeuil : “Concurrent Geometric Multicasting”, The 19^th International Conference on Distributed Computing and Networking, Varanasi, India, (ACM Press) (2018)
  • A. Heriban, X. Défago, S. Tixeuil : “Optimally Gathering Two Robots”, The 19^th International Conference on Distributed Computing and Networking, Varanasi, India, pp. 3, (ACM Press) (2018)
  • F. Faghih, B. Bonakdarpour, S. Tixeuil, S. Kulkarni : “AUTOMATED SYNTHESIS OF DISTRIBUTED SELF-STABILIZING PROTOCOLS”, Logical Methods in Computer Science, vol. 14, pp. 1-25, (Logical Methods in Computer Science Association) (2018)
  • D. Foreback, M. Nesterenko, S. Tixeuil : “Churn Possibilities and Impossibilities”, (2018)
  • Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots”, 1-12 pages (2018)
• 2017
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized verification of algorithms for oblivious robots on a ring”, Formal Methods in Computer Aided Design, Vienna, Austria, pp. 212-219, (IEEE) (2017)
  • J. Adamek, G. Farina, M. Nesterenko, S. Tixeuil : “Evaluating and Optimizing Stabilizing Dining Philosophers”, Journal of Parallel and Distributed Computing, vol. 109, pp. 63-74, (Elsevier) (2017)
  • Q. Bramas, S. Tixeuil : “The complexity of data aggregation in static and dynamic wireless sensor networks”, Information and Computation, vol. 255 (3), pp. 369-383, (Elsevier) (2017)
  • M. Inoue, F. Ooshita, S. Tixeuil : “Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks”, ACM Conference on Principles of Distributed Computing (PODC 2017), Washington, United States (2017)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Agrégation Distribuée de Données dans les Réseaux Dynamiques”, ALGOTEL 2017 - 19^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France (2017)
  • L. Blin, S. Tixeuil : “Algorithme Auto-Stabilisant Compact d’Election pour les Graphes Arbitraires”, ALGOTEL 2017 - 19^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France (2017)
  • Q. Bramas, S. Tixeuil : “Les Vertus Énergétiques de l’Inondation à Pleine Puissance”, Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Quiberon, France (2017)
  • Q. Bramas, S. Tixeuil : “The Random Bit Complexity of Mobile Robot Scattering”, International Journal of Foundations of Computer Science, vol. 28 (2), pp. 111-133, (World Scientific Publishing) (2017)
  • L. Blin, S. Tixeuil : “Brief announcement: Compact Self-Stabilizing Leader Election for General Networks”, Proceedings of DISC 2017, Vienna, Austria (2017)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal Storage under Unsynchronized Mobile Byzantine Faults”, Proceedings of SRDS 2017, Hong Kong, China, (IEEE Computer Society) (2017)
  • J. Adamek, M. Nesterenko, J. Robinson, S. Tixeuil : “Stateless Reliable Geocasting”, Proceedings of SRDS 2017, Hong Kong, China, (IEEE Computer Society) (2017)
  • Th. Balabonski, P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Certified Gathering of Oblivious Mobile Robots: survey of recent results and open problems”, Proceedings of AVOCS 2017, vol. 10471, Lecture Notes in Computer Science, Turin, Italy, pp. 165-181, (Springer) (2017)
  • P. BELLAVISTA, K. Kar, S. Tixeuil : “18^th International Conference on Distributed Computing and Networking (ICDCN 2017)”, 18^th International Conference on Distributed Computing and Networking (ICDCN 2017), Hyderabad, India, pp. 367, (ACM New York, NY, USA), (ISBN: 978-1-4503-4839-3) (2017)
  • J. Adamek, M. Nesterenko, J. Robinson, S. Tixeuil : “Concurrent Geometric Multicasting”, (2017)
  • A. Heriban, X. Défago, S. Tixeuil : “Optimally Gathering Two Robots”, (2017)
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized Verification of Algorithms for Oblivious Robots on a Ring”, (2017)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal Storage under Unsynchrononized Mobile Byzantine Faults”, (2017)
• 2016
  • W. Benchaïta, G. Tangari, S. Ghamri‑Doudane, S. Tixeuil : “Enhancing Content Distribution through Information-Aware Mechanisms”, CloudNet, Pisa, Italy (2016)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots”, Lecture Notes in Computer Science, vol. 9888, Lecture Notes in Computer Science, Paris, France, pp. 187-200, (Springer Berlin Heidelberg), (ISBN: 978-3-662-53426-7) (2016)
  • D. Foreback, M. Nesterenko, S. Tixeuil : “Infinite Unlimited Churn”, (2016)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Brief announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots”, PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, Chicago, United States, pp. 439-441, (ACM) (2016)
  • Q. Bramas, S. Tixeuil : “Brief announcement: Probabilistic Asynchronous Arbitrary Pattern Formation”, ACM Conference on Principles of Distributed Computing (PODC), Chicago, United States (2016)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal Mobile Byzantine Fault Tolerant Distributed Storage”, ACM Conference on Principles of Distributed Computing (PODC), Chicago, United States (2016)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal Mobile Byzantine Fault Tolerant Distributed Storage”, (2016)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Brief announcement: Approximate Agreement under Mobile Byzantine Faults Model”, IEEE Conference on Distributed Computing Systems (ICDCS 2016), Nara, Japan, pp. 727-728, (IEEE) (2016)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Brief announcement: Distributed Online Data Aggregation in Dynamic Graphs”, IEEE Conference on Distributed Computing Systems (ICDCS 2016), Nara, Japan, pp. 747-748, (IEEE) (2016)
  • Q. Bramas, S. Tixeuil : “Formation de Motifs Géométriques Arbitraires par des Robots Désorientés”, ALGOTEL 2016 - 18^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France (2016)
  • Q. Bramas, S. Tixeuil : “Benchmarking Energy-Efficient Broadcast Protocols in Wireless Sensor Networks”, Networked Systems - Fourth International Conference (NETYS 2016), Marakech, Morocco (2016)
  • F. Faghih, B. Bonakdarpour, S. Kulkarni, S. Tixeuil : “Specification-based Synthesis of Distributed Self-Stabilizing Protocols”, Formal Techniques for Distributed Objects, Components, and Systems International Conference (FORTE 2016), Heraklion, Greece (2016)
  • L. Blin, M. Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property”, The Computer Journal, vol. 59 (2), pp. 225-243, (Oxford University Press (UK)) (2016)
  • Q. Bramas, T. Masuzawa, S. Tixeuil : “Distributed Online Data Aggregation in Dynamic Graphs”, (2016)
  • B. Bérard, P. Lafourcade, L. Millet, M. Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Formal verification of mobile robot protocols”, Distributed Computing, vol. 29 (6), pp. 459-487, (Springer Verlag) (2016)
  • A. Maurer, S. Tixeuil : “Tolerating Random Byzantine Failures in an Unbounded Network”, Parallel Processing Letters, vol. 26 (1), pp. 1650003, (World Scientific Publishing) (2016)
  • M. Inoue, F. Ooshita, S. Tixeuil : “An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers”, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), vol. 10083, Lecture Notes in Computer Science, Lyon, France, pp. 195-212, (Springer) (2016)
  • D. Foreback, M. Nesterenko, S. Tixeuil : “Infinite Unlimited Churn (Short Paper)”, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), vol. 10083, Lecture Notes in Computer Science, Lyon, France, pp. 148-153, (Springer) (2016)
  • Q. Bramas, D. Foreback, M. Nesterenko, S. Tixeuil : “Packet Efficient Implementation of the Omega Failure Detector”, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), vol. 10083, Lecture Notes in Computer Science, Lyon, France, pp. 70-87, (Springer) (2016)
  • Q. Bramas, S. Tixeuil : “Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper)”, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), vol. 10083, Lecture Notes in Computer Science, Lyon, France, pp. 88-93, (Springer) (2016)
  • Th. Balabonski, A. Delga, L. Rieg, S. Tixeuil, X. Urbain : “Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm”, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), vol. 10083, Lecture Notes in COmputer Science, Lyon, France, pp. 7-19, (Springer) (2016)
  • M. Hiltunen, S. Tixeuil : “35^th IEEE Symposium on Reliable Distributed Systems (SRDS 2016)”, 35^th IEEE Symposium on Reliable Distributed Systems (SRDS 2016), Budapest, Hungary, (IEEE Computer Society), (ISBN: 978-1-5090-3513-7) (2016)
  • F. Bonnet, M. Potop‑Butucaru, S. Tixeuil : “Asynchronous Gathering in Rings with 4 Robots”, Ad Hoc Now 2016, Lille, France (2016)
  • W. Benchaïta, S. Ghamri‑Doudane, S. Tixeuil : “Stability and optimization of DNS-based request redirection in CDNs”, ICDCN '16 Proceedings of the 17^th International Conference on Distributed Computing and Networking, ICDCN '16 Proceedings of the 17^th International Conference on Distributed Computing and Networking, Singapore, Singapore, pp. 11, (ACM) (2016)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots”, (2016)
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Optimal Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp”, (2016)
  • F. Faghih, B. Bonakdarpour, S. Tixeuil, S. Kulkarni : “Specification-Based Synthesis of Distributed Self-Stabilizing Protocols”, Lecture Notes in Computer Science, vol. LNCS-9688, Formal Techniques for Distributed Objects, Components, and Systems, Heraklion, Greece, pp. 124-141 (2016)
• 2015
  • S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Approximate Agreement under Mobile Byzantine Faults”, (2015)
  • A. Maurer, X. Défago, S. Tixeuil : “Communicating Reliably in Multihop Dynamic Networks despite Byzantine Failures”, Proceedings of the International Symposium on Reliable Distributed Systems (SRDS2015), Montreal, Canada, (IEEE Press) (2015)
  • J. Adamek, M. Nesterenko, S. Tixeuil : “Evaluating and Optimizing Stabilizing Dining Philosophers”, The European Dependable Computing Conference (EDCC 2015), Paris, France (2015)
  • Q. Bramas, W. Dron, M. Ben Fadhl, Kh. HACHICHA, P. Garda, S. Tixeuil : “WiSeBat: Accurate Energy Benchmarking of Wireless Sensor Networks”, The Forum on specification and Design Languages (FDL 2015), Barcelona, Spain, pp. 1-8, (IEEE Press) (2015)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Maximum Metric Spanning Tree Made Byzantine Tolerant”, Algorithmica, vol. 73 (1), pp. 166-201, (Springer Verlag) (2015)
  • Q. Bramas, S. Tixeuil : “Probabilistic Asynchronous Arbitrary Pattern Formation”, (2015)
  • S. Aflaki, B. Bonakdarpour, S. Tixeuil : “Automated Analysis of Impact of Scheduling on Performance of Self-Stabilizing Protocols”, The International Conference on Stabilization, Safety, and Security in Distributed Systems (SSS 2015), vol. 9212, Lecture Notes in Computer Science, Edmonton, Canada, pp. 156-170, (Springer) (2015)
  • Q. Bramas, S. Tixeuil : “The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks”, The International Conference on Stabilization, Safety, and Security in Distributed Systems (SSS 2015), vol. 9212, Lecture notes in Computer Science, Edmonton, Canada, pp. 36-50, (Springer) (2015)
  • Q. Bramas, S. Tixeuil : “Wait-free Gathering without Chirality”, Proceedings of SIROCCO 2015, Lecture Notes in Computer Science, Montserrat, Spain, (Springer) (2015)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “A Certified Universal Gathering Algorithm for Oblivious Mobile Robots”, (2015)
  • Q. Bramas, S. Tixeuil : “Agréger Rapidement des Données est Difficile”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • A. Maurer, X. Défago, S. Tixeuil : “Communication fiable dans un réseau dynamique en présence de fautes Byzantines”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • Q. Bramas, W. Dron, M. Ben Fadhl, Kh. HACHICHA, P. Garda, S. Tixeuil : “De la Survie Énergétique des Réseaux de Capteurs”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • L. Millet, M. Potop‑Butucaru, N. Sznajder, S. Tixeuil : “Synthèse d’algorithmes pour robots mobiles : le cas du regroupement sur un anneau”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • Q. Bramas, S. Tixeuil : “The Random Bit Complexity of Mobile Robots Scattering”, Ad-hoc, Mobile, and Wireless Networks - 14^th International Conference, ADHOC-NOW 2015, vol. 9143, Lecture Notes in Computer Science, Athènes, Greece, pp. 210-224, (Springer) (2015)
  • N. Alon, H. Attiya, Sh. Dolev, S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Practically stabilizing SWMR atomic memory in message passing systems”, Journal of Computer and System Sciences, vol. 81 (4), pp. 692-701, (Elsevier) (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. Bonomi, M. Potop‑Butucaru, S. Tixeuil : “Stabilizing Byzantine-Fault Tolerant Storage”, IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2015, Hyderabad, India, pp. 894-903 (2015)
  • S. Devismes, S. Tixeuil, M. Yamashita : “Weak vs. Self vs. Probabilistic Stabilization”, International Journal of Foundations of Computer Science, vol. 26 (3), pp. 293-319, (World Scientific Publishing) (2015)
  • P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain : “Impossibility of gathering, a certification”, Information Processing Letters, vol. 115 (3), pp. 447-452, (Elsevier) (2015)
  • Q. Bramas, S. Tixeuil : “The Random Bit Complexity of Mobile Robots Scattering”, (2015)
  • F. Ooshita, S. Tixeuil : “On the self-stabilization of mobile oblivious robots in uniform rings”, Theoretical Computer Science, vol. 568, pp. 84-96, (Elsevier) (2015)
  • A. Maurer, S. Tixeuil : “Containing Byzantine Failures with Control Zones”, IEEE Transactions on Parallel and Distributed Systems, vol. 26 (2), pp. 362-370, (Institute of Electrical and Electronics Engineers) (2015)
  • Q. Bramas, D. Foreback, M. Nesterenko, S. Tixeuil : “Packet Efficient Implementation of the Omega Failure Detector”, (2015)
  • J. Adamek, M. Nesterenko, S. Tixeuil : “Stateless Geocasting”, (2015)
  • B. Bérard, P. Courtieu, L. Millet, M. Potop‑Butucaru, L. Rieg, N. Sznajder, S. Tixeuil, X. Urbain : “[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open Problems”, International Journal of Informatics Society, vol. 7 (3), pp. 101-114, (Japan Informatics Society) (2015)
• 2014
  • A. Maurer, S. Tixeuil : “Byzantine broadcast with fixed disjoint paths”, Journal of Parallel and Distributed Computing, vol. 74 (11), pp. 3153-3160, (Elsevier) (2014)
  • A. Honorat, M. Potop‑Butucaru, S. Tixeuil : “Gathering fat mobile robots with slim omnidirectional cameras”, Theoretical Computer Science, vol. 557, pp. 1-27, (Elsevier) (2014)
  • L. Millet, M. Potop‑Butucaru, N. Sznajder, S. Tixeuil : “On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering”, SSS 2014 - 16^th International Symposium on Stabilization, Safety and Security of Distributed Systems, vol. 8756, Lecture Notes in Computer Science, Paderborn, Germany, pp. 237-251, (Springer) (2014)
  • A. Maurer, S. Tixeuil : “Self-stabilizing Byzantine Broadcast”, Proceedings of the 33^rd IEEE Symposium on Reliable Distributed Systems (SRDS 2014), Nara, Japan, pp. 152-160, (IEEE) (2014)
  • J. Adamek, M. Nesterenko, S. Tixeuil : “Brief Announcement: Designing a Fault Tolerance Algorithm to Optimize Experimental Performance: the Case of Stabilizing Dining Philosophers”, 16^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2014, Paderborn, Germany, pp. 349-351 (2014)
  • P. Courtieu, L. Rieg, X. Urbain, S. Tixeuil : “Impossibility of Gathering, a Certification”, 10 pages (2014)
  • A. Maurer, S. Tixeuil, X. Défago : “Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults”, (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)
  • Q. Bramas, S. Tixeuil : “Le pouvoir séparateur d’une pièce de monnaie”, 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
  • R. Nor, M. Nesterenko, S. Tixeuil : “Linearizing Peer-to-Peer Systems with Oracles”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 8255, Lecture Notes in Computer Science, Osaka, Japan, pp. 221-236, (Springer) (2013)
  • C. Auger, Z. Bouzid, P. Courtieu, S. Tixeuil, X. Urbain : “Certified Impossibility Results for Byzantine-Tolerant Mobile Robots”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 8255, Lecture Notes in Computer Science, Osaka, Japan, pp. 178-190, (Springer) (2013)
  • C. Auger, Z. Bouzid, P. Courtieu, S. Tixeuil, X. Urbain : “Brief Announcement: Certified impossibility results for Byzantine-tolerant mobile robots”, International Symposium on Distributed Computing (DISC2013), vol. 8205, LNCS, Jerusalem, Israel, pp. 2 (2013)
  • M. Nesterenko, S. Tixeuil : “Ideal Stabilization”, International Journal of Grid and Utility Computing, vol. 4 (4), pp. 219-230, (Inderscience) (2013)
  • L. Blin, S. Tixeuil : “Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative”, DISC 2013 - 27^th International Symposium on Distributed Computing, vol. 8205, Lecture Notes in Computer Science, Jerusalem, Israel, pp. 76-90, (Springer) (2013)
  • C. Khouri, F. Greve, S. Tixeuil : “Consensus with Unknown Participants in Shared Memory”, International Symposium on Reliable Distributed Systems, Braga, Portugal, pp. 51-60, (IEEE) (2013)
  • N. Fallahi, B. Bonakdarpour, S. Tixeuil : “Rigorous Performance Evaluation of Self-Stabilization Using Probabilistic Model Checking”, International Symposium on Reliable Distributed Systems, Braga, Portugal, pp. 153-162, (IEEE) (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)
  • Z. Bouzid, Sh. Das, S. Tixeuil : “Gathering of Mobile Robots Tolerating Multiple Crash Faults”, International Conference on Distributed Computing Systems, Philadelphia, United States, pp. 337-346, (IEEE) (2013)
  • L. Blin, S. Tixeuil : “Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits”, ACM Symposium on Principles of Distributed Computing, Montreal, Canada, pp. 125-127, (ACM) (2013)
  • C. Auger, Z. Bouzid, P. Courtieu, S. Tixeuil, X. Urbain : “Certified Impossibility Results for Byzantine-Tolerant Mobile Robots”, (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. Maurer, S. Tixeuil : “Tolérer les fautes Byzantines dans les graphes planaires”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4 (2013)
  • A. Maurer, S. Tixeuil : “Dependable Information Broadcast in Sparsely Connected Networks”, International Conference on Latin American Dependable Computing, LADC 2013, Rio de Janeiro, Brazil, pp. 31-39 (2013)
  • S. Kamei, H. Kakugawa, S. Devismes, S. Tixeuil : “A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks”, Journal of Combinatorial Optimization, vol. 25 (3), pp. 430-459, (Springer Verlag) (2013)
  • A. Maurer, S. Tixeuil : “On Byzantine Broadcast in Planar Graphs”, (2013)
  • A. Maurer, S. Tixeuil : “A Scalable Byzantine Grid”, International Conference on Distributed Computing and Networking, vol. 7730, Lecture Notes in Computer Science, Mumbai, India, pp. 87-101, (Springer) (2013)
  • A. Datta, S. Devismes, L. Larmore, S. Tixeuil : “Fast Leader (Full) Recovery Despite Dynamic Faults”, International Conference on Distributed Computing and Networking, vol. 7730, Lecture Notes in Computer Science, Mumbai, India, pp. 428-433, (Springer) (2013)
  • Y. Carlinet, Th. Huynh, B. Kauffmann, F. Mathieu, L. Noirie, S. Tixeuil : “Contenu généré par les utilisateurs : une étude sur DailyMotion”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4 (2013)
  • B. Bérard, L. Millet, M. Gradinariu Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Vérification formelle et robots mobiles”, 15^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4, (Nisse, Nicolas et Rousseau, Franck et Busnel, Yann) (2013)
  • B. Bérard, L. Millet, M. Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Formal verification of Mobile Robot Protocols”, (2013)
• 2012
  • A. Maurer, S. Tixeuil : “On Byzantine Broadcast in Loosely Connected Networks”, 26^th International Symposium on Distributed Computing, DISC 2012, vol. 7611, Lecture Notes in Computer Science, Salvador, Brazil, pp. 253-266 (2012)
  • Y. Carlinet, Th. Huynh, B. Kauffmann, F. Mathieu, L. Noirie, S. Tixeuil : “Four Months in DailyMotion: Dissecting User Video Requests”, IWCMC 2012 - 8^th International Wireless Communications and Mobile Computing Conference, Limassol, Cyprus, pp. 613-618, (IEEE) (2012)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Gathering an even number of robots in an odd ring without global multiplicity detection”, (2012)
  • S. Dubois, S. Tixeuil, N. Zhu : “Mariages et Trahisons”, 14^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, pp. 1-4 (2012)
  • C. Khouri, F. Greve, S. Tixeuil : “Consenso com Participantes Desconhecidos em Memória Compartilhada”, Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos (SBRC 2012), Ouro Preto, Brazil, pp. 756-769 (2012)
  • S. Dubois, S. Tixeuil, N. Zhu : “The Byzantine Brides Problem”, (2012)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Bounding the Impact of Unbounded Attacks in Stabilization”, IEEE Transactions on Parallel and Distributed Systems, vol. 23 (3), pp. 460-466, (Institute of Electrical and Electronics Engineers) (2012)
  • Sh. Dolev, S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Crash Resilient and Pseudo-Stabilizing Atomic Registers”, OPODIS 2012 - 16^th International Conference on Principles of Distributed Systems, vol. 7702, Lecture Notes in Computer Science, Rome, Italy, pp. 135-150, (Springer) (2012)
  • Y. Yamauchi, S. Tixeuil, Sh. Kijima, M. Yamashita : “Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers”, International Symposium on Distributed COmputing, vol. 7611, Lecture Notes in Computer Science, Salvador, Brazil, pp. 413-414, (Springer) (2012)
  • Z. Bouzid, Sh. Das, S. Tixeuil : “Brief Announcement: Wait-Free Gathering of Mobile Robots”, International Symposium on Distributed Computing, vol. 7611, Lecture Notes in Computer Science, Salvador, Brazil, pp. 401-402, (Springer) (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)
  • J. Adamek, M. Nesterenko, S. Tixeuil : “Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 7596, Lecture Notes in Computer Science, Toronto, Canada, pp. 126-132, (Springer) (2012)
  • F. Ooshita, S. Tixeuil : “On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings”, International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 7596, Lecture Notes in Computer Science, Toronto, Canada, pp. 49-63, (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)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection”, Mathematical Foundations of Computer Science, vol. 7464, Lecture Notes in Computer Science, Bratislava, Slovakia, pp. 542-553, (Springer) (2012)
  • A. Maurer, S. Tixeuil : “Limiting Byzantine Influence in Multihop Asynchronous Networks”, International Conference on Distributed Computing Systems, Macau, China, pp. 183-192 (2012)
  • S. Dubois, S. Tixeuil, N. Zhu : “The Byzantine Brides Problem”, FUN 2012 - 6^th International Conference Fun with Algorithms, vol. 7288, Lecture Notes in Computer Science, Venice, Italy, pp. 107-118, (Springer) (2012)
  • A. Maurer, S. Tixeuil : “Confinement de fautes Byzantines dans les réseaux multi-sauts asynchrones”, 14^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France (2012)
  • S. Bernard, X. Défago, S. Tixeuil : “A Fast and Robust Optimistic Total Order Broadcast for Online Video Games”, International Conference on Advanced Information Networking and Applications Workshops, Fukuoka, Japan, pp. 189-196, (IEEE) (2012)
  • A. Maurer, S. Tixeuil : “Parameterizable Byzantine Broadcast in Loosely Connected Networks”, (2012)
  • S. Dubois, M. Potop‑Butucaru, M. Nesterenko, S. Tixeuil : “Self-stabilizing byzantine asynchronous unison”, Journal of Parallel and Distributed Computing, vol. 72 (7), pp. 917-923, (Elsevier) (2012)
• 2011
  • A. Maurer, S. Tixeuil : “Limiting Byzantine Influence in Multihop Asynchronous Networks”, (2011)
  • S. Dubois, S. Tixeuil : “A Taxonomy of Daemons in Self-stabilization”, (2011)
  • F. Bonnet, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction”, (2011)
  • M. Gradinariu Potop‑Butucaru, M. Raynal, S. Tixeuil : “Distributed Computing with Mobile Robots: an Introductory Survey”, NBiS 2011 - 14^th International Conference on Network-Based Information Systems, Tirana, Albania, pp. 318-324, (IEEE) (2011)
  • T. Izumi, Z. Bouzid, S. Tixeuil, K. Wada : “Brief Announcement: The BG-simulation for Byzantine Mobile Robots”, Proceedings of DISC 2011, vol. 6950, Lecture Notes in Computer Science, Roma, Italy, pp. 330-331, (Springer Berlin / Heidelberg) (2011)
  • Sh. Dolev, S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Stabilizing data-link over non-FIFO channels with optimal fault-resilience”, Information Processing Letters, vol. 111 (18), pp. 912-920, (Elsevier) (2011)
  • S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Dynamic FTSS in asynchronous systems: The case of unison”, Theoretical Computer Science, vol. 412 (29), pp. 3418-3439, (Elsevier) (2011)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection”, Proceedings of Sirocco 2011, Gdansk, Poland, pp. 150-161, (Springer Berlin / Heidelberg) (2011)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection”, (2011)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Maximum Metric Spanning Tree made Byzantine Tolerant”, 32 pages (2011)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Self-Stabilization, Byzantine Containment, and Maximizable Metrics: Necessary Conditions”, 17 pages (2011)
  • M. Nesterenko, S. Tixeuil : “Ideal Stabilization”, Proceedings of IEEE AINA 2011, Biopolis, Singapore, pp. 224-231, (IEEE Press) (2011)
  • F. Bonnet, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction”, OPODIS 2011 - 15^th International Conference on Principles of Distributed Systems, vol. 7109, Lecture Notes in Computer Science, Toulouse, France, pp. 251-265, (Springer) (2011)
  • N. Alon, H. Attiya, Sh. Dolev, S. Dubois, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Pragmatic Self-Stabilization of Atomic Memory in Message-Passing Systems”, SSS 2011 - 13^th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 6976, Lecture Notes in Computer Science, Grenoble, France, pp. 19-31, (Springer) (2011)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Maximum Metric Spanning Tree made Byzantine Tolerant”, DISC 2011 - 25^th International Symposium on Distributed Computing, vol. 6950, Lecture Notes in Computer Science, Rome, Italy, pp. 150-164, (Springer) (2011)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
  • Sh. Dolev, S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Communication Optimalement Stabilisante sur Canaux non Fiables et non FIFO”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
  • F. Manne, M. Mjelde, L. Pilard, S. Tixeuil : “A self-stabilizing 2/3-approximation algorithm for the maximum matching problem”, Theoretical Computer Science, vol. 412 (40), pp. 5515-5526, (Elsevier) (2011)
  • S. Delaët, P. Mandal, M. Rokicki, S. Tixeuil : “Deterministic Secure Positioning in Wireless Sensor Networks”, Theoretical Computer Science, vol. 412 (35), pp. 4471-4481, (Elsevier) (2011)
  • S. Devismes, A. Lamani, F. Petit, P. Raymond, S. Tixeuil : “Optimal grid exploration by asynchronous oblivious robots”, (2011)
  • N. Mitton, B. Sericola, S. Tixeuil, E. Fleury, I. Guerin‑Lassous : “Self-stabilization in Self-organized Multihop Wireless Networks”, Ad Hoc & Sensor Wireless Networks, vol. 11 (1-2), pp. 1-34, (PKP Publishing ServicesNetwork) (2011)
  • S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection”, Structural Information and Communication Complexity - 18^th International Colloquium, vol. 6796, Lecture Notes in Computer Science, Gdansk, Poland, Poland, pp. 150-161, (Springer) (2011)
• 2010
  • Y. Yamauchi, S. Tixeuil : “Monotonic Stabilization”, Proceedings of OPODIS 2010, vol. 6490, Lecture Notes in Computer Science, Tozeur, Tunisia, pp. 475-490, (Springer Berlin / Heidelberg) (2010)
  • Z. Bouzid, Sh. Dolev, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Robocast: Asynchronous Communication in Robot Networks”, Proceedings of OPODIS 2010, Tozeur, Tunisia, pp. 16-31, (Springer Berlin / Heidelberg) (2010)
  • S. Delaët, S. Devismes, M. Nesterenko, S. Tixeuil : “Snap-Stabilization in Message-Passing Systems”, Journal of Parallel and Distributed Computing, vol. 70 (12), pp. 1220-1230, (Elsevier) (2010)
  • Sh. Dolev, S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Stabilizing data-link over non-FIFO channels with optimal fault-resilience”, (2010)
  • A. Asim, S. Tixeuil : “Advanced Faults Patterns for WSN Dependability Benchmarking”, Proceedings of the 13^th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems, MSWiM 2010, Bodrum, Türkiye, pp. 39-48, (ACM) (2010)
  • F. Lesueur, A. Rezmerita, Th. Hérault, S. Peyronnet, S. Tixeuil : “SAFE-OS: a Secure and Usable Desktop Operating System”, Proceedings of CRiSIS 2010, Montréal, Canada, pp. 1-7, (IEEE) (2010)
  • S. Bernard, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “A Framework for Secure and Private P2P Publish/Subscribe”, 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. 531-545, (Springer) (2010)
  • N. Alon, H. Attiya, Sh. Dolev, S. Dubois, M. Gradinariu, S. Tixeuil : “Brief Announcement: Sharing Memory in a Self-stabilizing Manner”, 24^th International Symposium Distributed Computing DISC, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 525-527, (Springer) (2010)
  • T. Izumi, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility”, SSS, vol. 6366, Lecture Notes in Computer Science, New York, NY, United States, pp. 319-331, (Springer) (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “On Byzantine Containment Properties of the min+1 Protocol”, 12^th International Symposium Stabilization, Safety, and Security of Distributed Systems, SSS, New York, NY, United States, pp. 96-110, (Springer Berlin / Heidelberg) (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “The Impact of Topology on Byzantine Containment in Stabilization”, 24^th International Symposium Distributed Computing DISC, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 495-509, (Springer) (2010)
  • S. Kamei, H. Kakugawa, S. Devismes, S. Tixeuil : “A Self-Stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks”, Proceedings of COCOON 2010, vol. 6196, Lecture Notes in Computer Science, Na Thrang, Viet Nam, pp. 80-89, (Springer) (2010)
  • Y. Yamauchi, S. Tixeuil : “Brief Announcement: Monotonic Stabilization”, Proceedings of the 29^th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC'10, Zurich, Switzerland, pp. 406-407, (ACM Press) (2010)
  • Z. Bouzid, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Optimal Byzantine-resilient Convergence in Unidimensional Robot Networks”, Theoretical Computer Science, vol. 411 (34-36), pp. 3154-3168, (Elsevier) (2010)
  • T. Masuzawa, S. Tixeuil : “Stabilizing Locally Maximizable Tasks in Unidirectional Networks is Hard”, IEEE 30^th International Conference on Distributed Computing Systems, ICDCS 2010, Gênes, Italy, pp. 718-727, (IEEE) (2010)
  • A. Asim, S. Tixeuil : “XS-WSNet : Extreme-scale Wireless Sensor Simulation”, IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, WoWMoM 2010, Montreal, Canada, pp. 1-9, (IEEE) (2010)
  • L. Blin, S. Rovedakis, M. Potop‑Butucaru, S. Tixeuil : “Universal Loop-Free Super-Stabilization”, (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “On Byzantine Containment Properties of the $min+1$ Protocol”, (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Bounding the Impact of Unbounded Attacks in Stabilization”, 20 pages (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “The Impact of Topology on Byzantine Containment in Stabilization”, 18 pages (2010)
  • Z. Bouzid, Sh. Dolev, M. Potop‑Butucaru, S. Tixeuil : “RoboCast: Asynchronous Communication in Robot Networks”, (2010)
  • L. Blin, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Exclusive perpetual ring exploration without chirality”, 17 pages (2010)
  • N. Mitton, K. Paroux, B. Sericola, S. Tixeuil : “Ascending runs in dependent uniformly distributed random variables: Application to wireless networks”, Methodology and Computing in Applied Probability, vol. 12 (1), pp. 51-62, (Springer Verlag) (2010)
  • T. Masuzawa, S. Tixeuil : “Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs”, Theoretical Computer Science, vol. 411 (14-15), pp. 1567-1582, (Elsevier) (2010)
  • S. Bernard, S. Devismes, K. Paroux, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks”, 11^th International Conference on Distributed Computing and Networking, ICDCN 2010, vol. 5935, Lecture Notes in Computer Science, Kolkata, India, pp. 167-177, (Springer) (2010)
  • S. Dubois, M. Gradinariu Potop‑Butucaru, M. Nesterenko, S. Tixeuil : “Self-stabilizing Byzantine Asynchronous Unison”, OPODIS 2010 - 14^th International Conference On Principles Of DIstributed Systems, vol. 6490, Lecture Notes in Computer Science, Tozeur, Tunisia, pp. 83-86, (Springer) (2010)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “Loop-Free Super-Stabilizing Spanning Tree Construction”, 12^th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), vol. 6366, Lecture Notes in Computer Science, New York, NY, United States, pp. 50-64 (2010)
  • L. Blin, A. Milani, M. Potop‑Butucaru, S. Tixeuil : “Exclusive Perpetual Ring Exploration without Chirality”, DISC 2010 - 24^th International Symposium Distributed Computing, vol. 6343, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 312-327, (Springer) (2010)
  • S. Devismes, T. Masuzawa, S. Tixeuil : “Communications Efficaces et Auto-Stabilisation”, 12^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle-Dune, France, pp. id 19 (2010)
  • S. Dubois, T. Masuzawa, S. Tixeuil : “Construction auto-stabilisante d’arbre couvrant en dépit d’actions malicieuses”, 12^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Belle Dune, France (2010)
  • A. Lamani, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots”, 17^th International Colloquium Structural Information and Communication Complexity, SIROCCO, vol. 6058, Lecture Notes in Computer Science, Şirince, Türkiye, pp. 183-196, (Springer) (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
  • Z. Bouzid, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Byzantine Convergence in Robots Networks: The Price of Asynchrony”, Proceedings of OPODIS 2009, vol. 5923, Lecture Notes in Computer Science, Nimes, France, pp. 54-70, (Springer) (2009)
  • M. Nesterenko, S. Tixeuil : “Discovering Network Topology in the Presence of Byzantine Nodes”, IEEE Transactions on Parallel and Distributed Systems, vol. 20 (12), pp. 1777-1789, (Institute of Electrical and Electronics Engineers) (2009)
  • Z. Bouzid, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks”, Proceedings of SSS 2009., vol. 5873, Lecture Notes in Computer Science, Lyon, France, pp. 165-179, (Springer) (2009)
  • L. Blin, M. Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A new self-stabilizing minimum spanning tree construction with loop-free property”, 23^rd International Symposium on Distributed Computing (DISC 2009), vol. 5805, Lecture Notes in Computer Science, Elche, Spain, pp. 407-422 (2009)
  • S. Dubois, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison”, 23^rd International Symposium on Distributed Computing, DISC 2009, vol. 5805, Lecture Notes in Computer Science, Elche, Spain, pp. 291-293, (Springer) (2009)
  • S. Devismes, T. Masuzawa, S. Tixeuil : “Communication Efficiency in Self-Stabilizing Silent Protocols”, Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS 2009), Montreal, Canada, pp. 474-481, (IEEE) (2009)
  • S. Bernard, S. Devismes, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks”, IPDPS, Rome, Italy, pp. 1-8, (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)
  • F. Manne, M. Mjelde, L. Pilard, S. Tixeuil : “A New Self-Stabilizing Maximal Matching Algorithm”, Theoretical Computer Science, vol. 410 (14), pp. 1336-1345, (Elsevier) (2009)
  • Z. Bouzid, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Byzantine-Resilient Convergence in Oblivious Robot Networks”, ICDCN, vol. 5408, Lecture Notes in Computer Science, Hyderabad, India, pp. 275-280, (Springer) (2009)
  • S. Delaët, S. Devismes, M. Nesterenko, S. Tixeuil : “Snap-Stabilization in Message-Passing Systems”, International Conference on Distributed Computing and Networking (ICDCN 2009), vol. 5408, Lecture Notes in Computer Science, Hyderabad, India, pp. 281-286, (Springer) (2009)
  • T. Masuzawa, S. Tixeuil : “On Bootstrapping Topology Knowledge in Anonymous Networks”, ACM Transactions on Autonomous and Adaptive Systems, vol. 4 (1), pp. 8, (Association for Computing Machinery (ACM)) (2009)
  • P. Danturi, S. Tixeuil : “Self-stabilizing Philosophers with Generic Conflicts”, ACM Transactions on Autonomous and Adaptive Systems, vol. 4 (1), pp. 7, (Association for Computing Machinery (ACM)) (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)
  • S. Delaët, S. Devismes, M. Nesterenko, S. Tixeuil : “Stabilisation instantanée dans les systèmes à passage de messages”, 11^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Carry-Le-Rouet, France (2009)
  • S. Bernard, S. Devismes, K. Paroux, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes”, 11^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Carry-Le-Rouet, France (2009)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Rovedakis, S. Tixeuil : “A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property”, (2009)
  • Z. Bouzid, M. Potop‑Butucaru, S. Tixeuil : “Byzantine Convergence in Robots Networks: The Price of Asynchrony”, 22 pages (2009)
  • S. Dubois, M. Potop‑Butucaru, S. Tixeuil : “Dynamic FTSS in Asynchronous Systems: the Case of Unison”, 34 pages (2009)
  • M. Nesterenko, S. Tixeuil : “Ideal Stabilization”, 15 pages (2009)
  • Z. Bouzid, M. Potop‑Butucaru, S. Tixeuil : “Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks”, 15 pages (2009)
  • Z. Bouzid, M. Potop‑Butucaru, S. Tixeuil : “Optimal byzantine resilient convergence in oblivious robot networks”, 15 pages (2009)
  • A. Lamani, M. Potop‑Butucaru, S. Tixeuil : “Optimal deterministic ring exploration with oblivious asynchronous robots”, 23 pages (2009)
  • S. Devismes, F. Petit, S. Tixeuil : “Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots”, 29 pages (2009)
  • H. Kakugawa, S. Tixeuil : “Reliability, Availibility, and Security, 2^nd International Workshop (WRAS 2009)”, (2009)
  • S. Tixeuil : “Self-stabilizing Algorithms”, chapitre de Algorithms and theory of computation handbook, pp. 26.1-26.45, (Chapman & Hall/CRC) (2009)
  • S. Dubois, M. Gradinariu Potop‑Butucaru, M. Nesterenko, S. Tixeuil : “Self-Stabilizing Byzantine Asynchronous Unison”, 15 pages (2009)
  • T. Masuzawa, S. Tixeuil : “Stabilizing Maximal Independent Set in Unidirectional Networks is Hard”, 21 pages (2009)
• 2008
  • F. Manne, M. Mjelde, L. Pilard, S. Tixeuil : “A self-stabilizing 2/3-approximation algorithm for the maximum matching problem”, International Conference on Stabilization, Safety, and Security (SSS 2008), vol. 5340, Lecture Notes in Computer Science, Detroit, MI, United States, pp. 94-108, (Springer) (2008)
  • A. Vora, M. Nesterenko, S. Tixeuil : “Universe Detectors for Sybil Defense in Ad Hoc Wireles Networks”, International Conference on Stabilization, Safety, and Security (SSS 2008), vol. 5340, Lecture Notes in Computer Science, Detroit, MI, United States, pp. 63-78, (Springer) (2008)
  • J. Cohen, A. Dasgupta, S. Ghosh, S. Tixeuil : “An Exercise in Selfish Stabilization”, ACM Transactions on Autonomous and Adaptive Systems, vol. 3 (4), pp. article 15, (Association for Computing Machinery (ACM)) (2008)
  • S. Delaët, S. Devismes, M. Nesterenko, S. Tixeuil : “Brief Announcement: Snap-Stabilization in Message-Passing Systems”, Principles of Distributed Computing (PODC 2008), Toronto, Canada, pp. 443-443, (ACM) (2008)
  • S. Delaët, P. Mandal, M. Rokicki, S. Tixeuil : “Deterministic Secure Positioning in Wireless Sensor Networks”, ACM/IEEE International Conference on Distributed Computing in Sensor Networks (DCOSS 2008), vol. 5067, Lecture Notes in Computer Science, Santorini Island, Greece, pp. 469-477, (Springer) (2008)
  • T. Masuzawa, S. Tixeuil : “Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs”, 15^th International Colloquium on Structural Information and Communication Complexity (Sirocco 2008), vol. 5058, Lecture Notes in Computer Science, Villars-sur-Ollon, Switzerland, pp. 247-261, (Springer) (2008)
  • S. Devismes, S. Tixeuil, M. Yamashita : “Weak vs. Self vs. Probabilistic Stabilization”, IEEE International Conference on Distributed Computing Systems (ICDCS 2008), Beijing, China, pp. 681-688, (IEEE) (2008)
  • T. Masuzawa, S. Tixeuil : “Strong Stabilization: Bounding Times Affected by Byzantine Processes in Stabilization”, Asian Association for Algorithms and Computation annual meeting (AAAC 2008), Pokfulam, Hong Kong (2008)
  • D. Simplot‑Ryl, S. Tixeuil : “Algotel 2008”, ALGOTEL 2008 - Dixièmes rencontres francophones sur les aspects algorithmiques de télécommunications (2008)
  • S. Bernard, S. Devismes, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “Bounds for self-stabilization in unidirectional networks”, 24 pages (2008)
  • S. Devismes, T. Masuzawa, S. Tixeuil : “Communication Efficiency in Self-stabilizing Silent Protocols”, 33 pages (2008)
  • W. Hoarau, S. Tixeuil, N. Rodrigues, D. Sousa, L. Silva : “Dependability Evaluation of The Ogsa-Dai Middleware”, chapter in Achievements in European Research on Grid Systems, pp. 223-236, (Springer Berlin / Heidelberg), (ISBN: 978-0-387-72811-7) (2008)
  • Theodore P. Baker, A. Bui, S. Tixeuil : “OPODIS 2008”, vol. 5401, Theoretical Computer Science and General Issues, (Springer) (2008)
  • T. Masuzawa, S. Tixeuil : “Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs”, 20 pages (2008)
  • S. Delaët, S. Devismes, M. Nesterenko, S. Tixeuil : “Snap-Stabilization in Message-Passing Systems”, 29 pages (2008)
  • A. Vora, M. Nesterenko, S. Tixeuil, S. Delaët : “Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks”, 31 pages (2008)
  • N. Mitton, K. Paroux, B. Sericola, S. Tixeuil : “Ascending runs in dependent uniformly distributed random variables : Application to wireless networks”, 12 pages (2008)
  • N. Mitton, K. Paroux, B. Sericola, S. Tixeuil : “Ascending runs in dependent uniformly distributed random variables: Application to wireless networks”, 12 pages (2008)
• 2007
  • T. Masuzawa, S. Tixeuil : “Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults”, International Journal of Principles and Applications of Information Science and Technology, vol. 1 (1), pp. 1-13 (2007)
  • M. Gradinariu, S. Tixeuil : “Conflict Managers for Self-stabilization without Fairness Assumption”, 27^th International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, pp. 46, (IEEE) (2007)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “On the Self-stabilization of Mobile Robots in Graphs”, OPODIS 2007 - 11^th International Conference on Principles of Distributed Systems, vol. 4878, Lecture Notes in Computer Science, Guadeloupe, France, pp. 301-314, (Springer) (2007)
  • S. Delaët, P. Mandal, M. Rokicki, S. Tixeuil : “Deterministic Secure Positioning in Wireless Sensor Networks”, 31 pages (2007)
  • S. Tixeuil : “Fault-tolerant Distributed Algorithms for Scalable Systems”, chapter in Wireless Ad Hoc and Sensor Networks, pp. 225-256, (ISTE), (ISBN: 9781848210035) (2007)
  • L. Blin, M. Gradinariu Potop‑Butucaru, S. Tixeuil : “On the Self-stabilization of Mobile Robots in Graphs”, 23 pages (2007)
  • T. Masuzawa, S. Tixeuil : “Reliability, Availibility, and Security, 1^st International Workshop, WRAS 2007, Paris, France, November 16, 2007, Proceedings”, (Univ. Paris 6) (2007)
  • T. Masuzawa, S. Tixeuil : “Stabilization, Safety, and Security of Distributed Systems, 9^th International Symposium, SSS 2007, Paris, France, November 14-16, 2007, Proceedings”, vol. 4838, Theoretical Computer Science and General Issues, (Springer) (2007)
  • S. Devismes, S. Tixeuil, M. Yamashita : “Weak vs. Self vs. Probabilistic Stabilization”, (2007)
  • F. Greve, S. Tixeuil : “Connaissance vs. Synchronie pour l’Accord Tolérant aux Pannes dans les Réseaux Inconnus”, 9^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Ile d'Oléron, France, pp. 67-70 (2007)
  • F. Manne, M. Mjelde, L. Pilard, S. Tixeuil : “A New Self-Stabilizing Maximal Matching Algorithm”, 17 pages (2007)
• 2006
  • M. Cadilhac, Th. Hérault, R. Lassaigne, S. Peyronnet, S. Tixeuil : “Evaluating complex MAC protocols for sensor networks with APMC”, Automatic Verification of Critical Systems, Nancy, France, pp. 35-47 (2006)
  • N. Mitton, E. Fleury, I. Guerin‑Lassous, B. Sericola, S. Tixeuil : “Fast Convergence in Self-stabilizing Wireless Networks.”, 12^th International Conference on Parallel and Distributed Systems (ICPADS 2006), 12-15 July 2006, Minneapolis, Minnesota, USA, Minneapolis, United States, pp. 31-38 (2006)
  • N. Mitton, E. Fleury, I. Guerin‑Lassous, B. Sericola, S. Tixeuil : “Etude de convergence dans les réseaux sans fil”, 8^emes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Trégastel, France (2006)
  • Th. Hérault, W. Hoarau, P. Lemarinier, E. Rodriguez, S. Tixeuil : “FAIL-MPI: How fault-tolerant is fault-tolerant MPI ?”, 26 pages (2006)
  • W. Hoarau, S. Tixeuil, F. Vauchelles : “Easy fault injection and stress testing with FAIL-FCI”, 20 pages (2006)
  • F. Greve, S. Tixeuil : “Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks”, 32 pages (2006)
  • S. Delaët, B. Ducourthial, S. Tixeuil : “Self-stabilization with r-operators revisited”, Journal of Aerospace Computing, Information, and Communication, vol. 3 (10), pp. 498-514, (American Institute of Aeronautics and Astronautics) (2006)
  • P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, S. Tixeuil : “The Reduced Automata Technique for Graph Exploration Space Lower Bounds”, chapitre de Essays in Memory of Shimon Even, Lecture Notes in Computer Science, pp. volumelncs3895,pages1-26, (Springer Berlin / Heidelberg) (2006)
  • S. Delaët, B. Ducourthial, S. Tixeuil : “Self-stabilization with r-operators revisited”, Journal of Aerospace Computing, Information, and Communication, vol. 10 3, pp. 498-514, (ISBN: 1542-9423) (2006)
  • S. Tixeuil, W. Hoarau, L. Silva : “An Overview of Existing Tools for Fault-Injection and Dependability Benchmarking in Grids”, Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, Paris, France (2006)
  • W. Hoarau, S. Tixeuil, N. Moreno, D. Sousa, L. Silva : “Benchmarking the OGSA-DAI Middleware”, Second Coregrid Integration Workshop, Krakow, Poland (2006)
  • T. Masuzawa, S. Tixeuil : “Bounding the Impact of Unbounded Attacks in Stabilization”, SSS, pp. 440-453 (2006)
  • M. Nesterenko, S. Tixeuil : “Discovering Network Topology in the Presence of Byzantine Nodes”, Prooceedings of Sirocco 2006, Chester, UK, pp. 212-226, (Springer Verlag) (2006)
  • W. Hoarau, S. Tixeuil : “Easy fault injection and stress testing with FAIL-FCI”, Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, Paris, France (2006)
  • W. Hoarau, S. Tixeuil, F. Vauchelles : “Fault Injection in Distributed Java Applications”, International Workshop on Java for Parallel and Distributed Computing (joint with IPDPS 2006), Greece, (IEEE) (2006)
  • T. Masuzawa, S. Tixeuil : “On Bootstrapping Topology Knowledge in Anonymous Networks”, SSS, pp. 454-468 (2006)
  • N. Mitton, E. Fleury, I. Guérin‑Lassous, B. Séricola, S. Tixeuil : “On Fast Randomized Colorings in Sensor Networks”, Proceedings of ICPADS 2006, pp. 31-38, (IEEE Press) (2006)
  • P. Danturi, M. Nesterenko, S. Tixeuil : “Self-stabilizing Philosophers with Generic Conflicts”, SSS, pp. 214-230 (2006)
  • A. Dasgupta, S. Ghosh, S. Tixeuil : “Selfish Stabilization”, SSS, pp. 231-243 (2006)
  • S. Tixeuil : “Réseaux mobiles ad hoc et réseaux de capteurs sans fils”, pp. 251-284, (Lavoisier), (ISBN: 978-2746212923) (2006)
  • P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, S. Tixeuil : “Shimon Even Festschrift”, vol. 3895, pp. 1-26, (Springer-Verlag Berlin Heidelberg), (ISBN: 3-540-32880-7) (2006)
  • W. Hoarau, L. Silva, S. Tixeuil : “An Overview of Existing Tools for Fault-Injection and Dependability Benchmarking in Grids”, n°0041, LIP6 (2006)
  • W. Hoarau, S. Tixeuil, N. Rodrigues, D. Sousa, L. Silva : “Benchmarking the OGSA-DAI Middleware”, n°0060, LIP6 (2006)
  • M. Nesterenko, S. Tixeuil : “Bounds on Topology Discovery in the Presence of Byzantine Faults”, n°TR-KSU-CS-2006-01, LIP6 (2006)
  • M. Gradinariu, S. Tixeuil : “Conflict Managers for Self-stabilization without Fairness Assumption”, n°1459, LIP6 (2006)
  • Th. Hérault, W. Hoarau, P. Lemarinier, E. Rodriguez, S. Tixeuil : “FAIL-MPI: How fault-tolerant is fault-tolerant MPI?”, n°1450, LIP6 (2006)
  • S. Tixeuil : “Vers l’Auto-stabilisation des Systèmes à Grande Echelle”, Orsay, France, LIP6 (2006)
• 2005
  • T. Herman, S. Tixeuil : “Self-stabilizing Systems”, (Springer) (2005)
  • N. Mitton, E. Fleury, I. Guerin‑Lassous, S. Tixeuil : “Self-stabilization in self-organized multihop wireless networks”, 25^th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 6-10 June 2005, Columbus, OH, USA, Columbus, United States, pp. 909-915 (2005)
  • N. Mitton, E. Fleury, I. Guerin‑Lassous, S. Tixeuil : “Auto-stabilisation dans les réseaux ad hoc.”, 7^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), Presqu'ile de giens, France (2005)
  • P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, S. Tixeuil : “Space Lower Bounds for Graph Exploration via Reduced Automata”, Proceedings of the 12^th International Colloquium on Structural Information and Communication Complexity, vol. 3499, Lecture Notes in Computer Science, Le Mont Saint-Michel, France, pp. 140-154, (Springer Berlin / Heidelberg) (2005)
  • W. Hoarau, S. Tixeuil : “A language-driven tool for fault injection in distributed applications”, Proceedings of the IEEE/ACM Workshop GRID 2005, Seattle, United States (2005)
  • Y. Chen, A. Datta, S. Tixeuil : “Stabilizing Inter-domain Routing in the Internet”, Journal of High Speed Networks, vol. 1 14, pp. 21-37 (2005)
  • T. Masuzawa, S. Tixeuil : “A Self-stabilizing Link Coloring Algorithm Resilient to Unbounded Byzantine Faults in Arbitrary Networks”, Proceedings of the International Conference On Principles Of DIstributed Systems (OPODIS 2005), Pisa, Italy, pp. 118-129, (Springer-Verlag) (2005)
  • S. Tixeuil, L. Silva, W. Hoarau, G. Jesus, J. Bento, F. Telles : “Fault-Injection and Dependability Benchmarking for Grid Computing Middleware”, Proceedings of CoreGrid Integration Workshop (2005)
  • N. Mitton, E. Fleury, I. Guérin‑Lassous, S. Tixeuil : “Self-stabilization in Self-organized Wireless Multihop Networks”, Proceedings of the 25^th IEEE International Conference on Distributed Computing Systems Workshops (WWAN'05), Columbus, Ohio, USA, pp. 909-915, (IEEE Press) (2005)
  • S. Delaët, B. Ducourthial, S. Tixeuil : “Self-stabilization with r-Operators Revisited”, Self-Stabilizing Systems, pp. 68-80 (2005)
  • T. Masuzawa, S. Tixeuil : “A Self-Stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks”, n°1396, LIP6 (2005)
  • M. Nesterenko, S. Tixeuil : “Discovering Network Topology in the Presence of Byzantine Nodes”, n°TR-KSU-CS-2005-1 (2005)
  • W. Hoarau, S. Tixeuil, F. Vauchelles : “Fault Injection in Distributed Java Applications”, n°1420, Université Paris Sud, LIP6 (2005)
  • N. Mitton, E. Fleury, I. Guérin‑Lassous, B. Séricola, S. Tixeuil : “On Fast Randomized Colorings in Sensor Networks”, n°1416, Université Paris Sud (2005)
  • P. Danturi, M. Nesterenko, S. Tixeuil : “Self-stabilizing Philosophers with Generic Conflicts”, n°TR-KSU-CS-2005-05, LIP6 (2005)
• 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)
  • Ph. Duchon, N. Hanusse, S. Tixeuil : “Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings”, Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings, Netherlands, pp. 216-229, (Guerraoui, Rachid) (2004)
  • Ph. Duchon, N. Hanusse, S. Tixeuil : “Protocoles auto-stabilisants synchrones d’exclusion mutuelle pour les anneaux anonymes et uniformes”, Protocoles auto-stabilisants synchrones d'exclusion mutuelle pour les anneaux anonymes et uniformes, France, pp. 135-140 (2004)
  • C. Johnen, F. Petit, S. Tixeuil : “Auto-stabilisation et Protocoles Réseaux”, Technique et Science Informatiques, vol. 8 23, pp. 1027-1056, (ISBN: 0752-4072) (2004)
  • A. Datta, M. Gradinariu, S. Tixeuil : “Self-stabilizing Mutual Exclusion with Arbitrary Scheduler”, The Computer Journal, vol. 3 47, pp. 289-298, (ISBN: 0010-4620) (2004)
  • T. Herman, S. Tixeuil : “A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks”, First Workshop on Algorithmic Aspects of Wireless Sensor Networks (AlgoSensors'2004), vol. 3121, Turku, Finland, pp. 45-58, (Springer-Verlag) (2004)
  • T. Herman, S. Tixeuil : “Un Algorithme TDMA Réparti pour les réseaux de capteurs”, Proceedings of Rencontres Francophones sur l'Algorithmique des Communications (Algotel'2004), Batz sur Mer, France (2004)
  • Ph. Duchon, N. Hanusse, S. Tixeuil : “Optimal self-stabilizing mutual exclusion on synchronous rings”, n°1389, Laboratoire de Recherche en Informatique, LIP6 (2004)
  • N. Mitton, E. Fleury, I. Guérin‑Lassous, S. Tixeuil : “Self-stabilization in Self-organized Wireless Multihop Networks”, n°5426, LIP6 (2004)
• 2003
  • B. Ducourthial, S. Tixeuil : “Self-stabilization with Path Algebra”, Theoretical Computer Science, vol. 293 (1), pp. 219-236, (Elsevier) (2003)
• 2001
  • B. Ducourthial, S. Tixeuil : “Self-stabilization with r-operators”, Distributed Computing, vol. 14 (3), pp. 147-162, (Springer Verlag) (2001)
• 2000
  • M. Gradinariu, S. Tixeuil : “Self-stabilizing Vertex Coloring of Arbitrary Graphs”, Proceedings of OPODIS 2000, Paris, France, pp. 55-70 (2000)
• 1999
  • Sajal K. Das, A. Datta, S. Tixeuil : “Self-Stabilizing Algorithms in DAG Structured Networks”, Parallel Processing Letters, vol. 9 (4), pp. 563-574, (World Scientific Publishing) (1999)
• 1998
  • L. Alima, J. Beauquier, A. Datta, S. Tixeuil : “Self-stabilization with Global Rooted Synchronizers”, Proceedings of the International Conference on Distributed Computing Systems (ICDCS 98), Amsterdam, Netherlands, pp. 102-109 (1998)