Sébastien Tixeuil

Orcid: 0000-0002-0948-7172

Affiliations:
  • University of Paris-Sud, Laboratory for Computer Science (LRI), France


According to our database1, Sébastien Tixeuil authored at least 272 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids.
Comput. J., January, 2024

Stand-up indulgent gathering on lines.
Theor. Comput. Sci., 2024

Resource efficient stabilization for local tasks despite unknown capacity links.
Theor. Comput. Sci., 2024

Challenger: Blockchain-based Massively Multiplayer Online Game Architecture.
IACR Cryptol. ePrint Arch., 2024

Elevator: Self-* and Persistent Hub Sampling Service in Unstructured Peer-to-Peer Networks.
CoRR, 2024

Brief Announcement: A Self-* and Persistent Hub Sampling Service.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Stand-Up Indulgent Gathering on Rings.
Proceedings of the Structural Information and Communication Complexity, 2024

Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Online Space-Time Travel Planning in Dynamic Graphs.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

DDoS Mitigation while Preserving QoS: A Deep Reinforcement Learning-Based Approach.
Proceedings of the 10th IEEE International Conference on Network Softwarization, 2024

Data Poisoning Attacks in Gossip Learning.
Proceedings of the Advanced Information Networking and Applications, 2024

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots.
Proceedings of the Advanced Information Networking and Applications, 2024

2023
Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space.
Robotics Auton. Syst., May, 2023

The agreement power of disagreement.
Theor. Comput. Sci., 2023

Stand up indulgent gathering.
Theor. Comput. Sci., 2023

Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps.
Theor. Comput. Sci., 2023

Semi-uniform deployment of mobile robots in perfect ℓ $$ \ell $$ -ary trees.
Concurr. Comput. Pract. Exp., 2023

Meeting Times of Non-atomic Random Walks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Offline Constrained Backward Time Travel Planning.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Reliable Broadcast Despite Mobile Byzantine Faults.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

On Dynamics of Basic Network Creation Games with Non-Uniform Communication Interest.
Proceedings of the Eleventh International Symposium on Computing and Networking, CANDAR 2023, 2023

Fault-Tolerant Offline Multi-Agent Path Planning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Swarms of Mobile Robots: Towards Versatility with Safety.
Leibniz Trans. Embed. Syst., 2022

Ring exploration with myopic luminous robots.
Inf. Comput., 2022

Constrained Backward Time Travel Planning is in P.
CoRR, 2022

QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract Simulator.
Proceedings of the ApPLIED '22: Proceedings of the 2022 Workshop on Advanced tools, 2022

Realistic Self-Stabilization (Invited Talk).
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Fun with FUN.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Data-Driven Evaluation of Intrusion Detectors: A Methodological Framework.
Proceedings of the Foundations and Practice of Security - 15th International Symposium, 2022

2021
The agreement power of disagreement: graph generation.
Dataset, September, 2021

Uniform bipartition in the population protocol model with arbitrary graphs.
Theor. Comput. Sci., 2021

Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds.
Parallel Process. Lett., 2021

Unreliable Sensors for Reliable Efficient Robots.
CoRR, 2021

Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots.
Comput. J., 2021

Computer Aided Formal Design of Swarm Robotics Algorithms.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Asynchronous Gathering in a Torus.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Practical Byzantine Reliable Broadcast on Partially Connected Networks.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Semi-Uniform Deployment of Mobile Robots in Perfect $\ell$ -ary Trees.
Proceedings of the Ninth International Symposium on Computing and Networking, 2021

Quixo is Solved.
Proceedings of the Advances in Computer Games - 17th International Conference, 2021

2020
Special issue on Structural Information and Communication Complexity.
Theor. Comput. Sci., 2020

Compact self-stabilizing leader election for general networks.
J. Parallel Distributed Comput., 2020

Parameterized verification of algorithms for oblivious robots on a ring.
Formal Methods Syst. Des., 2020

Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links.
CoRR, 2020

Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Stand Up Indulgent Rendezvous.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Boosting the Efficiency of Byzantine-Tolerant Reliable Communication.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults.
Proceedings of the Networked Systems - 8th International Conference, 2020

