Yves Métivier

1.6k total citations
36 papers, 332 citations indexed

About

Yves Métivier is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Yves Métivier has authored 36 papers receiving a total of 332 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 12 papers in Artificial Intelligence. Recurrent topics in Yves Métivier's work include semigroups and automata theory (13 papers), Distributed systems and fault tolerance (10 papers) and Complexity and Algorithms in Graphs (10 papers). Yves Métivier is often cited by papers focused on semigroups and automata theory (13 papers), Distributed systems and fault tolerance (10 papers) and Complexity and Algorithms in Graphs (10 papers). Yves Métivier collaborates with scholars based in France and Poland. Yves Métivier's co-authors include Robert Cori, Akka Zemmari, Wiesław Zielonka, J. M. Robson, Jérémie Chalopin, Bruno Courcelle, Gwénaël Richomme, Jérémie Chalopin, Mohamed Mosbah and Stefan Grüner and has published in prestigious journals such as Theoretical Computer Science, Lecture notes in computer science and Algorithmica.

In The Last Decade

Yves Métivier

33 papers receiving 303 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yves Métivier France 12 242 133 125 50 31 36 332
Kevin Cattell Canada 8 172 0.7× 41 0.3× 108 0.9× 66 1.3× 9 0.3× 13 228
Andrzej Szepietowski Poland 9 152 0.6× 60 0.5× 77 0.6× 41 0.8× 12 0.4× 35 223
Jonathan F. Buss Canada 8 215 0.9× 98 0.7× 96 0.8× 19 0.4× 16 0.5× 20 314
Christian Choffrut France 12 352 1.5× 37 0.3× 237 1.9× 115 2.3× 32 1.0× 59 400
Igor Razgon Ireland 11 370 1.5× 141 1.1× 51 0.4× 48 1.0× 23 0.7× 24 424
Yushi Uno Japan 8 188 0.8× 70 0.5× 38 0.3× 12 0.2× 13 0.4× 39 246
Danièle Beauquier France 8 197 0.8× 18 0.1× 117 0.9× 55 1.1× 8 0.3× 22 246
David Eisenstat United States 7 57 0.2× 207 1.6× 38 0.3× 101 2.0× 7 0.2× 18 320
Amir Nayyeri United States 10 106 0.4× 92 0.7× 33 0.3× 9 0.2× 19 0.6× 35 231
Amr Elmasry Egypt 7 91 0.4× 50 0.4× 83 0.7× 13 0.3× 9 0.3× 55 180

Countries citing papers authored by Yves Métivier

Since Specialization
Citations

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

Fields of papers citing papers by Yves Métivier

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yves Métivier

This figure shows the co-authorship network connecting the top 25 collaborators of Yves Métivier. A scholar is included among the top collaborators of Yves Métivier 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 Yves Métivier. Yves Métivier 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.
Métivier, Yves, J. M. Robson, & Akka Zemmari. (2015). A distributed enumeration algorithm and applications to all pairs shortest paths, diameter…. Information and Computation. 247. 141–151. 1 indexed citations
2.
Métivier, Yves, J. M. Robson, & Akka Zemmari. (2015). Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theoretical Computer Science. 584. 115–130. 2 indexed citations
3.
Métivier, Yves, J. M. Robson, & Akka Zemmari. (2013). Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract).. 153–164. 1 indexed citations
4.
Chalopin, Jérémie, Emmanuel Godard, & Yves Métivier. (2012). Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Computing. 25(4). 297–311. 5 indexed citations
5.
Chalopin, Jérémie, et al.. (2012). Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundamenta Informaticae. 120(1). 1–27. 2 indexed citations
6.
Métivier, Yves, et al.. (2010). About randomised distributed graph colouring and graph partition algorithms. Information and Computation. 208(11). 1296–1304. 9 indexed citations
7.
Chalopin, Jérémie & Yves Métivier. (2007). An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundamenta Informaticae. 80(1). 221–246. 13 indexed citations
8.
Chalopin, Jérémie, Yves Métivier, & Wiesław Zielonka. (2004). Election, Naming and Cellular Edge Local Computations (Extended Abstract). Lecture notes in computer science. 242–256. 1 indexed citations
9.
Métivier, Yves, et al.. (2003). Analysis of a randomized rendezvous algorithm. Information and Computation. 184(1). 109–128. 11 indexed citations
10.
Métivier, Yves, Pierre‐André Wacrenier, Mohamed Mosbah, & Stefan Grüner. (2001). A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-Prime Graphs. ePrints Soton (University of Southampton). 141–158. 1 indexed citations
11.
Godard, Emmanuel, Yves Métivier, & Anca Muscholl. (2000). The power of local computations in graphs with initial knowledge. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
12.
Métivier, Yves & Gwénaël Richomme. (1995). New Results on the Star Problem in Trace Monoids. Information and Computation. 119(2). 240–251. 11 indexed citations
13.
Métivier, Yves, et al.. (1995). On the Recognition of Families of Graphs with Local Computations. Information and Computation. 118(1). 110–119. 13 indexed citations
14.
Courcelle, Bruno & Yves Métivier. (1994). Coverings and Minors: Application to Local Computations in Graphs. European Journal of Combinatorics. 15(2). 127–138. 12 indexed citations
15.
Métivier, Yves, et al.. (1993). Computing with graph rewriting systems with priorities. Theoretical Computer Science. 115(2). 191–224. 11 indexed citations
16.
Cori, Robert, Yves Métivier, & Wiesław Zielonka. (1993). Asynchronous Mappings and Asynchronous Cellular Automata. Information and Computation. 106(2). 159–202. 29 indexed citations
17.
Métivier, Yves. (1986). Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. RAIRO - Theoretical Informatics and Applications. 20(2). 121–127. 18 indexed citations
18.
Métivier, Yves. (1985). Calcul de longueurs de chaînes de réécriture dans le monoïde libre. Theoretical Computer Science. 35. 71–87. 8 indexed citations
19.
Cori, Robert & Yves Métivier. (1985). Recognizable subsets of some partially abelian monoids. Theoretical Computer Science. 35. 179–189. 35 indexed citations
20.
Métivier, Yves. (1983). About the rewriting systems produced by the Knuth-Bendix completion algorithm. Information Processing Letters. 16(1). 31–34. 24 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

Breakdown of academic impact, for papers by Kevin Cattell Breakdown of academic impact, for papers by Andrzej Szepietowski Breakdown of academic impact, for papers by Jonathan F. Buss Breakdown of academic impact, for papers by Christian Choffrut Breakdown of academic impact, for papers by Igor Razgon Breakdown of academic impact, for papers by Yushi Uno Breakdown of academic impact, for papers by Danièle Beauquier Breakdown of academic impact, for papers by David Eisenstat Breakdown of academic impact, for papers by Amir Nayyeri Breakdown of academic impact, for papers by Amr Elmasry
Rankless by CCL
2026