Suivre
Thomas Seiller
Titre
Citée par
Citée par
Année
Interaction graphs: multiplicatives
T Seiller
Annals of Pure and Applied Logic 163 (12), 1808-1837, 2012
362012
Characterizing co-NL by a group action
C Aubert, T Seiller
Mathematical Structures in Computer Science 26 (4), 606-638, 2016
352016
Interaction graphs: Additives
T Seiller
Annals of Pure and Applied Logic 167 (2), 95-154, 2016
34*2016
Logarithmic space and permutations
C Aubert, T Seiller
Information and Computation 248, 2-21, 2016
322016
Logique dans le facteur hyperfini: géometrie de l'interaction et complexité
T Seiller
Aix-Marseille Université, 2012
292012
Interaction graphs: Graphings
T Seiller
Annals of Pure and Applied Logic 168 (2), 278-320, 2017
242017
Interaction graphs: Full linear logic
T Seiller
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
202016
Unary resolution: Characterizing ptime
C Aubert, M Bagnol, T Seiller
International Conference on Foundations of Software Science and Computation …, 2016
202016
An Intensionally Fully-abstract Sheaf Model for pi
C Eberhart, T Hirschowitz, T Seiller
LIPIcs-Leibniz International Proceedings in Informatics 35, 2015
20*2015
Logic programming and logarithmic space
C Aubert, M Bagnol, P Pistone, T Seiller
Asian Symposium on Programming Languages and Systems, 39-57, 2014
192014
Interaction graphs: Exponentials
T Seiller
Logical Methods in Computer Science 15, 2019
162019
Interaction graphs: Non-deterministic automata
T Seiller
ACM Transactions on Computational Logic (TOCL) 19 (3), 1-24, 2018
162018
On the Computational Meaning of Axioms
A Naibo, M Petrolo, T Seiller
16*
A correspondence between maximal abelian sub-algebras and linear logic fragments
T Seiller
Mathematical Structures in Computer Science 28 (1), 77-139, 2018
142018
Towards a complexity-through-realisability theory
T Seiller
arXiv preprint arXiv:1502.01257, 2015
11*2015
Memoization for unary logic programming: Characterizing ptime
C Aubert, M Bagnol, T Seiller
arXiv preprint arXiv:1501.05104, 2015
72015
Verificationism and classical realizability
A Naibo, M Petrolo, T Seiller
Perspectives on Interrogative Models of Inquiry, 163-197, 2016
52016
Interaction graphs and complexity
T Seiller
Abstract, 2014
52014
PRAMs over integers do not compute maxflow efficiently
L Pellissier, T Seiller
arXiv preprint arXiv:1811.06787, 2018
42018
From dynamic to static semantics, quantitatively
T Seiller
arXiv preprint arXiv:1604.05047, 2016
4*2016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20