default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Tixeuil
Person information
- affiliation: University of Paris-Sud, Laboratory for Computer Science (LRI), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Sayaka Kamei
, Sébastien Tixeuil:
An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids. Comput. J. 67(1): 57-77 (2024)- [j71]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Resource efficient stabilization for local tasks despite unknown capacity links. Theor. Comput. Sci. 1013: 114744 (2024) - [j70]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-up indulgent gathering on lines. Theor. Comput. Sci. 1016: 114796 (2024) - [c191]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. AINA (2) 2024: 110-121 - [c190]Alexandre Pham, Maria Potop-Butucaru, Sébastien Tixeuil, Serge Fdida:
Data Poisoning Attacks in Gossip Learning. AINA (2) 2024: 213-224 - [c189]Shurok Khozam, Gregory Blanc, Sébastien Tixeuil, Eric Totel:
DDoS Mitigation while Preserving QoS: A Deep Reinforcement Learning-Based Approach. NetSoft 2024: 369-374 - [c188]Boris Chan Yip Hon, Bilel Zaghdoudi, Maria Potop-Butucaru, Sébastien Tixeuil, Serge Fdida:
Challenger: Blockchain-based Massively Multiplayer Online Game Architecture. NETYS 2024: 50-66 - [c187]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Online Space-Time Travel Planning in Dynamic Graphs. SAND 2024: 7:1-7:14 - [c186]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. SAND 2024: 25:1-25:5 - [c185]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. SIROCCO 2024: 119-137 - [i95]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. CoRR abs/2402.14233 (2024) - [i94]Alexandre Pham, Maria Potop-Butucaru, Sébastien Tixeuil, Serge Fdida:
Data Poisoning Attacks in Gossip Learning. CoRR abs/2403.06583 (2024) - [i93]Mohamed Amine Legheraba, Maria Potop-Butucaru, Sébastien Tixeuil:
Elevator: Self-* and Persistent Hub Sampling Service in Unstructured Peer-to-Peer Networks. CoRR abs/2406.07946 (2024) - [i92]Boris Chan Yip Hon, Bilel Zaghdoudi, Maria Potop-Butucaru, Sébastien Tixeuil, Serge Fdida:
Challenger: Blockchain-based Massively Multiplayer Online Game Architecture. IACR Cryptol. ePrint Arch. 2024: 726 (2024) - 2023
- [j69]Masahiro Shibata, Sébastien Tixeuil:
Semi-uniform deployment of mobile robots in perfect ℓ $$ \ell $$ -ary trees. Concurr. Comput. Pract. Exp. 35(19) (2023) - [j68]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: 104378 (2023) - [j67]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up indulgent gathering. Theor. Comput. Sci. 939: 63-77 (2023) - [j66]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: 123-141 (2023) - [j65]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The agreement power of disagreement. Theor. Comput. Sci. 954: 113772 (2023) - [c184]Keisuke Okumura, Sébastien Tixeuil:
Fault-Tolerant Offline Multi-Agent Path Planning. AAAI 2023: 11647-11654 - [c183]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: 86-92 - [c182]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast Despite Mobile Byzantine Faults. OPODIS 2023: 18:1-18:23 - [c181]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. SSS 2023: 297-311 - [c180]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS 2023: 380-384 - [c179]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. SSS 2023: 451-465 - [c178]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Offline Constrained Backward Time Travel Planning. SSS 2023: 466-480 - [i91]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Gathering. CoRR abs/2302.03466 (2023) - [i90]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. CoRR abs/2304.05722 (2023) - [i89]Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. CoRR abs/2305.11590 (2023) - [i88]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast despite Mobile Byzantine Faults. CoRR abs/2311.05918 (2023) - [i87]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 abs/2312.12698 (2023) - 2022
- [j64]Fukuhito Ooshita, Sébastien Tixeuil:
Ring exploration with myopic luminous robots. Inf. Comput. 285(Part): 104702 (2022) - [j63]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Swarms of Mobile Robots: Towards Versatility with Safety. Leibniz Trans. Embed. Syst. 8(2): 02:1-02:36 (2022) - [c177]Solayman Ayoubi, Gregory Blanc, Houda Jmila, Thomas Silverston, Sébastien Tixeuil:
Data-Driven Evaluation of Intrusion Detectors: A Methodological Framework. FPS 2022: 142-157 - [c176]Fabien Mathieu, Sébastien Tixeuil:
Fun with FUN. FUN 2022: 21:1-21:13 - [c175]Sébastien Tixeuil:
Realistic Self-Stabilization (Invited Talk). OPODIS 2022: 3:1-3:1 - [c174]Joseph Oglio, Kendric Hood, Mikhail Nesterenko, Sébastien Tixeuil:
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator. ApPLIED@PODC 2022: 40-46 - [i86]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Constrained Backward Time Travel Planning is in P. CoRR abs/2205.03372 (2022) - [i85]Joseph Oglio, Kendric Hood, Mikhail Nesterenko, Sébastien Tixeuil:
QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator. CoRR abs/2205.04930 (2022) - [i84]Keisuke Okumura, Sébastien Tixeuil:
Fault-Tolerant Offline Multi-Agent Path Planning. CoRR abs/2211.13908 (2022) - 2021
- [j62]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): 132-154 (2021) - [j61]Adam Heriban, Sébastien Tixeuil:
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds. Parallel Process. Lett. 31(1): 2150002:1-2150002:21 (2021) - [j60]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform bipartition in the population protocol model with arbitrary graphs. Theor. Comput. Sci. 892: 187-207 (2021) - [c173]Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura:
Quixo is Solved. ACG 2021: 85-95 - [c172]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up Indulgent Gathering. ALGOSENSORS 2021: 17-28 - [c171]Masahiro Shibata, Sébastien Tixeuil:
Semi-Uniform Deployment of Mobile Robots in Perfect $\ell$ -ary Trees. CANDAR 2021: 168-174 - [c170]Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil:
Practical Byzantine Reliable Broadcast on Partially Connected Networks. ICDCS 2021: 506-516 - [c169]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. OPODIS 2021: 9:1-9:17 - [c168]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The Agreement Power of Disagreement. SSS 2021: 273-288 - [c167]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. SSS 2021: 469-473 - [d1]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The agreement power of disagreement: graph generation. Zenodo, 2021
- [i83]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. CoRR abs/2101.05421 (2021) - [i82]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. CoRR abs/2101.06966 (2021) - [i81]Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil:
Practical Byzantine Reliable Broadcast on Partially Connected Networks. CoRR abs/2104.03673 (2021) - [i80]Adam Heriban, Sébastien Tixeuil:
Unreliable Sensors for Reliable Efficient Robots. CoRR abs/2105.09667 (2021) - 2020
- [j59]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): 55-89 (2020) - [j58]Lélia Blin, Sébastien Tixeuil:
Compact self-stabilizing leader election for general networks. J. Parallel Distributed Comput. 144: 278-294 (2020) - [j57]Shantanu Das, Sébastien Tixeuil:
Special issue on Structural Information and Communication Complexity. Theor. Comput. Sci. 811: 1-2 (2020) - [c166]Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil:
Autonomous Identification of IoT Device Types based on a Supervised Classification. ICC 2020: 1-6 - [c165]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: 60-76 - [c164]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults. NETYS 2020: 112-128 - [c163]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. OPODIS 2020: 33:1-33:16 - [c162]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: 113-122 - [c161]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Boosting the Efficiency of Byzantine-Tolerant Reliable Communication. SSS 2020: 29-44 - [c160]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. SSS 2020: 45-59 - [c159]Masahiro Shibata, Sébastien Tixeuil:
Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings. SSS 2020: 264-279 - [i79]Lélia Blin, Anaïs Durand, Sébastien Tixeuil:
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links. CoRR abs/2002.05382 (2020) - [i78]Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura:
Quixo Is Solved. CoRR abs/2007.15895 (2020) - [i77]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. CoRR abs/2010.04400 (2020) - [i76]Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. CoRR abs/2011.08366 (2020) - [i75]Sayaka Kamei, Sébastien Tixeuil:
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids. CoRR abs/2012.03399 (2020)
2010 – 2019
- 2019
- [j56]Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil:
Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019) - [j55]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Multi-hop Byzantine reliable broadcast with honest dealer made practical. J. Braz. Comput. Soc. 25(1): 9:1-9:23 (2019) - [j54]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): 200-218 (2019) - [j53]Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Packet Efficient Implementation of the Omega Failure Detector. Theory Comput. Syst. 63(2): 237-260 (2019) - [j52]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: 80-90 (2019) - [j51]Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil:
Approximate Agreement under Mobile Byzantine Faults. Theor. Comput. Sci. 758: 17-29 (2019) - [c158]Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil:
Network-Protocol-Based IoT Device Identification. FMEC 2019: 204-209 - [c157]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: 93-109 - [c156]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Distributed Online Data Aggregation in Dynamic Graphs. NETYS 2019: 365-380 - [c155]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS 2019: 27:1-27:17 - [c154]Adam Heriban, Sébastien Tixeuil:
Mobile Robots with Uncertain Visibility Sensors. SIROCCO 2019: 349-352 - [c153]Nesrine Ammar, Ludovic Noirie, Sébastien Tixeuil:
Autonomous IoT Device Identification Prototype. TMA 2019: 195-196 - [c152]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: 41:1-41:3 - [p2]Xavier Défago, Maria Potop-Butucaru, Sébastien Tixeuil:
Fault-Tolerant Mobile Robots. Distributed Computing by Mobile Entities 2019: 234-251 - [p1]Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil, Xavier Urbain:
Formal Methods for Mobile Robots. Distributed Computing by Mobile Entities 2019: 278-313 - [e6]Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi:
Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings. Lecture Notes in Computer Science 11914, Springer 2019, ISBN 978-3-030-34991-2 [contents] - [i74]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Multi-hop Byzantine Reliable Broadcast Made Practical. CoRR abs/1903.08988 (2019) - [i73]Ulysse Léchine, Sébastien Tixeuil:
Asynchronous Scattering. CoRR abs/1905.09177 (2019) - [i72]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 abs/1907.09871 (2019) - [i71]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR abs/1911.04757 (2019) - 2018
- [j50]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): 139-166 (2018) - [j49]Fathiyeh Faghih, Borzoo Bonakdarpour, Sébastien Tixeuil, Sandeep S. Kulkarni:
Automated Synthesis of Distributed Self-Stabilizing Protocols. Log. Methods Comput. Sci. 14(1) (2018) - [j48]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: 42-52 (2018) - [c151]Adam Heriban, Xavier Défago, Sébastien Tixeuil:
Optimally Gathering Two Robots. ICDCN 2018: 3:1-3:10 - [c150]Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil:
A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. ICDCN 2018: 5:1-5:10 - [c149]Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil:
Concurrent Geometric Multicasting. ICDCN 2018: 9:1-9:10 - [c148]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Multi-hop Byzantine Reliable Broadcast Made Practical. LADC 2018: 155-160 - [c147]Lélia Blin, Sébastien Tixeuil:
Compact Self-Stabilizing Leader Election for General Networks. LATIN 2018: 161-173 - [c146]Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Churn Possibilities and Impossibilities. NETYS 2018: 303-317 - [c145]Michiko Inoue, Sébastien Tixeuil:
Short Paper: Tight Bounds for Universal and Cautious Self-stabilizing 1-Maximal Matching. NETYS 2018: 334-339 - [c144]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. SSS 2018: 170-185 - [c143]Fukuhito Ooshita, Sébastien Tixeuil:
Ring Exploration with Myopic Luminous Robots. SSS 2018: 301-316 - [c142]Quentin Bramas, Sébastien Tixeuil:
Arbitrary Pattern Formation with Four Robots. SSS 2018: 333-348 - [c141]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: 398-403 - [c140]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: 404-408 - [i70]Fukuhito Ooshita, Sébastien Tixeuil:
Ring Exploration with Myopic Luminous Robots. CoRR abs/1805.03965 (2018) - [i69]Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil:
Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. CoRR abs/1811.01770 (2018) - 2017
- [j47]Quentin Bramas, Sébastien Tixeuil:
The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255: 369-383 (2017) - [j46]Quentin Bramas, Sébastien Tixeuil:
The Random Bit Complexity of Mobile Robots Scattering. Int. J. Found. Comput. Sci. 28(2): 111-134 (2017) - [j45]Jordan Adamek, Giovanni Farina, Mikhail Nesterenko, Sébastien Tixeuil:
Evaluating and optimizing stabilizing dining philosophers. J. Parallel Distributed Comput. 109: 63-74 (2017) - [c139]Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil:
Parameterized verification of algorithms for oblivious robots on a ring. FMCAD 2017: 212-219 - [c138]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: 165-181 - [c137]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks. PODC 2017: 411-413 - [c136]Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil:
Stateless Reliable Geocasting. SRDS 2017: 44-53 - [c135]Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil:
Optimal Storage under Unsynchronized Mobile Byzantine Faults. SRDS 2017: 154-163 - [c134]Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks. SSS 2017: 93-108 - [c133]Lélia Blin, Sébastien Tixeuil:
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. DISC 2017: 43:1-43:3 - [e5]