On the Encoding and Solving of Partial Information Games.
Proceedings of the Networked Systems - 8th International Conference, 2020

Autonomous Identification of IoT Device Types based on a Supervised Classification.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
Formal Methods for Mobile Robots.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Fault-Tolerant Mobile Robots.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Approximate Agreement under Mobile Byzantine Faults.
Theor. Comput. Sci., 2019

On asynchronous rendezvous in general graphs.
Theor. Comput. Sci., 2019

Packet Efficient Implementation of the Omega Failure Detector.
Theory Comput. Syst., 2019

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm.
Theory Comput. Syst., 2019

Multi-hop Byzantine reliable broadcast with honest dealer made practical.
J. Braz. Comput. Soc., 2019

Asynchronous Scattering.
CoRR, 2019

Optimal torus exploration by oblivious robots.
Computing, 2019

Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Autonomous IoT Device Identification Prototype.
Proceedings of the Network Traffic Measurement and Analysis Conference, 2019

Mobile Robots with Uncertain Visibility Sensors.
Proceedings of the Structural Information and Communication Complexity, 2019

Gathering on Rings for Myopic Asynchronous Robots With Lights.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.
Proceedings of the Networked Systems - 7th International Conference, 2019

Network-Protocol-Based IoT Device Identification.
Proceedings of the Fourth International Conference on Fog and Mobile Edge Computing, 2019

2018
On time complexity for connectivity-preserving scattering of mobile robots.
Theor. Comput. Sci., 2018

Automated Synthesis of Distributed Self-Stabilizing Protocols.
Log. Methods Comput. Sci., 2018

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative.
Distributed Comput., 2018

Arbitrary Pattern Formation with Four Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Short Paper: Tight Bounds for Universal and Cautious Self-stabilizing 1-Maximal Matching.
Proceedings of the Networked Systems - 6th International Conference, 2018

Churn Possibilities and Impossibilities.
Proceedings of the Networked Systems - 6th International Conference, 2018

Multi-hop Byzantine Reliable Broadcast Made Practical.
Proceedings of the 8th Latin-American Symposium on Dependable Computing, 2018

Optimally Gathering Two Robots.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Concurrent Geometric Multicasting.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Evaluating and optimizing stabilizing dining philosophers.
J. Parallel Distributed Comput., 2017

The Random Bit Complexity of Mobile Robots Scattering.
Int. J. Found. Comput. Sci., 2017

The complexity of data aggregation in static and dynamic wireless sensor networks.
Inf. Comput., 2017

Optimal Storage under Unsynchrononized Mobile Byzantine Faults.
CoRR, 2017

Compact Self-Stabilizing Leader Election for Arbitrary Networks.
CoRR, 2017

Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Optimal Storage under Unsynchronized Mobile Byzantine Faults.
Proceedings of the 36th IEEE Symposium on Reliable Distributed Systems, 2017

Stateless Reliable Geocasting.
Proceedings of the 36th IEEE Symposium on Reliable Distributed Systems, 2017

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems.
Proceedings of the Critical Systems: Formal Methods and Automated Verification - Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems - and, 2017

2016
Tolerating Random Byzantine Failures in an Unbounded Network.
Parallel Process. Lett., 2016

Formal verification of mobile robot protocols.
Distributed Comput., 2016

