Sébastien Tixeuil
18
Documents
Publications
- 18
- 6
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
Compact self-stabilizing leader election for general networksJournal of Parallel and Distributed Computing, 2020, ⟨10.1016/j.jpdc.2020.05.019⟩
Article dans une revue
hal-02873070v1
|
|
On asynchronous rendezvous in general graphsTheoretical Computer Science, 2019, 753, pp.80-90. ⟨10.1016/j.tcs.2018.06.045⟩
Article dans une revue
hal-01900843v1
|
|
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkativeDistributed Computing, 2018, 31 (2), pp.139-166. ⟨10.1007/s00446-017-0294-2⟩
Article dans une revue
hal-01486763v1
|
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free PropertyThe Computer Journal, 2016, 59 (2), pp.225-243. ⟨10.1093/comjnl/bxv110⟩
Article dans une revue
hal-01269828v1
|
|
On peut tromper mille personnes mille fois, mais pas plusALGOTEL 2020 - 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.156-165
Communication dans un congrès
hal-03746708v1
|
Compact Self-Stabilizing Leader Election for General NetworksLATIN 2018 - 13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.161-173, ⟨10.1007/978-3-319-77404-6_13⟩
Communication dans un congrès
hal-02076468v1
|
|
|
Algorithme Auto-Stabilisant Compact d'Election pour les Graphes ArbitrairesALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Communication dans un congrès
hal-01512950v1
|
Brief announcement: Compact Self-Stabilizing Leader Election for General Networks31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria
Communication dans un congrès
hal-01553088v1
|
|
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being TalkativeDISC 2013 - 27th International Symposium on Distributed Computing, Oct 2013, Jerusalem, Israel. pp.76-90, ⟨10.1007/978-3-642-41527-2_6⟩
Communication dans un congrès
hal-00930095v1
|
|
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bitsACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. pp.125-127, ⟨10.1145/2484239.2484289⟩
Communication dans un congrès
hal-00930090v1
|
|
Exclusive Perpetual Ring Exploration without ChiralityDISC 2010 - 24th International Symposium Distributed Computing, Sep 2010, Cambridge, MA, United States. pp.312-327, ⟨10.1007/978-3-642-15763-9_29⟩
Communication dans un congrès
hal-00992700v1
|
|
Loop-Free Super-Stabilizing Spanning Tree Construction12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), Sep 2010, New York, NY, United States. pp.50--64, ⟨10.1007/978-3-642-16023-3_7⟩
Communication dans un congrès
hal-00668381v1
|
|
A new self-stabilizing minimum spanning tree construction with loop-free property23rd International Symposium on Distributed Computing (DISC 2009), Sep 2009, Elche, Spain. pp.407--422, ⟨10.1007/978-3-642-04355-0_43⟩
Communication dans un congrès
hal-00869591v1
|
|
On the Self-stabilization of Mobile Robots in GraphsOPODIS 2007 - 11th International Conference on Principles of Distributed Systems, Dec 2007, Guadeloupe, France. pp.301-314, ⟨10.1007/978-3-540-77096-1_22⟩
Communication dans un congrès
hal-01311362v1
|
|
Universal Loop-Free Super-Stabilization2010
Pré-publication, Document de travail
hal-00492320v1
|
|
Exclusive perpetual ring exploration without chirality[Research Report] Université d'Evry Val d'Essonne. 2010, pp.17
Rapport
inria-00464206v1
|
|
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property[Research Report] Université d'Evry Val d'Essonne. 2009
Rapport
inria-00384041v1
|
|
On the Self-stabilization of Mobile Robots in Graphs[Research Report] RR-6266, INRIA. 2007, pp.23
Rapport
inria-00166547v2
|