The following pages link to Sébastien Tixeuil (Q300241):
Displaying 22 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)
- 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)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- On time complexity for connectivity-preserving scattering of mobile robots (Q1643151) (← 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)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312965) (← links)
- Stand up indulgent gathering (Q5918567) (← links)
- Stand up indulgent gathering (Q5918709) (← links)
- Boosting the Efficiency of Byzantine-Tolerant Reliable Communication (Q6487895) (← links)
- Stand Up Indulgent Rendezvous (Q6487896) (← links)
- Partial Gathering of Mobile Robots from Multiplicity-Allowed Configurations in Rings (Q6487914) (← links)
- The Agreement Power of Disagreement (Q6488441) (← links)
