Stéphane Devismes

990 total citations
45 papers, 227 citations indexed

About

Stéphane Devismes is a scholar working on Computer Networks and Communications, Hardware and Architecture and Artificial Intelligence. According to data from OpenAlex, Stéphane Devismes has authored 45 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computer Networks and Communications, 12 papers in Hardware and Architecture and 6 papers in Artificial Intelligence. Recurrent topics in Stéphane Devismes's work include Distributed systems and fault tolerance (38 papers), Optimization and Search Problems (15 papers) and Parallel Computing and Optimization Techniques (8 papers). Stéphane Devismes is often cited by papers focused on Distributed systems and fault tolerance (38 papers), Optimization and Search Problems (15 papers) and Parallel Computing and Optimization Techniques (8 papers). Stéphane Devismes collaborates with scholars based in France, United States and Italy. Stéphane Devismes's co-authors include Ajoy K. Datta, Lawrence L. Larmore, Franck Petit, Vincent Villain, Alain Cournier, Sébastien Tixeuil, Karine Altisen, Karel Heurtefeux, Colette Johnen and Swan Dubois and has published in prestigious journals such as Theoretical Computer Science, Journal of Parallel and Distributed Computing and Lecture notes in computer science.

In The Last Decade

Stéphane Devismes

41 papers receiving 224 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stéphane Devismes France 10 214 50 32 30 16 45 227
Vincent Villain France 10 311 1.5× 125 2.5× 10 0.3× 59 2.0× 15 0.9× 40 318
Victor Malyshkin Russia 6 45 0.2× 28 0.6× 7 0.2× 12 0.4× 16 1.0× 34 97
Manfred Kunde Germany 8 112 0.5× 42 0.8× 5 0.2× 42 1.4× 19 1.2× 17 143
Tetsuo Ida Japan 7 24 0.1× 19 0.4× 25 0.8× 36 1.2× 58 3.6× 37 117
James H. Burrill United States 4 276 1.3× 308 6.2× 7 0.2× 8 0.3× 21 1.3× 10 334
Andrew A. Lamb United States 6 251 1.2× 288 5.8× 4 0.1× 11 0.4× 19 1.2× 6 313
Brendan Hall United States 7 90 0.4× 95 1.9× 2 0.1× 36 1.2× 23 1.4× 21 158
Pavel Shamis United States 8 213 1.0× 189 3.8× 10 0.3× 3 0.1× 18 1.1× 21 251
Giorgis Georgakoudis United States 9 95 0.4× 101 2.0× 4 0.1× 6 0.2× 29 1.8× 41 191
Paul F. Tsuchiya United States 4 303 1.4× 13 0.3× 7 0.2× 7 0.2× 21 1.3× 11 323

Countries citing papers authored by Stéphane Devismes

Since Specialization
Citations

This map shows the geographic impact of Stéphane Devismes'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 Stéphane Devismes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphane Devismes more than expected).

Fields of papers citing papers by Stéphane Devismes

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stéphane Devismes. 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 Stéphane Devismes. The network helps show where Stéphane Devismes may publish in the future.

Co-authorship network of co-authors of Stéphane Devismes

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphane Devismes. A scholar is included among the top collaborators of Stéphane Devismes 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 Stéphane Devismes. Stéphane Devismes 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.
Lafourcade, Pascal, et al.. (2023). Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theoretical Computer Science. 977. 114162–114162. 1 indexed citations
2.
Datta, Ajoy K., Stéphane Devismes, Colette Johnen, & Lawrence L. Larmore. (2023). Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Theoretical Computer Science. 955. 113804–113804.
3.
Altisen, Karine, et al.. (2020). Election in unidirectional rings with homonyms. Journal of Parallel and Distributed Computing. 146. 79–95. 3 indexed citations
4.
Devismes, Stéphane, et al.. (2019). Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. The Computer Journal. 64(1). 132–154. 10 indexed citations
5.
Altisen, Karine, et al.. (2018). Gradual stabilization. Journal of Parallel and Distributed Computing. 123. 26–45. 1 indexed citations
6.
Datta, Ajoy K., Stéphane Devismes, & Lawrence L. Larmore. (2018). A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theoretical Computer Science. 753. 35–63. 4 indexed citations
7.
Datta, Ajoy K., Stéphane Devismes, Lawrence L. Larmore, & Vincent Villain. (2017). Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Processing Letters. 27(2). 1750002–1750002. 4 indexed citations
8.
Cournier, Alain, Ajoy K. Datta, Stéphane Devismes, Franck Petit, & Vincent Villain. (2016). The expressive power of snap-stabilization. Theoretical Computer Science. 626. 40–66. 8 indexed citations
9.
Altisen, Karine, et al.. (2016). Self-stabilizing leader election in polynomial steps. Information and Computation. 254. 330–366. 8 indexed citations
10.
Datta, Ajoy K., Stéphane Devismes, & Lawrence L. Larmore. (2016). Self-stabilizing silent disjunction in an anonymous network. Theoretical Computer Science. 665. 51–72. 1 indexed citations
11.
Datta, Ajoy K., et al.. (2016). Competitive self-stabilizing k-clustering. Theoretical Computer Science. 626. 110–133. 9 indexed citations
12.
Altisen, Karine, et al.. (2016). Concurrency in snap-stabilizing local resource allocation. Journal of Parallel and Distributed Computing. 102. 42–56.
13.
Altisen, Karine & Stéphane Devismes. (2015). On probabilistic snap-stabilization. Theoretical Computer Science. 688. 49–76. 3 indexed citations
14.
Devismes, Stéphane, et al.. (2014). Comparison of mean hitting times for a degree-biased random walk. Discrete Applied Mathematics. 170. 104–109. 4 indexed citations
15.
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
16.
Devismes, Stéphane, et al.. (2011). Self-Stabilizing Small k-Dominating Sets. 30–39. 17 indexed citations
17.
Kamei, Sayaka, Hirotsugu Kakugawa, Stéphane Devismes, & Sébastien Tixeuil. (2011). A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. Journal of Combinatorial Optimization. 25(3). 430–459. 2 indexed citations
18.
Datta, Ajoy K., et al.. (2011). SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS. International Journal of Foundations of Computer Science. 22(3). 657–677. 2 indexed citations
19.
Delporte-Gallet, Carole, Stéphane Devismes, & Hugues Fauconnier. (2009). Stabilizing leader election in partial synchronous systems with crash failures. Journal of Parallel and Distributed Computing. 70(1). 45–58. 4 indexed citations
20.
Datta, Ajoy K., Stéphane Devismes, & Lawrence L. Larmore. (2009). A Self-Stabilizing O(n)-Round k-Clustering Algorithm. 147–155. 17 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