Interaction graphs: Multiplicatives. - Thomas Seiller (Ann. Pure Appl. Log., 2012)

Fully-abstract concurrent games for pi. - Clovis Eberhart; Tom Hirschowitz; Thomas Seiller (CoRR, 2013)

Logic Programming and Logarithmic Space. - Clément Aubert; Marc Bagnol; Paolo Pistone; Thomas Seiller (APLAS, 2014)

An Intensionally Fully-abstract Sheaf Model for pi. - Clovis Eberhart; Tom Hirschowitz; Thomas Seiller (CALCO, 2015)

Memoization for Unary Logic Programming: Characterizing PTIME. - Clément Aubert; Marc Bagnol; Thomas Seiller (CoRR, 2015)

Towards a Complexity-through-Realizability Theory. - Thomas Seiller (CoRR, 2015)

Unary Resolution: Characterizing Ptime. - Clément Aubert; Marc Bagnol; Thomas Seiller (FoSSaCS, 2016)

Interaction Graphs: Full Linear Logic. - Thomas Seiller (LICS, 2016)

Interaction graphs: Additives. - Thomas Seiller (Ann. Pure Appl. Log., 2016)

From Dynamic to Static Semantics, Quantitatively. - Thomas Seiller (CoRR, 2016)

Interaction Graphs: Nondeterministic Automata. - Thomas Seiller (CoRR, 2016)

Logarithmic space and permutations. - Clément Aubert; Thomas Seiller (Inf. Comput., 2016)

Characterizing co-NL by a group action. - Clément Aubert; Thomas Seiller (Math. Struct. Comput. Sci., 2016)

Loop Quasi-Invariant Chunk Detection. - Jean-Yves Moyen; Thomas Rubiano; Thomas Seiller (ATVA, 2017)

Interaction graphs: Graphings. - Thomas Seiller (Ann. Pure Appl. Log., 2017)

Loop Quasi-Invariant Chunk Motion by peeling with statement composition. - Jean-Yves Moyen; Thomas Rubiano; Thomas Seiller (DICE-FOPARA@ETAPS, 2017)

An intensionally fully-abstract sheaf model for π (expanded version). - Clovis Eberhart; Tom Hirschowitz; Thomas Seiller (Log. Methods Comput. Sci., 2017)

PRAMs over integers do not compute maxflow efficiently. - Luc Pellissier; Thomas Seiller (CoRR, 2018)

Coherent Interaction Graphs. - Lê Thành Dung Nguyên; Thomas Seiller (Linearity-TLLA@FLoC, 2018)

A correspondence between maximal abelian sub-algebras and linear logic fragments. - Thomas Seiller (Math. Struct. Comput. Sci., 2018)

Interaction Graphs: Non-Deterministic Automata. - Thomas Seiller (ACM Trans. Comput. Log., 2018)

Finite semantics of polymorphism, complexity and the power of type fixpoints. - Lê Thành Dung Nguyên; Paolo Pistone; Thomas Seiller; Lorenzo Tortora de Falco (CoRR, 2019)

Interaction Graphs: Exponentials. - Thomas Seiller (Log. Methods Comput. Sci., 2019)

Probabilistic Complexity Classes through Semantics. - Thomas Seiller (CoRR, 2020)

Lower bounds for prams over Z. - Luc Pellissier; Thomas Seiller (CoRR, 2020)

An Embellished Account of Agafonov's Proof of Agafonov's Theorem. - Thomas Seiller; Jakob Grue Simonsen (CoRR, 2020)

Stellar Resolution: Multiplicatives. - Boris Eng; Thomas Seiller (CoRR, 2020)

Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution. - Thomas Seiller; Jakob Grue Simonsen (CoRR, 2020)

An extended and more practical mwp flow analysis. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2021)

An implementation of flow calculus for complexity analysis (tool paper). - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2021)

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory. - Eric Finster; Samuel Mimram; Maxime Lucas; Thomas Seiller (MFPS, 2021)

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (FSCD, 2022)

Realizing Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2022)

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2022)

Multiplicative linear logic from a resolution-based tile system. - Boris Eng; Thomas Seiller (CoRR, 2022)

pymwp: A Static Analyzer Determining Polynomial Growth Bounds. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (ATVA, 2023)

Linear Realisability Over Nets and Second Order Quantification (short paper). - Adrien Ragot; Thomas Seiller; Lorenzo Tortora de Falco (ICTCS, 2023)

Distributing and Parallelizing Non-canonical Loops. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (VMCAI, 2023)

Linear Realisability and Cobordisms. - Valentin Maestracci; Thomas Seiller (CoRR, 2023)

Mathematical Informatics: Outline of a mathematical theory of computer science. - Thomas Seiller (2024)

Agafonov's Theorem for Probabilistic Selectors. - Ulysse Léchine; Thomas Seiller; Jakob Grue Simonsen (MFCS, 2024)

Linear Realisability over nets: multiplicatives (long version). - Adrien Ragot; Thomas Seiller; Lorenzo Tortora de Falco (CoRR, 2024)

Unifying lower bounds for algebraic machines, semantically. - Thomas Seiller; Luc Pellissier; Ulysse Léchine (Inf. Comput., 2024)

Zeta Functions and the (Linear) Logic of Markov Processes. - Thomas Seiller (Log. Methods Comput. Sci., 2024)

Linear Realisability over Nets: Multiplicatives. - Adrien Ragot; Thomas Seiller; Lorenzo Tortora de Falco (CSL, 2025)