Thomas Genet

627 total citations
13 papers, 70 citations indexed

About

Thomas Genet is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Thomas Genet has authored 13 papers receiving a total of 70 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 5 papers in Information Systems. Recurrent topics in Thomas Genet's work include Logic, programming, and type systems (9 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (3 papers). Thomas Genet is often cited by papers focused on Logic, programming, and type systems (9 papers), Formal Methods in Verification (9 papers) and Software Testing and Debugging Techniques (3 papers). Thomas Genet collaborates with scholars based in France and Canada. Thomas Genet's co-authors include Vlad Rusu, Thomas Wiben Jensen, David Pichardie, Yann Salmon and Olivier Heen and has published in prestigious journals such as Journal of Automated Reasoning, Journal of Symbolic Computation and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Thomas Genet

12 papers receiving 65 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Genet France 5 55 48 17 16 15 13 70
Anders B. Sandholm Denmark 6 68 1.2× 50 1.0× 28 1.6× 18 1.1× 21 1.4× 10 95
Douglas R. Smith United Kingdom 5 54 1.0× 43 0.9× 27 1.6× 21 1.3× 22 1.5× 5 83
Damien Pous France 7 97 1.8× 76 1.6× 14 0.8× 30 1.9× 13 0.9× 27 118
Jeroen J. A. Keiren Netherlands 6 38 0.7× 48 1.0× 32 1.9× 16 1.0× 8 0.5× 14 72
François Bobot France 5 40 0.7× 37 0.8× 19 1.1× 13 0.8× 12 0.8× 7 60
Aistis Simaitis United Kingdom 3 52 0.9× 26 0.5× 15 0.9× 25 1.6× 10 0.7× 4 70
Andrea Turrini China 7 74 1.3× 70 1.5× 25 1.5× 11 0.7× 5 0.3× 24 101
Nikola Beneš Czechia 5 41 0.7× 47 1.0× 39 2.3× 9 0.6× 8 0.5× 20 87
Jan Strejček Czechia 5 36 0.7× 39 0.8× 27 1.6× 9 0.6× 14 0.9× 21 69
Thomas Gibson−Robinson United Kingdom 5 33 0.6× 26 0.5× 14 0.8× 14 0.9× 19 1.3× 15 65

Countries citing papers authored by Thomas Genet

Since Specialization
Citations

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

Fields of papers citing papers by Thomas Genet

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Thomas Genet

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

All Works

13 of 13 papers shown
1.
Genet, Thomas, et al.. (2020). Regular language type inference with term rewriting. Proceedings of the ACM on Programming Languages. 4(ICFP). 1–29. 1 indexed citations
2.
Genet, Thomas, et al.. (2020). Termination of Ethereum’s Smart Contracts. SPIRE - Sciences Po Institutional REpository. 39–51. 9 indexed citations
3.
Genet, Thomas & Yann Salmon. (2017). Reachability Analysis of Innermost Rewriting. Logical Methods in Computer Science. Volume 13, Issue 1. 1 indexed citations
4.
Genet, Thomas. (2015). Termination criteria for tree automata completion. Journal of Logical and Algebraic Methods in Programming. 85(1). 3–33. 3 indexed citations
5.
Genet, Thomas & Vlad Rusu. (2010). Equational approximations for tree automata completion. Journal of Symbolic Computation. 45(5). 574–597. 7 indexed citations
6.
Genet, Thomas, et al.. (2009). Verifying Temporal Regular properties of Abstractions of Term Rewriting Systems. 1 indexed citations
7.
Heen, Olivier, et al.. (2008). AN INDUSTRIAL AND ACADEMIC JOINT EXPERIMENT ON AUTOMATED VERIFICATION OF A SECURITY PROTOCOL. 39–53. 4 indexed citations
8.
Genet, Thomas, et al.. (2004). A Java Card CAP converter in PVS1 1This work was partially funded by the European IST R&D project 2000-26328 “Verifi card”. Electronic Notes in Theoretical Computer Science. 82(2). 426–442. 2 indexed citations
9.
Genet, Thomas, et al.. (2004). Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning. 33(3-4). 341–383. 34 indexed citations
10.
Genet, Thomas, et al.. (2003). Reachability in Conditional Term Rewriting Systems. Electronic Notes in Theoretical Computer Science. 86(1). 133–146. 6 indexed citations
11.
Genet, Thomas, et al.. (2002). Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation. OpenGrey (Institut de l'Information Scientifique et Technique). 1 indexed citations
12.
Genet, Thomas, et al.. (2000). Rewriting for Cryptographic Protocol Verification - Extended Version -. HAL (Le Centre pour la Communication Scientifique Directe).
13.
Genet, Thomas. (1997). Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version -. HAL (Le Centre pour la Communication Scientifique Directe). 28. 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