Infinite Unlimited Churn.
CoRR, 2016

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots.
CoRR, 2016

Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp.
CoRR, 2016

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property.
Comput. J., 2016

Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Infinite Unlimited Churn (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Brief Announcement: Certified Universal Gathering in R<sup>2</sup> for Oblivious Mobile Robots.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks.
Proceedings of the Networked Systems - 4th International Conference, 2016

Distributed Online Data Aggregation in Dynamic Graphs.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

Stability and optimization of DNS-based request redirection in CDNs.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

Specification-Based Synthesis of Distributed Self-Stabilizing Protocols.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

Enhancing Content Distribution through Information-Aware Mechanisms.
Proceedings of the 5th IEEE International Conference on Cloud Networking, 2016

Asynchronous Gathering in Rings with 4 Robots.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 15th International Conference, 2016

2015
Containing Byzantine Failures with Control Zones.
IEEE Trans. Parallel Distributed Syst., 2015

On the self-stabilization of mobile oblivious robots in uniform rings.
Theor. Comput. Sci., 2015

Practically stabilizing SWMR atomic memory in message-passing systems.
J. Comput. Syst. Sci., 2015

Impossibility of gathering, a certification.
Inf. Process. Lett., 2015

Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization.
Int. J. Found. Comput. Sci., 2015

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots.
CoRR, 2015

Asynchronous Pattern Formation without Chirality.
CoRR, 2015

Stateless Geocasting.
CoRR, 2015

Maximum Metric Spanning Tree Made Byzantine Tolerant.
Algorithmica, 2015

Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures.
Proceedings of the 34th IEEE Symposium on Reliable Distributed Systems, 2015

Wait-Free Gathering Without Chirality.
Proceedings of the Structural Information and Communication Complexity, 2015

On the Optimization of Request Routing for Content Delivery.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

Stabilizing Byzantine-Fault Tolerant Storage.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

WiSeBat: accurate energy benchmarking of wireless sensor networks.
Proceedings of the 2015 Forum on Specification and Design Languages, 2015

Evaluating and Optimizing Stabilizing Dining Philosophers.
Proceedings of the 11th European Dependable Computing Conference, 2015

2014
Gathering fat mobile robots with slim omnidirectional cameras.
Theor. Comput. Sci., 2014

Byzantine broadcast with fixed disjoint paths.
J. Parallel Distributed Comput., 2014

Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults.
CoRR, 2014

On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Self-Stabilizing Byzantine Broadcast.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014

2013
Optimal probabilistic ring exploration by semi-synchronous oblivious robots.
Theor. Comput. Sci., 2013

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks.
J. Comb. Optim., 2013

Ideal stabilisation.
Int. J. Grid Util. Comput., 2013

Parameterizable Byzantine Broadcast in Loosely Connected Networks
CoRR, 2013

On Byzantine Broadcast in Planar Graphs
CoRR, 2013

Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Linearizing Peer-to-Peer Systems with Oracles.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Consensus with Unknown Participants in Shared Memory.
Proceedings of the IEEE 32nd Symposium on Reliable Distributed Systems, 2013

Rigorous Performance Evaluation of Self-Stabilization Using Probabilistic Model Checking.
Proceedings of the IEEE 32nd Symposium on Reliable Distributed Systems, 2013

Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Gathering of Mobile Robots Tolerating Multiple Crash Faults.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

A Scalable Byzantine Grid.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Fast Leader (Full) Recovery Despite Dynamic Faults.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Bounding the Impact of Unbounded Attacks in Stabilization.
IEEE Trans. Parallel Distributed Syst., 2012

Self-stabilizing byzantine asynchronous unison.
J. Parallel Distributed Comput., 2012

Wait-Free Gathering of Mobile Robots
CoRR, 2012

Mariages et Trahisons
CoRR, 2012

Limiting Byzantien Influence in Multihop Asynchronous Networks
CoRR, 2012

Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

On Byzantine Broadcast in Loosely Connected Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: Wait-Free Gathering of Mobile Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Optimal Grid Exploration by Asynchronous Oblivious Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Crash Resilient and Pseudo-Stabilizing Atomic Registers.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Four months in daily motion: Dissecting user video requests.
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

Limiting Byzantine Influence in Multihop Asynchronous Networks.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

The Byzantine Brides Problem.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

A Fast and Robust Optimistic Total Order Broadcast for Online Video Games.
Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012

2011
Éditorial.
Tech. Sci. Informatiques, 2011

A self-stabilizing 2/3-approximation algorithm for the maximum matching problem.
Theor. Comput. Sci., 2011

Dynamic FTSS in asynchronous systems: The case of unison.
Theor. Comput. Sci., 2011

Deterministic secure positioning in wireless sensor networks.
Theor. Comput. Sci., 2011

Stabilizing data-link over non-FIFO channels with optimal fault-resilience.
Inf. Process. Lett., 2011

A Taxonomy of Daemons in Self-stabilization
CoRR, 2011

The BG-simulation for Byzantine Mobile Robots
CoRR, 2011

Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1
CoRR, 2011

Communication Optimalement Stabilisante sur Canaux non Fiables et non FIFO
CoRR, 2011

Self-Stabilization, Byzantine Containment, and Maximizable Metrics: Necessary Conditions
CoRR, 2011

Self-stabilization in Self-organized Wireless Multihop Networks?
Ad Hoc Sens. Wirel. Networks, 2011

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection.
Proceedings of the Structural Information and Communication Complexity, 2011

Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Distributed Computing with Mobile Robots: An Introductory Survey.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

Ideal Stabilization.
Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications, 2011

2010
Quiescence of self-stabilizing gossiping among mobile agents in graphs.
Theor. Comput. Sci., 2010

Optimal Byzantine-resilient convergence in uni-dimensional robot networks.
Theor. Comput. Sci., 2010

Snap-stabilization in message-passing systems.
J. Parallel Distributed Comput., 2010

Practically Stabilizing Atomic Memory
CoRR, 2010

Universal Loop-Free Super-Stabilization
CoRR, 2010

On Byzantine Containment Properties of the $min+1$ Protocol
CoRR, 2010

Self-stabilization with Byzantine tolerance for global tasks
CoRR, 2010

Construction auto-stabilisante d'arbre couvrant en dépit d'actions malicieuses
CoRR, 2010

XS-WSNet: Extreme scale wireless sensor network simulation.
Proceedings of the 11th IEEE International Symposium on a World of Wireless, 2010

The Impact of Topology on Byzantine Containment in Stabilization.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Exclusive Perpetual Ring Exploration without Chirality.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief Announcement: Sharing Memory in a Self-stabilizing Manner.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On Byzantine Containment Properties of the <i>min</i> + 1 Protocol.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Loop-Free Super-Stabilizing Spanning Tree Construction.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

A Framework for Secure and Private P2P Publish/Subscribe.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots.
Proceedings of the Structural Information and Communication Complexity, 2010

Brief announcement: monotonic stabilization.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper.
Proceedings of the Third International Workshop on Reliability, Availability, and Security, 2010

Monotonic Stabilization.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Self-stabilizing Byzantine Asynchronous Unison<sup>, </sup>.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

RoboCast: Asynchronous Communication in Robot Networks.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Advanced faults patterns for WSN dependability benchmarking.
Proceedings of the 13th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2010

Stabilizing Locally Maximizable Tasks in Unidirectional Networks Is Hard.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

SAFE-OS: A secure and usable desktop operating system.
Proceedings of the CRiSIS 2010, 2010

2009
Discovering Network Topology in the Presence of Byzantine Faults.
IEEE Trans. Parallel Distributed Syst., 2009

A new self-stabilizing maximal matching algorithm.
Theor. Comput. Sci., 2009

On bootstrapping topology knowledge in anonymous networks.
ACM Trans. Auton. Adapt. Syst., 2009

Self-stabilizing philosophers with generic conflicts.
ACM Trans. Auton. Adapt. Syst., 2009

Byzantine Convergence in Robots Networks: The Price of Asynchrony
CoRR, 2009

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks
CoRR, 2009

Optimal byzantine resilient convergence in oblivious robot networks
CoRR, 2009

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
CoRR, 2009

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
CoRR, 2009

Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks.
Proceedings of the Stabilization, 2009

Byzantine Convergence in Robot Networks: The Price of Asynchrony.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Communication Efficiency in Self-Stabilizing Silent Protocols.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Byzantine-Resilient Convergence in Oblivious Robot Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008
An exercise in selfish stabilization.
ACM Trans. Auton. Adapt. Syst., 2008

Bounds for self-stabilization in unidirectional networks
CoRR, 2008

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
CoRR, 2008

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks.
Proceedings of the Stabilization, 2008

A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.
Proceedings of the Stabilization, 2008

Weak vs. Self vs. Probabilistic Stabilization.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

2007
FAIL-FCI: Versatile fault injection.
Future Gener. Comput. Syst., 2007

Transient fault detectors.
Distributed Comput., 2007

On the Self-stabilization of Mobile Robots in Graphs.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Conflict Managers for Self-stabilization without Fairness Assumption.
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), 2007

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

