Patrick Baillot

624 total citations
18 papers, 97 citations indexed

About

Patrick Baillot is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Patrick Baillot has authored 18 papers receiving a total of 97 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 13 papers in Computational Theory and Mathematics and 1 paper in Computer Networks and Communications. Recurrent topics in Patrick Baillot's work include Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (11 papers) and Formal Methods in Verification (10 papers). Patrick Baillot is often cited by papers focused on Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (11 papers) and Formal Methods in Verification (10 papers). Patrick Baillot collaborates with scholars based in France, Italy and Japan. Patrick Baillot's co-authors include Kazushige Terui, Ugo Dal Lago, Damiano Mazza, Thomas Ehrhard, Vincent Danos, Laurent Régnier, Simona Ronchi Della Rocca and Gilles Barthe and has published in prestigious journals such as Theoretical Computer Science, ACM Transactions on Programming Languages and Systems and Information and Computation.

In The Last Decade

Patrick Baillot

14 papers receiving 92 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Patrick Baillot France 7 97 84 5 4 1 18 97
Lutz Straßburger France 7 98 1.0× 90 1.1× 6 1.2× 4 1.0× 22 116
Daniel Reidenbach United Kingdom 7 114 1.2× 112 1.3× 3 0.6× 5 1.3× 2 2.0× 23 119
Cyril Nicaud France 4 41 0.4× 49 0.6× 3 0.6× 5 1.3× 19 63
Pietro Di Gianantonio Italy 6 104 1.1× 105 1.3× 5 1.0× 12 3.0× 3 3.0× 20 122
Yuxi Fu China 5 92 0.9× 82 1.0× 6 1.2× 18 4.5× 27 105
Alessio Guglielmi United Kingdom 6 142 1.5× 112 1.3× 5 1.0× 12 3.0× 18 158
Zoran Petrić Serbia 8 80 0.8× 78 0.9× 1 0.2× 3 0.8× 39 166
Christine Tasson France 6 77 0.8× 59 0.7× 3 0.6× 20 5.0× 17 92
Marek Zawadowski Poland 6 102 1.1× 86 1.0× 5 1.3× 1 1.0× 18 144

Countries citing papers authored by Patrick Baillot

Since Specialization
Citations

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

Fields of papers citing papers by Patrick Baillot

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Patrick Baillot

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

All Works

18 of 18 papers shown
1.
Baillot, Patrick, et al.. (2022). Types for Complexity of Parallel Computation in Pi-calculus. ACM Transactions on Programming Languages and Systems. 44(3). 1–50.
2.
Baillot, Patrick, et al.. (2021). Types for Complexity of Parallel Computation in Pi-Calculus. 2 indexed citations
3.
Baillot, Patrick, Gilles Barthe, & Ugo Dal Lago. (2019). Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. Journal of Automated Reasoning. 63(4). 813–855.
4.
Baillot, Patrick, et al.. (2019). Combining linear logic and size types for implicit complexity. Theoretical Computer Science. 813. 70–99.
5.
Baillot, Patrick, et al.. (2018). Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Information and Computation. 261. 55–77.
6.
Baillot, Patrick & Ugo Dal Lago. (2016). Higher-order interpretations and program complexity. Information and Computation. 248. 56–81. 3 indexed citations
7.
Baillot, Patrick. (2014). On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. Information and Computation. 241. 3–31. 4 indexed citations
8.
Baillot, Patrick, et al.. (2012). On quasi-interpretations, blind abstractions and implicit complexity. Mathematical Structures in Computer Science. 22(4). 549–580. 1 indexed citations
9.
Baillot, Patrick, et al.. (2010). Light logics and optimal reduction: Completeness and complexity. Information and Computation. 209(2). 118–142. 6 indexed citations
10.
Baillot, Patrick & Damiano Mazza. (2009). Linear logic by levels and bounded time complexity. Theoretical Computer Science. 411(2). 470–503. 9 indexed citations
11.
Baillot, Patrick & Kazushige Terui. (2008). Light types for polynomial time computation in lambda calculus. Information and Computation. 207(1). 41–62. 20 indexed citations
12.
Baillot, Patrick, et al.. (2007). Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. Logical Methods in Computer Science. Volume 3, Issue 4. 6 indexed citations
13.
Lago, Ugo Dal & Patrick Baillot. (2006). On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science. 16(4). 713–733. 11 indexed citations
14.
Baillot, Patrick. (2004). Type inference for light affine logic via constraints on words. Theoretical Computer Science. 328(3). 289–323. 4 indexed citations
15.
Baillot, Patrick. (2004). Stratified coherence spaces: a denotational semantics for light linear logic. Theoretical Computer Science. 318(1-2). 29–55. 2 indexed citations
16.
Baillot, Patrick & Kazushige Terui. (2004). Light types for polynomial time computation in lambda-calculus. arXiv (Cornell University). 11. 266–275. 1 indexed citations
17.
Baillot, Patrick. (2003). Stratified coherence spaces: a denotational semantics for light linear logic. Theoretical Computer Science. 318(1-2). 29–55. 16 indexed citations
18.
Baillot, Patrick, Vincent Danos, Thomas Ehrhard, & Laurent Régnier. (1997). Timeless Games. 56–77. 12 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 Lutz Straßburger Breakdown of academic impact, for papers by Daniel Reidenbach Breakdown of academic impact, for papers by Cyril Nicaud Breakdown of academic impact, for papers by Pietro Di Gianantonio Breakdown of academic impact, for papers by Yuxi Fu Breakdown of academic impact, for papers by Alessio Guglielmi Breakdown of academic impact, for papers by Zoran Petrić Breakdown of academic impact, for papers by Christine Tasson Breakdown of academic impact, for papers by Marek Zawadowski
Rankless by CCL
2026