Sébastien Tixeuil

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 152

Top Venues

University of Paris-Sud, Orsay, France (PHD)

Education History

University of Paris-Sud, Orsay, France

PHD

Publications

Sayaka Kamei, Sébastien Tixeuil
An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids. Comput. J. 67 (1) (2024)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand up indulgent gathering. Theor. Comput. Sci. 939 (2023)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines. CoRR (2023)
Maxime Dresler, Sanaï Mansour, Safaâ Talhaoui, Yukiko Yamauchi, Sébastien Tixeuil
On Dynamics of Basic Network Creation Games with Non-Uniform Communication Interest. CANDARW (2023)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
The agreement power of disagreement. Theor. Comput. Sci. 954 (2023)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Gathering. CoRR (2023)
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics Auton. Syst. 163 (2023)
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. CoRR (2023)
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil
Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps. Theor. Comput. Sci. 942 (2023)
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil
Meeting Times of Non-atomic Random Walks. SSS (2023)
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
Offline Constrained Backward Time Travel Planning. SSS (2023)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines. SSS (2023)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Reliable Broadcast despite Mobile Byzantine Faults. CoRR (2023)
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil
Meeting Times of Non-atomic Random Walks. CoRR (2023)
Keisuke Okumura, Sébastien Tixeuil
Fault-Tolerant Offline Multi-Agent Path Planning. AAAI (2023)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Reliable Broadcast Despite Mobile Byzantine Faults. OPODIS (2023)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS (2023)
Masahiro Shibata, Sébastien Tixeuil
Semi-uniform deployment of mobile robots in perfect ℓ $$ \ell $$ -ary trees. Concurr. Comput. Pract. Exp. 35 (19) (2023)
Fukuhito Ooshita, Sébastien Tixeuil
Ring exploration with myopic luminous robots. Inf. Comput. 285 (Part) (2022)
Sébastien Tixeuil
Realistic Self-Stabilization (Invited Talk). OPODIS (2022)
Keisuke Okumura, Sébastien Tixeuil
Fault-Tolerant Offline Multi-Agent Path Planning. CoRR (2022)
Fabien Mathieu, Sébastien Tixeuil
Fun with FUN. FUN (2022)
Joseph Oglio, Kendric Hood, Mikhail Nesterenko, Sébastien Tixeuil
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator. CoRR (2022)
Solayman Ayoubi, Gregory Blanc, Houda Jmila, Thomas Silverston, Sébastien Tixeuil
Data-Driven Evaluation of Intrusion Detectors: A Methodological Framework. FPS (2022)
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Swarms of Mobile Robots: Towards Versatility with Safety. Leibniz Trans. Embed. Syst. 8 (2) (2022)
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
Constrained Backward Time Travel Planning is in P. CoRR (2022)
Joseph Oglio, Kendric Hood, Mikhail Nesterenko, Sébastien Tixeuil
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator. ApPLIED@PODC (2022)
Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil
Practical Byzantine Reliable Broadcast on Partially Connected Networks. ICDCS (2021)
Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura
Quixo is Solved. ACG (2021)
Adam Heriban, Sébastien Tixeuil
Unreliable Sensors for Reliable Efficient Robots. CoRR (2021)
Adam Heriban, Sébastien Tixeuil
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds. Parallel Process. Lett. 31 (1) (2021)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Computer Aided Formal Design of Swarm Robotics Algorithms. CoRR (2021)
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil
Uniform bipartition in the population protocol model with arbitrary graphs. Theor. Comput. Sci. 892 (2021)
Masahiro Shibata, Sébastien Tixeuil
Semi-Uniform Deployment of Mobile Robots in Perfect $\ell$ -ary Trees. CANDAR (2021)
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
Asynchronous Gathering in a Torus. OPODIS (2021)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Computer Aided Formal Design of Swarm Robotics Algorithms. SSS (2021)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
The Agreement Power of Disagreement. SSS (2021)
Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64 (1) (2021)
Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil
Practical Byzantine Reliable Broadcast on Partially Connected Networks. CoRR (2021)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand up Indulgent Gathering. ALGOSENSORS (2021)
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
Asynchronous Gathering in a Torus. CoRR (2021)
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. OPODIS (2020)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Boosting the Efficiency of Byzantine-Tolerant Reliable Communication. SSS (2020)
Lélia Blin, Sébastien Tixeuil
Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. 144 (2020)
Masahiro Shibata, Sébastien Tixeuil
Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings. SSS (2020)
Sayaka Kamei, Sébastien Tixeuil
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids. CoRR (2020)
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. CoRR (2020)
Yackolley Amoussou-Guenou, Souheib Baarir, Maria Potop-Butucaru, Nathalie Sznajder, Léo Tible, Sébastien Tixeuil
On the Encoding and Solving of Partial Information Games. NETYS (2020)
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. SRDS (2020)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults. NETYS (2020)
Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura
Quixo Is Solved. CoRR (2020)
Lélia Blin, Anaïs Durand, Sébastien Tixeuil
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR (2020)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Rendezvous. CoRR (2020)
Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil
Autonomous Identification of IoT Device Types based on a Supervised Classification. ICC (2020)
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil
Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods Syst. Des. 56 (1) (2020)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Rendezvous. SSS (2020)
Shantanu Das, Sébastien Tixeuil
Special issue on Structural Information and Communication Complexity. Theor. Comput. Sci. 811 (2020)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Multi-hop Byzantine Reliable Broadcast Made Practical. CoRR (2019)
Ulysse Léchine, Sébastien Tixeuil
Asynchronous Scattering. CoRR (2019)
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR (2019)
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. CoRR (2019)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Distributed Online Data Aggregation in Dynamic Graphs. NETYS (2019)
Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS (2019)
Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. Theory Comput. Syst. 63 (2) (2019)
Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil
Autonomous IoT Device Identification Prototype. TMA (2019)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Multi-hop Byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc. 25 (1) (2019)
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil
Approximate Agreement under Mobile Byzantine Faults. Theor. Comput. Sci. 758 (2019)
Adam Heriban, Sébastien Tixeuil
Mobile Robots with Uncertain Visibility Sensors. SIROCCO (2019)
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753 (2019)
Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil
Network-Protocol-Based IoT Device Identification. FMEC (2019)
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. DISC (2019)
Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil
Packet Efficient Implementation of the Omega Failure Detector. Theory Comput. Syst. 63 (2) (2019)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. NETYS (2019)
Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil
Optimal torus exploration by oblivious robots. Computing 101 (9) (2019)
Quentin Bramas, Sébastien Tixeuil
Arbitrary Pattern Formation with Four Robots. SSS (2018)
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil
Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps. SSS (2018)
Adam Heriban, Xavier Défago, Sébastien Tixeuil
Optimally Gathering Two Robots. ICDCN (2018)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Multi-hop Byzantine Reliable Broadcast Made Practical. LADC (2018)
Fukuhito Ooshita, Sébastien Tixeuil
Ring Exploration with Myopic Luminous Robots. SSS (2018)
Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil
Concurrent Geometric Multicasting. ICDCN (2018)
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. SSS (2018)
Taisuke Izumi, Daichi Kaino, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. 738 (2018)
Fukuhito Ooshita, Sébastien Tixeuil
Ring Exploration with Myopic Luminous Robots. CoRR (2018)
Michiko Inoue, Sébastien Tixeuil
Short Paper: Tight Bounds for Universal and Cautious Self-stabilizing 1-Maximal Matching. NETYS (2018)
Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil
A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. ICDCN (2018)
Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil
Churn Possibilities and Impossibilities. NETYS (2018)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. SSS (2018)
Lélia Blin, Sébastien Tixeuil
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Comput. 31 (2) (2018)
Fathiyeh Faghih, Borzoo Bonakdarpour, Sébastien Tixeuil, Sandeep S. Kulkarni
Automated Synthesis of Distributed Self-Stabilizing Protocols. Log. Methods Comput. Sci. 14 (1) (2018)
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. CoRR (2018)
Lélia Blin, Sébastien Tixeuil
Compact Self-Stabilizing Leader Election for General Networks. LATIN (2018)
Lélia Blin, Sébastien Tixeuil
Compact Self-Stabilizing Leader Election for Arbitrary Networks. CoRR (2017)
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil
Optimal Storage under Unsynchronized Mobile Byzantine Faults. SRDS (2017)
Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks. SSS (2017)
Thibaut Balabonski, Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain
Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. FMICS-AVoCS (2017)
Lélia Blin, Sébastien Tixeuil
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC (2017)
Adam Heriban, Xavier Défago, Sébastien Tixeuil
Optimally Gathering Two Robots. CoRR (2017)
Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil
Concurrent Geometric Multicasting. CoRR (2017)
Quentin Bramas, Sébastien Tixeuil
The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255 (2017)
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil
Parameterized Verification of Algorithms for Oblivious Robots on a Ring. CoRR (2017)

Sébastien Tixeuil.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sébastien Tixeuil