Thomas Seiller

59 papers A* 1B 10Journal 43Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Linear Realisability and Implicative Algebras.
CoRR
Alexandre Lucquin, Luc Pellissier, Thomas Seiller
2025 B conf
Linear Realisability over Nets: Multiplicatives.
CSL
Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco
2024 B conf
Agafonov's Theorem for Probabilistic Selectors.
MFCS
Ulysse Léchine, Thomas Seiller, Jakob Grue Simonsen
2024 J jnl
Linear Realisability over nets: multiplicatives (long version).
CoRR
Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco
2024 — book
Mathematical Informatics: Outline of a mathematical theory of computer science.
Thomas Seiller
2024 J jnl
Unifying lower bounds for algebraic machines, semantically.
Inf. Comput.
Thomas Seiller, Luc Pellissier, Ulysse Léchine
2024 J jnl
Zeta Functions and the (Linear) Logic of Markov Processes.
Log. Methods Comput. Sci.
Thomas Seiller
2023 B conf
Distributing and Parallelizing Non-canonical Loops.
VMCAI
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2023 — conf
Linear Realisability Over Nets and Second Order Quantification (short paper).
ICTCS
Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco
2023 J jnl
Linear Realisability and Cobordisms.
CoRR
Valentin Maestracci, Thomas Seiller
2023 B conf
pymwp: A Static Analyzer Determining Polynomial Growth Bounds.
ATVA
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2022 J jnl
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity.
CoRR
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2022 J jnl
Multiplicative linear logic from a resolution-based tile system.
CoRR
Boris Eng, Thomas Seiller
2022 J jnl
Realizing Implicit Computational Complexity.
CoRR
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2022 B conf
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.
FSCD
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2022 J jnl
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.
CoRR
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2021 B conf
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory.
MFPS
Eric Finster, Samuel Mimram, Maxime Lucas, Thomas Seiller
2021 J jnl
An extended and more practical mwp flow analysis.
CoRR
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2021 J jnl
An implementation of flow calculus for complexity analysis (tool paper).
CoRR
Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller
2020 J jnl
Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution.
CoRR
Thomas Seiller, Jakob Grue Simonsen
2020 J jnl
An Embellished Account of Agafonov's Proof of Agafonov's Theorem.
CoRR
Thomas Seiller, Jakob Grue Simonsen
2020 J jnl
Lower bounds for prams over Z.
CoRR
Luc Pellissier, Thomas Seiller
2020 J jnl
Probabilistic Complexity Classes through Semantics.
CoRR
Thomas Seiller
2020 J jnl
Stellar Resolution: Multiplicatives.
CoRR
Boris Eng, Thomas Seiller
2020 J jnl
Zeta Functions and the (Linear) Logic of Markov Processes.
CoRR
Thomas Seiller
2019 J jnl
Finite semantics of polymorphism, complexity and the power of type fixpoints.
CoRR
Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco
2019 J jnl
Interaction Graphs: Exponentials.
Log. Methods Comput. Sci.
Thomas Seiller
2019 — ed.
Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2019, Prague, Czech Republic, April 6-7, 2019.
DICE-FOPARA@ETAPS
Thomas Seiller, Steffen Jost
2018 J jnl
A correspondence between maximal abelian sub-algebras and linear logic fragments.
Math. Struct. Comput. Sci.
Thomas Seiller
2018 — conf
Coherent Interaction Graphs.
Linearity-TLLA@FLoC
Lê Thành Dung Nguyên, Thomas Seiller
2018 J jnl
Interaction Graphs: Non-Deterministic Automata.
ACM Trans. Comput. Log.
Thomas Seiller
2018 J jnl
PRAMs over integers do not compute maxflow efficiently.
CoRR
Luc Pellissier, Thomas Seiller
2017 J jnl
An intensionally fully-abstract sheaf model for π (expanded version).
CoRR
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
2017 J jnl
An intensionally fully-abstract sheaf model for π (expanded version).
Log. Methods Comput. Sci.
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
2017 J jnl
Interaction graphs: Graphings.
Ann. Pure Appl. Log.
Thomas Seiller
2017 B conf
Loop Quasi-Invariant Chunk Detection.
ATVA
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
2017 — conf
Loop Quasi-Invariant Chunk Motion by peeling with statement composition.
DICE-FOPARA@ETAPS
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
2016 J jnl
Characterizing co-NL by a group action.
Math. Struct. Comput. Sci.
Clément Aubert, Thomas Seiller
2016 J jnl
From Dynamic to Static Semantics, Quantitatively.
CoRR
Thomas Seiller
2016 A* conf
Interaction Graphs: Full Linear Logic.
LICS
Thomas Seiller
2016 J jnl
Interaction Graphs: Nondeterministic Automata.
CoRR
Thomas Seiller
2016 J jnl
Interaction graphs: Additives.
Ann. Pure Appl. Log.
Thomas Seiller
2016 J jnl
Logarithmic space and permutations.
Inf. Comput.
Clément Aubert, Thomas Seiller
2016 B conf
Unary Resolution: Characterizing Ptime.
FoSSaCS
Clément Aubert, Marc Bagnol, Thomas Seiller
2015 B conf
An Intensionally Fully-abstract Sheaf Model for pi.
CALCO
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
2015 J jnl
Interaction Graphs: Full Linear Logic.
CoRR
Thomas Seiller
2015 J jnl
Memoization for Unary Logic Programming: Characterizing PTIME.
CoRR
Clément Aubert, Marc Bagnol, Thomas Seiller
2015 J jnl
Towards a Complexity-through-Realizability Theory.
CoRR
Thomas Seiller
2014 J jnl
A Correspondence between Maximal Abelian Sub-Algebras and Linear Logic Fragments.
CoRR
Thomas Seiller
2014 J jnl
Interaction Graphs: Graphings.
CoRR
Thomas Seiller
2014 B conf
Logic Programming and Logarithmic Space.
APLAS
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
2014 J jnl
Logic Programming and Logarithmic Space.
CoRR
Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller
2013 J jnl
Fully-abstract concurrent games for pi.
CoRR
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
2013 J jnl
Interaction Graphs: Exponentials.
CoRR
Thomas Seiller
2013 J jnl
Logarithmic Space and Permutations
CoRR
Thomas Seiller, Clément Aubert
2012 J jnl
Characterizing co-NL by a group action
CoRR
Clément Aubert, Thomas Seiller
2012 J jnl
Interaction Graphs: Additives
CoRR
Thomas Seiller
2012 J jnl
Interaction Graphs: Multiplicatives
CoRR
Thomas Seiller
2012 J jnl
Interaction graphs: Multiplicatives.
Ann. Pure Appl. Log.
Thomas Seiller