Sébastien Tixeuil

3.6k total citations
91 papers, 495 citations indexed

About

Sébastien Tixeuil is a scholar working on Computer Networks and Communications, Hardware and Architecture and Computational Theory and Mathematics. According to data from OpenAlex, Sébastien Tixeuil has authored 91 papers receiving a total of 495 indexed citations (citations by other indexed papers that have themselves been cited), including 81 papers in Computer Networks and Communications, 17 papers in Hardware and Architecture and 11 papers in Computational Theory and Mathematics. Recurrent topics in Sébastien Tixeuil's work include Distributed systems and fault tolerance (59 papers), Optimization and Search Problems (36 papers) and Parallel Computing and Optimization Techniques (15 papers). Sébastien Tixeuil is often cited by papers focused on Distributed systems and fault tolerance (59 papers), Optimization and Search Problems (36 papers) and Parallel Computing and Optimization Techniques (15 papers). Sébastien Tixeuil collaborates with scholars based in France, United States and Japan. Sébastien Tixeuil's co-authors include Maria Potop-Butucaru, Bertrand Ducourthial, Zohir Bouzid, Fabíola Greve, Mikhail Nesterenko, Maria Gradinariu, Toshimitsu Masuzawa, Stéphane Devismes, Swan Dubois and Franck Petit and has published in prestigious journals such as ACM SIGCOMM Computer Communication Review, Future Generation Computer Systems and IEEE Transactions on Parallel and Distributed Systems.

In The Last Decade

Sébastien Tixeuil

82 papers receiving 477 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Sébastien Tixeuil France 12 458 84 74 65 60 91 495
Jerry L. Trahan United States 10 277 0.6× 48 0.6× 118 1.6× 67 1.0× 45 0.8× 67 360
Ernest Chang Canada 6 310 0.7× 102 1.2× 77 1.0× 15 0.2× 80 1.3× 14 387
Mark-Oliver Stehr United States 12 207 0.5× 69 0.8× 40 0.5× 7 0.1× 112 1.9× 34 308
Phillip W. Hutto United States 12 596 1.3× 24 0.3× 196 2.6× 21 0.3× 83 1.4× 21 644
R. M. Kieckhafer United States 8 221 0.5× 31 0.4× 58 0.8× 6 0.1× 32 0.5× 20 293
Samar Abdi United States 9 201 0.4× 52 0.6× 348 4.7× 10 0.2× 33 0.6× 41 436
Mamoru Maekawa Japan 6 544 1.2× 47 0.6× 193 2.6× 8 0.1× 86 1.4× 27 630
Chris Reade United Kingdom 8 120 0.3× 83 1.0× 68 0.9× 7 0.1× 94 1.6× 24 301
Yasuhiko Yokote Japan 9 314 0.7× 40 0.5× 206 2.8× 25 0.4× 178 3.0× 22 441
Stefanos Zachariadis United Kingdom 9 341 0.7× 8 0.1× 42 0.6× 31 0.5× 113 1.9× 14 412

Countries citing papers authored by Sébastien Tixeuil

Since Specialization
Citations

This map shows the geographic impact of Sébastien Tixeuil's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sébastien Tixeuil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sébastien Tixeuil more than expected).

Fields of papers citing papers by Sébastien Tixeuil

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sébastien Tixeuil. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sébastien Tixeuil. The network helps show where Sébastien Tixeuil may publish in the future.

Co-authorship network of co-authors of Sébastien Tixeuil

This figure shows the co-authorship network connecting the top 25 collaborators of Sébastien Tixeuil. A scholar is included among the top collaborators of Sébastien Tixeuil based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sébastien Tixeuil. Sébastien Tixeuil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kamei, Sayaka, et al.. (2024). Stand-up indulgent gathering on lines. Theoretical Computer Science. 1016. 114796–114796.
2.
Défago, Xavier, et al.. (2023). Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics and Autonomous Systems. 163. 104378–104378. 4 indexed citations
3.
Blin, Lélia & Sébastien Tixeuil. (2020). Compact self-stabilizing leader election for general networks. Journal of Parallel and Distributed Computing. 144. 278–294. 2 indexed citations
4.
Sangnier, Arnaud, et al.. (2019). Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods in System Design. 56(1-3). 55–89. 6 indexed citations
5.
Blin, Lélia, Jurek Czyzowicz, David Ilcinkas, et al.. (2018). On asynchronous rendezvous in general graphs. Theoretical Computer Science. 753. 80–90. 2 indexed citations
6.
Blin, Lélia & Sébastien Tixeuil. (2017). Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Computing. 31(2). 139–166. 9 indexed citations
7.
Masuzawa, Toshimitsu, et al.. (2016). Brief announcement: Distributed Online Data Aggregation in Dynamic Graphs. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
8.
Ooshita, Fukuhito & Sébastien Tixeuil. (2014). On the self-stabilization of mobile oblivious robots in uniform rings. Theoretical Computer Science. 568. 84–96. 3 indexed citations
9.
Dubois, Swan, Toshimitsu Masuzawa, & Sébastien Tixeuil. (2014). Maximum Metric Spanning Tree Made Byzantine Tolerant. Algorithmica. 73(1). 166–201. 4 indexed citations
10.
Devismes, Stéphane, Franck Petit, & Sébastien Tixeuil. (2013). Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theoretical Computer Science. 498. 10–27. 11 indexed citations
11.
Manne, Fredrik, et al.. (2011). A self-stabilizing 23-approximation algorithm for the maximum matching problem. Theoretical Computer Science. 412(40). 5515–5526. 5 indexed citations
12.
Petit, Franck & Sébastien Tixeuil. (2010). Proceedings of the Third International Workshop on Reliability, Availability, and Security. 67(4). 313–9. 1 indexed citations
13.
Baker, T. P., Alain Bui, & Sébastien Tixeuil. (2008). Principles of distributed systems : 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008 : proceedings. Springer eBooks. 1 indexed citations
14.
Manne, Fredrik, et al.. (2008). A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.. 94–108. 1 indexed citations
15.
Tixeuil, Sébastien, et al.. (2006). An Overview of Existing Tools for Fault-Injection and Dependability Benchmarking in Grids. 7 indexed citations
16.
Tixeuil, Sébastien, et al.. (2006). Fault injection in distributed Java applications. International Parallel and Distributed Processing Symposium. 233–233. 2 indexed citations
17.
Datta, Ajoy K., et al.. (2003). Self-Stabilizing Wormhole Routing on Ring Networks. Journal of information science and engineering. 19(3). 401–414.
18.
Ducourthial, Bertrand & Sébastien Tixeuil. (2003). Self-stabilization with path algebra. Theoretical Computer Science. 293(1). 219–236. 8 indexed citations
19.
Gradinariu, Maria & Sébastien Tixeuil. (2000). Self-stabilizing Vertex Coloration and Arbitrary Graphs.. 55–70. 13 indexed citations
20.
Tixeuil, Sébastien, et al.. (2000). Tolerating Transient and Intermittent Failure.. 17–36. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026