The following pages link to Sébastien Tixeuil (Q300241):
Displaying 34 items.
- (Q4457231) (← links)
- Tolerating Random Byzantine Failures in an Unbounded Network (Q4598913) (← links)
- (Q4603447) (← links)
- (Q4813138) (← links)
- On Byzantine Broadcast in Loosely Connected Networks (Q4909416) (← links)
- The Random Bit Complexity of Mobile Robots Scattering (Q4977890) (← links)
- An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks (Q5045435) (← links)
- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds (Q5087082) (← links)
- Self-stabilization with r-operators (Q5138358) (← links)
- Evaluating Complex MAC Protocols for Sensor Networks with APMC (Q5178993) (← links)
- The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks (Q5207896) (← links)
- Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols (Q5207910) (← links)
- Self-stabilization with r-Operators Revisited (Q5307033) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312965) (← links)
- Optimal Mobile Byzantine Fault Tolerant Distributed Storage (Q5361945) (← links)
- Brief Announcement (Q5368993) (← links)
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings (Q5464194) (← links)
- Structural Information and Communication Complexity (Q5710080) (← links)
- (Q5874261) (← links)
- Synchronous gathering without multiplicity detection: a certified algorithm (Q5918186) (← links)
- Packet efficient implementation of the Omega failure detector (Q5918188) (← links)
- Stand up indulgent gathering (Q5918567) (← links)
- Stand up indulgent gathering (Q5918709) (← links)
- Synchronous gathering without multiplicity detection: a certified algorithm (Q5920218) (← links)
- (Q6128568) (← links)
- Reliable broadcast in dynamic networks with locally bounded Byzantine failures (Q6165837) (← links)
- Arbitrary pattern formation with four robots (Q6165847) (← 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)
- Fun with Fun (Q6540591) (← links)
- Resource efficient stabilization for local tasks despite unknown capacity links (Q6612539) (← links)
- Stand-up indulgent gathering on lines (Q6614023) (← links)
