Timeless Games. - Patrick Baillot; Vincent Danos; Thomas Ehrhard; Laurent Regnier (CSL, 1997)

Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. - Patrick Baillot; Vincent Danos; Thomas Ehrhard; Laurent Regnier (LICS, 1997)

Elementary Complexity and Geometry of Interaction. - Patrick Baillot; Marco Pedicini (Fundam. Informaticae, 2001)

Checking Polynomial Time Complexity with Types. - Patrick Baillot (IFIP TCS, 2002)

Mobile Multi-Agent Systems: A Programming Language and Its Semantics. - Alexandru Suna; Amal El Fallah Seghrouchni; Christophe Fouqueré; Patrick Baillot (AAMAS, 2004)

Soft lambda-Calculus: A Language for Polynomial Time Computation. - Patrick Baillot; Virgile Mogbil (FoSSaCS, 2004)

Stratified coherence spaces: a denotational semantics for light linear logic. - Patrick Baillot (Theor. Comput. Sci., 2004)

Type inference for light affine logic via constraints on words. - Patrick Baillot (Theor. Comput. Sci., 2004)

A Feasible Algorithm for Typing in Elementary Affine Logic. - Patrick Baillot; Kazushige Terui (TLCA, 2005)

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. - Vincent Atassi; Patrick Baillot; Kazushige Terui (CSL, 2006)

An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus - Patrick Baillot; Marco Pedicini (CoRR, 2006)

On light logics, uniform encodings and polynomial time. - Ugo Dal Lago; Patrick Baillot (Math. Struct. Comput. Sci., 2006)

From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. - Patrick Baillot (TLCA, 2007)

Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. - Vincent Atassi; Patrick Baillot; Kazushige Terui (Log. Methods Comput. Sci., 2007)

An affine-intuitionistic system of types and effects: confluence and termination - Roberto M. Amadio; Patrick Baillot; Antoine Madet (CoRR, 2009)

Light types for polynomial time computation in lambda calculus. - Patrick Baillot; Kazushige Terui (Inf. Comput., 2009)

Guest editorial: Special issue on implicit computational complexity. - Patrick Baillot; Jean-Yves Marion; Simona Ronchi Della Rocca (ACM Trans. Comput. Log., 2009)

A PolyTime Functional Language from Light Linear Logic. - Patrick Baillot; Marco Gaboardi; Virgile Mogbil (ESOP, 2010)

Type inference in intuitionistic linear logic. - Patrick Baillot; Martin Hofmann 001 (PPDP, 2010)

Linear logic by levels and bounded time complexity. - Patrick Baillot; Damiano Mazza (Theor. Comput. Sci., 2010)

Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. - Patrick Baillot (APLAS, 2011)

Light logics and optimal reduction: Completeness and complexity. - Patrick Baillot; Paolo Coppola 001; Ugo Dal Lago (Inf. Comput., 2011)

On quasi-interpretations, blind abstractions and implicit complexity. - Patrick Baillot; Ugo Dal Lago; Jean-Yves Moyen (Math. Struct. Comput. Sci., 2012)

On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. - Patrick Baillot (Inf. Comput., 2015)

Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. - Patrick Baillot; Anupam Das 002 (CSL, 2016)

Higher-order interpretations and program complexity. - Patrick Baillot; Ugo Dal Lago (Inf. Comput., 2016)

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. - Patrick Baillot; Erika De Benedetti; Simona Ronchi Della Rocca (Inf. Comput., 2018)

Types for Parallel Complexity in the Pi-calculus. - Patrick Baillot; Alexis Ghyselen (CoRR, 2019)

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. - Patrick Baillot; Gilles Barthe; Ugo Dal Lago (J. Autom. Reason., 2019)

Combining linear logic and size types for implicit complexity. - Patrick Baillot; Alexis Ghyselen (Theor. Comput. Sci., 2020)

Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes. - Patrick Baillot; Alexis Ghyselen; Naoki Kobayashi 001 (CONCUR, 2021)

Types for Complexity of Parallel Computation in Pi-calculus. - Patrick Baillot; Alexis Ghyselen (ACM Trans. Program. Lang. Syst., 2022)

Bunched Fuzz: Sensitivity for Vector Metrics. - june wunder; Arthur Azevedo de Amorim; Patrick Baillot; Marco Gaboardi (ESOP, 2023)

On Basic Feasible Functionals and the Interpretation Method. - Patrick Baillot; Ugo Dal Lago; Cynthia Kop; Deivid Vale (FoSSaCS (2), 2024)

A Linear Type System for L^p-Metric Sensitivity Analysis. - Victor Sannier; Patrick Baillot (FSCD, 2024)

A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs. - Leandro Gomes 001; Patrick Baillot; Marco Gaboardi (CSL, 2025)

BiGKAT: An Algebraic Framework for Relational Verification of Probabilistic Programs. - Leandro Gomes 001; Patrick Baillot; Marco Gaboardi (FoSSaCS, 2025)