Yves Métivier
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Artificial Intelligence top 10%
- Molecular Biology
- Geometry and Topology top 10%
- Co-authors
- Robert CoriAkka ZemmariWiesław ZielonkaJ. M. RobsonJérémie ChalopinGwénaël RichommeBruno CourcelleMohamed Mosbah
- Topics
- semigroups and automata theory (13 papers)Distributed systems and fault tolerance (10 papers)Complexity and Algorithms in Graphs (10 papers)
In The Last Decade
Yves Métivier
33 papers receiving 303 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 242
- Computer Networks and Communications 133
- Artificial Intelligence 125
- Molecular Biology 50
- Geometry and Topology 31
Countries citing papers authored by Yves Métivier
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). | 1 |
| 4 | 1 | |
| 5 | 5 | |
| 6 | 9 | |
| 7 | An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm | 13 |
| 8 | 1 | |
| 9 | Election, Naming and Cellular Edge Local Computations (Extended Abstract) | 1 |
| 10 | 11 | |
| 11 | A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-Prime Graphs | 1 |
| 12 | The power of local computations in graphs with initial knowledge | 1 |
| 13 | 11 | |
| 14 | 13 | |
| 15 | 12 | |
| 16 | 11 | |
| 17 | 29 | |
| 18 | 8 | |
| 19 | 35 | |
| 20 | 24 |
About Yves Métivier
Yves Métivier is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, having authored 36 papers that have together received 332 indexed citations. Recurring topics across this work include semigroups and automata theory (13 papers), Distributed systems and fault tolerance (10 papers) and Complexity and Algorithms in Graphs (10 papers). The work is most often cited by research in Computational Theory and Mathematics (242 citations), Computer Networks and Communications (133 citations) and Artificial Intelligence (125 citations). Yves Métivier has collaborated with scholars based in France and Poland. Frequent co-authors include Robert Cori, Akka Zemmari, Wiesław Zielonka, J. M. Robson, Jérémie Chalopin, Gwénaël Richomme, Bruno Courcelle, Jérémie Chalopin, Mohamed Mosbah and Stefan Grüner. Their work appears in journals such as Theoretical Computer Science, Lecture notes in computer science and Algorithmica.
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.