Yohan Boichut

1.5k total citations
9 papers, 31 citations indexed

About

Yohan Boichut is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Yohan Boichut has authored 9 papers receiving a total of 31 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Yohan Boichut's work include Formal Methods in Verification (5 papers), Logic, programming, and type systems (4 papers) and Advanced Authentication Protocols Security (4 papers). Yohan Boichut is often cited by papers focused on Formal Methods in Verification (5 papers), Logic, programming, and type systems (4 papers) and Advanced Authentication Protocols Security (4 papers). Yohan Boichut collaborates with scholars based in France. Yohan Boichut's co-authors include Pierre‐Cyrille Héam, Olga Kouchnarenko, Laurent Vigneron, Nikolaï Kosmatov and Pierre Réty and has published in prestigious journals such as Journal of Computer and System Sciences, Information Processing Letters and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Yohan Boichut

7 papers receiving 24 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yohan Boichut France 4 23 17 15 14 9 9 31
Yann Thierry-Mieg France 4 14 0.6× 11 0.6× 12 0.8× 26 1.9× 15 1.7× 6 47
Karl M. Göschka Austria 5 26 1.1× 22 1.3× 17 1.1× 10 0.7× 6 0.7× 23 57
Sarah A. Hamilton United States 4 17 0.7× 14 0.8× 10 0.7× 4 0.3× 5 0.6× 10 46
Axel Legay France 5 19 0.8× 11 0.6× 8 0.5× 27 1.9× 20 2.2× 7 48
Romain Demangeon France 3 36 1.6× 16 0.9× 9 0.6× 34 2.4× 5 0.6× 3 47
Daniel Thoma Germany 3 27 1.2× 16 0.9× 6 0.4× 20 1.4× 24 2.7× 7 43
Yoad Lustig United States 4 32 1.4× 9 0.5× 7 0.5× 36 2.6× 9 1.0× 8 48
Oukseh Lee South Korea 4 21 0.9× 8 0.5× 8 0.5× 9 0.6× 6 0.7× 8 28
Adam Rogalewicz Czechia 4 22 1.0× 7 0.4× 6 0.4× 26 1.9× 18 2.0× 5 39
Larissa Meinicke Australia 4 29 1.3× 10 0.6× 9 0.6× 24 1.7× 6 0.7× 11 41

Countries citing papers authored by Yohan Boichut

Since Specialization
Citations

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

Fields of papers citing papers by Yohan Boichut

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yohan Boichut

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

All Works

9 of 9 papers shown
1.
Boichut, Yohan, et al.. (2017). Towards more precise rewriting approximations. Journal of Computer and System Sciences. 104. 131–148.
2.
Boichut, Yohan, Pierre‐Cyrille Héam, & Olga Kouchnarenko. (2009). Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. Electronic Notes in Theoretical Computer Science. 239. 57–72. 3 indexed citations
3.
Boichut, Yohan, et al.. (2009). HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA. International Journal of Foundations of Computer Science. 20(5). 837–849. 1 indexed citations
4.
Boichut, Yohan, Pierre‐Cyrille Héam, & Olga Kouchnarenko. (2008). Approximation-based tree regular model-checking. HAL (Le Centre pour la Communication Scientifique Directe). 14(3). 216–241. 3 indexed citations
5.
Boichut, Yohan & Pierre‐Cyrille Héam. (2008). A theoretical limit for safety verification techniques with regular fix-point computations. Information Processing Letters. 108(1). 1–2. 4 indexed citations
6.
Boichut, Yohan, et al.. (2008). Handling Left-Quadratic Rules When Completing Tree Automata. Electronic Notes in Theoretical Computer Science. 223. 61–70. 1 indexed citations
7.
Boichut, Yohan, Pierre‐Cyrille Héam, & Olga Kouchnarenko. (2006). Handling Algebraic Properties in Automatic Analysis of Security Protocols. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
8.
Boichut, Yohan, Nikolaï Kosmatov, & Laurent Vigneron. (2006). Validation of Prouve Protocols using the Automatic Tool TA4SP. HAL (Le Centre pour la Communication Scientifique Directe). 467–480. 3 indexed citations
9.
Boichut, Yohan, Pierre‐Cyrille Héam, & Olga Kouchnarenko. (2005). Automatic Verification of Security Protocols Using Approximations. HAL (Le Centre pour la Communication Scientifique Directe). 27. 15 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