Thomas Seiller

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 37

Top Topics

Monadic Datalog

Complexity Analysis

Top Venues

Math. Struct. Comput. Sci.

Ann. Pure Appl. Log.

Publications

Ulysse Léchine, Thomas Seiller, Jakob Grue Simonsen
Agafonov's Theorem for Probabilistic Selectors. MFCS (2024)
Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco
Linear Realisability Over Nets and Second Order Quantification (short paper). ICTCS (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
pymwp: A Static Analyzer Determining Polynomial Growth Bounds. ATVA (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
Distributing and Parallelizing Non-canonical Loops. VMCAI (2023)
Valentin Maestracci, Thomas Seiller
Linear Realisability and Cobordisms. CoRR (2023)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
Realizing Implicit Computational Complexity. CoRR (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. CoRR (2022)
Boris Eng, Thomas Seiller
Multiplicative linear logic from a resolution-based tile system. CoRR (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. CoRR (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. FSCD (2022)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
An extended and more practical mwp flow analysis. CoRR (2021)
Eric Finster, Samuel Mimram, Maxime Lucas, Thomas Seiller
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory. MFPS (2021)
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
An implementation of flow calculus for complexity analysis (tool paper). CoRR (2021)
Thomas Seiller, Jakob Grue Simonsen
Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution. CoRR (2020)
Thomas Seiller
Probabilistic Complexity Classes through Semantics. CoRR (2020)
Luc Pellissier, Thomas Seiller
Lower bounds for prams over Z. CoRR (2020)
Thomas Seiller, Jakob Grue Simonsen
An Embellished Account of Agafonov's Proof of Agafonov's Theorem. CoRR (2020)
Boris Eng, Thomas Seiller
Stellar Resolution: Multiplicatives. CoRR (2020)
Thomas Seiller
Zeta Functions and the (Linear) Logic of Markov Processes. CoRR (2020)
Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco
Finite semantics of polymorphism, complexity and the power of type fixpoints. CoRR (2019)
Thomas Seiller
Interaction Graphs: Exponentials. Log. Methods Comput. Sci. 15 (3) (2019)
Lê Thành Dung Nguyên, Thomas Seiller
Coherent Interaction Graphs. Linearity-TLLA@FLoC (2018)
Thomas Seiller
A correspondence between maximal abelian sub-algebras and linear logic fragments. Math. Struct. Comput. Sci. 28 (1) (2018)
Luc Pellissier, Thomas Seiller
PRAMs over integers do not compute maxflow efficiently. CoRR (2018)
Thomas Seiller
Interaction Graphs: Non-Deterministic Automata. ACM Trans. Comput. Log. 19 (3) (2018)
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
An intensionally fully-abstract sheaf model for π (expanded version). Log. Methods Comput. Sci. 13 (4) (2017)
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
An intensionally fully-abstract sheaf model for π (expanded version). CoRR (2017)
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Motion by peeling with statement composition. DICE-FOPARA@ETAPS (2017)
Thomas Seiller
Interaction graphs: Graphings. Ann. Pure Appl. Log. 168 (2) (2017)
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Detection. ATVA (2017)
Clément Aubert, Thomas Seiller
Logarithmic space and permutations. Inf. Comput. 248 (2016)
Thomas Seiller
Interaction Graphs: Full Linear Logic. LICS (2016)
Clément Aubert, Thomas Seiller
Characterizing co-NL by a group action. Math. Struct. Comput. Sci. 26 (4) (2016)
Thomas Seiller
From Dynamic to Static Semantics, Quantitatively. CoRR (2016)
Thomas Seiller
Interaction Graphs: Nondeterministic Automata. CoRR (2016)
Clément Aubert, Marc Bagnol, Thomas Seiller
Unary Resolution: Characterizing Ptime. FoSSaCS (2016)
Thomas Seiller
Interaction graphs: Additives. Ann. Pure Appl. Log. 167 (2) (2016)
Thomas Seiller
Interaction Graphs: Full Linear Logic. CoRR (2015)
Clément Aubert, Marc Bagnol, Thomas Seiller
Memoization for Unary Logic Programming: Characterizing PTIME. CoRR (2015)
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
An Intensionally Fully-abstract Sheaf Model for pi. CALCO (2015)
Thomas Seiller
Towards a Complexity-through-Realizability Theory. CoRR (2015)
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
Logic Programming and Logarithmic Space. CoRR (2014)
Thomas Seiller
A Correspondence between Maximal Abelian Sub-Algebras and Linear Logic Fragments. CoRR (2014)
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
Logic Programming and Logarithmic Space. APLAS (2014)
Thomas Seiller
Interaction Graphs: Graphings. CoRR (2014)
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
Fully-abstract concurrent games for pi. CoRR (2013)
Thomas Seiller
Interaction Graphs: Exponentials. CoRR (2013)
Thomas Seiller, Clément Aubert
Logarithmic Space and Permutations CoRR (2013)
Thomas Seiller
Interaction graphs: Multiplicatives. Ann. Pure Appl. Log. 163 (12) (2012)
Clément Aubert, Thomas Seiller
Characterizing co-NL by a group action CoRR (2012)
Thomas Seiller
Interaction Graphs: Multiplicatives CoRR (2012)
Thomas Seiller
Interaction Graphs: Additives CoRR (2012)