Étienne Payet

435 total citations
8 papers, 146 citations indexed

About

Étienne Payet is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Étienne Payet has authored 8 papers receiving a total of 146 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 2 papers in Software. Recurrent topics in Étienne Payet's work include Logic, programming, and type systems (6 papers), Formal Methods in Verification (4 papers) and Logic, Reasoning, and Knowledge (2 papers). Étienne Payet is often cited by papers focused on Logic, programming, and type systems (6 papers), Formal Methods in Verification (4 papers) and Logic, Reasoning, and Knowledge (2 papers). Étienne Payet collaborates with scholars based in Réunion, Italy and France. Étienne Payet's co-authors include Fausto Spoto and Fred Mesnard and has published in prestigious journals such as Theoretical Computer Science, Information and Software Technology and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Étienne Payet

7 papers receiving 137 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Étienne Payet Réunion 5 92 73 58 54 46 8 146
Boris Yakobowski France 2 78 0.8× 79 1.1× 39 0.7× 55 1.0× 40 0.9× 4 152
Jorge Sousa Pinto Portugal 6 94 1.0× 31 0.4× 28 0.5× 58 1.1× 28 0.6× 37 144
Nels E. Beckman United States 8 104 1.1× 156 2.1× 42 0.7× 69 1.3× 118 2.6× 14 244
Tommy Thorn France 6 140 1.5× 35 0.5× 57 1.0× 36 0.7× 40 0.9× 6 209
Radu Grigore United Kingdom 7 85 0.9× 95 1.3× 44 0.8× 39 0.7× 71 1.5× 15 153
Jorge A. Navas United States 7 64 0.7× 56 0.8× 18 0.3× 33 0.6× 51 1.1× 17 136
Bow-Yaw Wang Taiwan 7 95 1.0× 46 0.6× 28 0.5× 47 0.9× 39 0.8× 25 122
Benny Godlin Israel 5 76 0.8× 71 1.0× 19 0.3× 91 1.7× 55 1.2× 9 164
Arnaud Venet United States 6 79 0.9× 101 1.4× 17 0.3× 90 1.7× 41 0.9× 12 176
Mizuhito Ogawa Japan 7 55 0.6× 25 0.3× 41 0.7× 54 1.0× 21 0.5× 29 121

Countries citing papers authored by Étienne Payet

Since Specialization
Citations

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

Fields of papers citing papers by Étienne Payet

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Étienne Payet. 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 Étienne Payet. The network helps show where Étienne Payet may publish in the future.

Co-authorship network of co-authors of Étienne Payet

This figure shows the co-authorship network connecting the top 25 collaborators of Étienne Payet. A scholar is included among the top collaborators of Étienne Payet 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 Étienne Payet. Étienne Payet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

8 of 8 papers shown
1.
Payet, Étienne. (2024). Non-termination in Term Rewriting and Logic Programming. Journal of Automated Reasoning. 68(1).
2.
Payet, Étienne & Fausto Spoto. (2012). Static analysis of Android programs. Information and Software Technology. 54(11). 1192–1201. 64 indexed citations
3.
Spoto, Fausto, Fred Mesnard, & Étienne Payet. (2010). A termination analyzer for Java bytecode based on path-length. ACM Transactions on Programming Languages and Systems. 32(3). 1–70. 53 indexed citations
4.
Payet, Étienne & Fred Mesnard. (2009). A non-termination criterion for binary constraint logic programs. Theory and Practice of Logic Programming. 9(2). 145–164. 4 indexed citations
5.
Payet, Étienne & Fausto Spoto. (2009). Experiments with Non-Termination Analysis for Java Bytecode. Electronic Notes in Theoretical Computer Science. 253(5). 83–96. 4 indexed citations
6.
Payet, Étienne. (2008). Loop detection in term rewriting using the eliminating unfoldings. Theoretical Computer Science. 403(2-3). 307–327. 9 indexed citations
7.
Payet, Étienne & Fred Mesnard. (2006). Nontermination inference of logic programs. ACM Transactions on Programming Languages and Systems. 28(2). 256–289. 11 indexed citations
8.
Payet, Étienne. (2000). Thue Specifications, Infinite Graphs and Synchronized Product. Fundamenta Informaticae. 44(3). 265–290. 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