The following pages link to Sébastien Tixeuil (Q300241):
Displaying 50 items.
- Gathering fat mobile robots with slim omnidirectional cameras (Q300242) (← links)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
- Self-stabilizing Byzantine asynchronous unison (Q455967) (← links)
- Impossibility of gathering, a certification (Q483063) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Dynamic FTSS in asynchronous systems: the case of unison (Q551164) (← links)
- Deterministic secure positioning in wireless sensor networks (Q638507) (← links)
- Snap-stabilization in message-passing systems (Q666259) (← links)
- Tolerating transient and intermittent failures (Q701153) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks (Q986551) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- On time complexity for connectivity-preserving scattering of mobile robots (Q1643151) (← links)
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots (Q1660934) (← links)
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative (Q1741967) (← links)
- Approximate agreement under mobile Byzantine faults (Q1755583) (← links)
- Self-stabilization with path algebra (Q1870595) (← links)
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience (Q1944165) (← links)
- Transient fault detectors (Q1954230) (← links)
- An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers (Q2007904) (← links)
- The complexity of data aggregation in static and dynamic wireless sensor networks (Q2013589) (← links)
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps (Q2110369) (← links)
- Ring exploration with myopic luminous robots (Q2139099) (← links)
- Optimal torus exploration by oblivious robots (Q2218466) (← links)
- Parameterized verification of algorithms for oblivious robots on a ring (Q2225474) (← links)
- Uniform bipartition in the population protocol model with arbitrary graphs (Q2235772) (← links)
- Practically stabilizing SWMR atomic memory in message-passing systems (Q2256720) (← links)
- Ascending runs in dependent uniformly distributed random variables: application to wireless networks (Q2270184) (← links)
- Compact self-stabilizing leader election for general networks (Q2294688) (← links)
- Mobile robots with uncertain visibility sensors (Q2303303) (← links)
- Formal verification of mobile robot protocols (Q2359768) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- On the self-stabilization of mobile oblivious robots in uniform rings (Q2513610) (← links)
- The agreement power of disagreement (Q2697537) (← links)
- SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS (Q2735236) (← links)
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection (Q2912753) (← links)
- Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization (Q2947955) (← links)
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots (Q3408171) (← links)
- Wait-Free Gathering Without Chirality (Q3460724) (← links)
- Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (Q3511403) (← links)
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots (Q3569125) (← links)
- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks (Q3578305) (← links)
- Exclusive Perpetual Ring Exploration without Chirality (Q3588311) (← links)
- The Impact of Topology on Byzantine Containment in Stabilization (Q3588325) (← links)
- Discovering Network Topology in the Presence of Byzantine Faults (Q3613653) (← links)
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property (Q3646240) (← links)
- (Q4250792) (← links)
- (Q4446611) (← links)
