Sébastien Tixeuil

From MaRDI portal
Person:300241

Available identifiers

zbMath Open tixeuil.sebastienWikidataQ102078538 ScholiaQ102078538MaRDI QIDQ300241

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61285682024-04-15Paper
Reliable broadcast in dynamic networks with locally bounded Byzantine failures2023-08-02Paper
Ring exploration with myopic luminous robots2023-08-02Paper
Arbitrary pattern formation with four robots2023-08-02Paper
Meeting Times of Non-atomic Random Walks2023-05-19Paper
The agreement power of disagreement2023-04-12Paper
https://portal.mardi4nfdi.de/entity/Q58742612023-02-07Paper
Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps2022-12-21Paper
Stand up indulgent gathering2022-11-17Paper
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks2022-11-04Paper
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds2022-07-08Paper
Stand up indulgent gathering2022-06-24Paper
Ring exploration with myopic luminous robots2022-05-17Paper
Uniform bipartition in the population protocol model with arbitrary graphs2021-10-21Paper
Parameterized verification of algorithms for oblivious robots on a ring2021-02-08Paper
Optimal torus exploration by oblivious robots2021-01-15Paper
Self-stabilization with r-operators2020-12-03Paper
Mobile robots with uncertain visibility sensors2020-03-03Paper
Compact self-stabilizing leader election for general networks2020-02-12Paper
The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks2020-01-14Paper
Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols2020-01-14Paper
An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers2019-11-22Paper
Synchronous gathering without multiplicity detection: a certified algorithm2019-11-22Paper
Packet efficient implementation of the Omega failure detector2019-11-22Paper
Packet efficient implementation of the Omega failure detector2019-06-21Paper
Synchronous gathering without multiplicity detection: a certified algorithm2019-06-21Paper
Approximate agreement under mobile Byzantine faults2019-01-10Paper
On asynchronous rendezvous in general graphs2018-11-29Paper
Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots2018-08-16Paper
On time complexity for connectivity-preserving scattering of mobile robots2018-06-18Paper
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative2018-04-11Paper
https://portal.mardi4nfdi.de/entity/Q46034472018-02-20Paper
Tolerating Random Byzantine Failures in an Unbounded Network2017-12-15Paper
Brief Announcement2017-10-11Paper
Optimal Mobile Byzantine Fault Tolerant Distributed Storage2017-09-29Paper
The Random Bit Complexity of Mobile Robots Scattering2017-08-17Paper
The complexity of data aggregation in static and dynamic wireless sensor networks2017-08-08Paper
Formal verification of mobile robot protocols2017-06-22Paper
Gathering fat mobile robots with slim omnidirectional cameras2016-06-27Paper
Wait-Free Gathering Without Chirality2016-01-08Paper
Weak vs. Self vs. Probabilistic Stabilization2015-09-29Paper
Maximum metric spanning tree made Byzantine tolerant2015-09-03Paper
Evaluating Complex MAC Protocols for Sensor Networks with APMC2015-03-18Paper
Practically stabilizing SWMR atomic memory in message-passing systems2015-02-20Paper
On the self-stabilization of mobile oblivious robots in uniform rings2015-01-28Paper
Impossibility of gathering, a certification2014-12-15Paper
Optimal probabilistic ring exploration by semi-synchronous oblivious robots2014-01-10Paper
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks2013-06-28Paper
Transient fault detectors2013-06-20Paper
Stabilizing data-link over non-FIFO channels with optimal fault-resilience2013-04-04Paper
On Byzantine Broadcast in Loosely Connected Networks2013-03-13Paper
Self-stabilizing Byzantine asynchronous unison2012-10-23Paper
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection2012-09-25Paper
Snap-stabilization in message-passing systems2012-03-07Paper
Maximum metric spanning tree made Byzantine tolerant2011-10-28Paper
A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem2011-10-10Paper
Deterministic secure positioning in wireless sensor networks2011-09-12Paper
Dynamic FTSS in asynchronous systems: the case of unison2011-07-14Paper
Exclusive Perpetual Ring Exploration without Chirality2010-09-10Paper
The Impact of Topology on Byzantine Containment in Stabilization2010-09-10Paper
Optimal Byzantine-resilient convergence in uni-dimensional robot networks2010-08-11Paper
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks2010-07-20Paper
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots2010-06-17Paper
Quiescence of self-stabilizing gossiping among mobile agents in graphs2010-04-06Paper
Ascending runs in dependent uniformly distributed random variables: application to wireless networks2010-03-15Paper
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots2010-02-24Paper
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property2009-11-19Paper
A new self-stabilizing maximal matching algorithm2009-03-30Paper
Discovering Network Topology in the Presence of Byzantine Faults2009-03-12Paper
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs2008-07-10Paper
A new self-stabilizing maximal matching algorithm2007-11-15Paper
Self-stabilization with r-Operators Revisited2007-09-25Paper
Structural Information and Communication Complexity2005-11-30Paper
Algorithmic Aspects of Wireless Sensor Networks2005-08-25Paper
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48131382004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44572312004-03-21Paper
https://portal.mardi4nfdi.de/entity/Q44466112004-02-02Paper
Self-stabilization with path algebra2003-05-14Paper
Tolerating transient and intermittent failures2002-10-16Paper
SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS2001-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42507921999-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sébastien Tixeuil