2006
Self-Stabilization with r-Operators revisited.
J. Aerosp. Comput. Inf. Commun., 2006

Evaluating Complex MAC Protocols for Sensor Networks with APMC.
Proceedings of the 6th International Workshop on Automated Verification of Critical Systems, 2006

Bounding the Impact of Unbounded Attacks in Stabilization.
Proceedings of the Stabilization, 2006

Selfish Stabilization.
Proceedings of the Stabilization, 2006

Fault injection in distributed Java applications.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Fast Convergence in Self-Stabilizing Wireless Networks.
Proceedings of the 12th International Conference on Parallel and Distributed Systems, 2006

Dependability Evaluation of The Ogsa-Dai Middleware.
Proceedings of the Achievements in European Research on Grid Systems: CoreGRID Integration Workshop 2006, 2006

FAIL-MPI: How Fault-Tolerant Is Fault-Tolerant MPI?
Proceedings of the 2006 IEEE International Conference on Cluster Computing, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Proceedings of the Theoretical Computer Science, 2006

Vers l'auto-stabilisation des systèmes à grande échelle. (Toward self-stabilizing large-scale systems).
, 2006

2005
Stabilizing inter-domain routing in the Internet.
J. High Speed Networks, 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.
Proceedings of the Structural Information and Communication Complexity, 2005

