We stand with Ukraine

We stand with Ukraine

Thomas Seiller

Orcid: 0000-0001-6313-0898

Affiliations:

CNRS, Paris, France

According to our database¹, Thomas Seiller authored at least 40 papers between 2012 and 2023.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2023

Linear Realisability and Cobordisms.

[BibT_eX]

[DOI]

Valentin Maestracci

,

CoRR, 2023

Distributing and Parallelizing Non-canonical Loops.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

Linear Realisability Over Nets and Second Order Quantification (short paper).

[BibT_eX]

[DOI]

,

,

Lorenzo Tortora de Falco

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

pymwp: A Static Analyzer Determining Polynomial Growth Bounds.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

Multiplicative linear logic from a resolution-based tile system.

[BibT_eX]

[DOI]

,

CoRR, 2022

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

CoRR, 2022

Realizing Implicit Computational Complexity.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

CoRR, 2022

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

An implementation of flow calculus for complexity analysis (tool paper).

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

CoRR, 2021

An extended and more practical mwp flow analysis.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

CoRR, 2021

2020

Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution.

[BibT_eX]

[DOI]

,

Jakob Grue Simonsen

CoRR, 2020

Stellar Resolution: Multiplicatives.

[BibT_eX]

[DOI]

,

CoRR, 2020

An Embellished Account of Agafonov's Proof of Agafonov's Theorem.

[BibT_eX]

[DOI]

,

Jakob Grue Simonsen

CoRR, 2020

Lower bounds for prams over Z.

[BibT_eX]

[DOI]

,

CoRR, 2020

Probabilistic Complexity Classes through Semantics.

[BibT_eX]

[DOI]

CoRR, 2020

Zeta Functions and the (Linear) Logic of Markov Processes.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Interaction Graphs: Exponentials.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Finite semantics of polymorphism, complexity and the power of type fixpoints.

[BibT_eX]

[DOI]

Lê Thành Dung Nguyên

,

,

,

Lorenzo Tortora de Falco

CoRR, 2019

2018

Interaction Graphs: Non-Deterministic Automata.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2018

A correspondence between maximal abelian sub-algebras and linear logic fragments.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Coherent Interaction Graphs.

[BibT_eX]

[DOI]

Lê Thành Dung Nguyên

,

Proceedings of the Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2018

PRAMs over integers do not compute maxflow efficiently.

[BibT_eX]

[DOI]

,

CoRR, 2018

2017

An intensionally fully-abstract sheaf model for π (expanded version).

[BibT_eX]

[DOI]

Clovis Eberhart

,

Tom Hirschowitz

,

Log. Methods Comput. Sci., 2017

Loop Quasi-Invariant Chunk Motion by peeling with statement composition.

[BibT_eX]

[DOI]

Jean-Yves Moyen

,

,

Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Interaction graphs: Graphings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

Loop Quasi-Invariant Chunk Detection.

[BibT_eX]

[DOI]

Jean-Yves Moyen

,

,

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Characterizing co-NL by a group action.

[BibT_eX]

[DOI]

Clément Aubert

,

Math. Struct. Comput. Sci., 2016

Logarithmic space and permutations.

[BibT_eX]

[DOI]

Clément Aubert

,

Inf. Comput., 2016

Interaction Graphs: Nondeterministic Automata.

[BibT_eX]

[DOI]

CoRR, 2016

From Dynamic to Static Semantics, Quantitatively.

[BibT_eX]

[DOI]

CoRR, 2016

Interaction graphs: Additives.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

Interaction Graphs: Full Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Unary Resolution: Characterizing Ptime.

[BibT_eX]

[DOI]

Clément Aubert

,

,

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Towards a Complexity-through-Realizability Theory.

[BibT_eX]

[DOI]

CoRR, 2015

Memoization for Unary Logic Programming: Characterizing PTIME.

[BibT_eX]

[DOI]

Clément Aubert

,

,

CoRR, 2015

An Intensionally Fully-abstract Sheaf Model for pi.

[BibT_eX]

[DOI]

Clovis Eberhart

,

Tom Hirschowitz

,

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Logic Programming and Logarithmic Space.

[BibT_eX]

[DOI]

Clément Aubert

,

,

,

Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013

Fully-abstract concurrent games for pi.

[BibT_eX]

[DOI]

Clovis Eberhart

,

Tom Hirschowitz

,

CoRR, 2013

2012

Interaction graphs: Multiplicatives.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

Loading...