Polarized Proof-Nets: Proof-Nets for LC. - Olivier Laurent 001 (TLCA, 1999)

A Token Machine for Full Geometry of Interaction. - Olivier Laurent 001 (TLCA, 2001)

About Translations of Classical Logic into Polarized Linear Logic. - Olivier Laurent 001; Laurent Regnier (LICS, 2003)

Polarized proof-nets and lambda-µ-calculus. - Olivier Laurent 001 (Theor. Comput. Sci., 2003)

Polarized games. - Olivier Laurent 001 (Ann. Pure Appl. Log., 2004)

Polarized and focalized linear and classical proofs. - Olivier Laurent 001; Myriam Quatrini; Lorenzo Tortora de Falco (Ann. Pure Appl. Log., 2005)

Classical isomorphisms of types. - Olivier Laurent 001 (Math. Struct. Comput. Sci., 2005)

Syntax vs. semantics: A polarized approach. - Olivier Laurent 001 (Theor. Comput. Sci., 2005)

The Anatomy of Innocence Revisited. - Russell Harmer; Olivier Laurent 001 (FSTTCS, 2006)

Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity. - Olivier Laurent 001; Lorenzo Tortora de Falco (LICS, 2006)

Quantitative Game Semantics for Linear Logic. - Ugo Dal Lago; Olivier Laurent 001 (CSL, 2008)

Cut Elimination for Monomial MALL Proof Nets. - Olivier Laurent 001; Roberto Maieli (LICS, 2008)

Acyclic Solos and Differential Interaction Nets - Thomas Ehrhard; Olivier Laurent 001 (Log. Methods Comput. Sci., 2010)

Game semantics for first-order logic - Olivier Laurent 001 (Log. Methods Comput. Sci., 2010)

Interpreting a finitary pi-calculus in differential interaction nets. - Thomas Ehrhard; Olivier Laurent 001 (Inf. Comput., 2010)

An exact correspondence between a typed pi-calculus and polarised proof-nets. - Kohei Honda 001; Olivier Laurent 001 (Theor. Comput. Sci., 2010)

Intuitionistic Dual-intuitionistic Nets. - Olivier Laurent 001 (J. Log. Comput., 2011)

Intersection Types with Subtyping by Means of Cut Elimination. - Olivier Laurent 001 (Fundam. Informaticae, 2012)

Focusing in Orthologic. - Olivier Laurent 001 (Log. Methods Comput. Sci., 2017)

Around Classical and Intuitionistic Linear Logics. - Olivier Laurent 001 (LICS, 2018)

Intersection Subtyping with Constructors. - Olivier Laurent 001 (DCM/ITRS, 2018)

Resource-Tracking Concurrent Games. - Aurore Alcolei; Pierre Clairambault; Olivier Laurent 001 (FoSSaCS, 2019)

Super Exponentials in Linear Logic. - Esaïe Bauer; Olivier Laurent 001 (Linearity&TLLA@IJCAR-FSCD, 2020)

Polynomial time in untyped elementary linear logic. - Olivier Laurent 001 (Theor. Comput. Sci., 2020)

An anti-locally-nameless approach to formalizing quantifiers. - Olivier Laurent 001 (CPP, 2021)

Type Isomorphisms for Multiplicative-Additive Linear Logic. - Rémi Di Guardia; Olivier Laurent 001 (FSCD, 2023)

Yeo's Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic. - Rémi Di Guardia; Olivier Laurent 001; Lorenzo Tortora de Falco; Lionel Vaux Auclair (FSCD, 2025)