A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Self-Stabilization in Self-Organized Multihop Wireless Networks.
Proceedings of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 2005

A language-driven tool for fault injection in distributed systems.
Proceedings of the 6th IEEE/ACM International Conference on Grid Computing (GRID 2005), 2005

2004
Autostabilisation et protocoles réseau.
Tech. Sci. Informatiques, 2004

Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler.
Comput. J., 2004

Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings.
Proceedings of the Distributed Computing, 18th International Conference, 2004

A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003
Self-stabilization with path algebra.
Theor. Comput. Sci., 2003

Self-Stabilizing Wormhole Routing on Ring Networks.
J. Inf. Sci. Eng., 2003

Route Preserving Stabilization.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

Stabilite Et Auto-Stabilisation Du Routage Inter-Domaine Dans Internet.
Proceedings of the Actes de la Première Conférence Internationale RIVF'03 Rencontres en Informatique Vietnam-France, 2003

2002
Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks.
Parallel Process. Lett., 2002

Tolerating Transient and Intermittent Failures.
J. Parallel Distributed Comput., 2002

A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

Stabilizing Inter-domain Routing in the Internet (Research Note).
Proceedings of the Euro-Par 2002, 2002

2001
Self-stabilizing distributed sorting in tree networks.
Parallel Algorithms Appl., 2001

Self-stabilization with r-operators.
Distributed Comput., 2001

On a Space-Optimal Distributed Traversal Algorithm.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

Tight Space Self-Stabilizing Uniform l-Mutual Exclusion.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000
Auto-stabilisation Efficace. (Efficient Self-stabilization).
PhD thesis, 2000

Stabilizing Hierarchical Routing.
J. Interconnect. Networks, 2000

Self-stabilizing Vertex Coloration and Arbitrary Graphs.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

Tolerating Transient and Intermittent Failure.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Self-Stabilizing Algorithms in DAG Structured Networks.
Parallel Process. Lett., 1999

Self-stabilizing census with cut-through constraint.
Proceedings of the 1999 ICDCS Workshop on Self-stabilizing Systems, 1999

Self-Stabilizing Neighborhood Synchronizer in Tree Networks.
Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1998
SelfStabilizing Global Computations with rOperators.
Proceedings of the Distributed Computing, 1998

Self-Stabilization with Global Rooted Synchronizers.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998


  Loading...