Lê Thành Dũng Nguyen, Thomas Seiller. Coherent Interaction Graphs. Electronic Proceedings in Theoretical Computer Science, EPTCS, 2019, 292, pp.104-117. ⟨10.4204/EPTCS.292.6⟩. ⟨hal-02345618⟩

Thomas Seiller. Interaction Graphs: Exponentials. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019, ⟨10.23638/LMCS-15(3:25)2019}⟩. ⟨hal-02345568⟩

Thomas Seiller. A correspondence between maximal abelian sub-algebras and linear logic fragments. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 28 (01), pp.77 - 139. ⟨10.1017/S0960129516000062⟩. ⟨hal-01922452⟩

Thomas Seiller. Interaction Graphs: Nondeterministic Automata. ACM Transactions on Computational Logic, Association for Computing Machinery, 2018, 19 (3), pp.1 - 24. ⟨10.1145/3226594⟩. ⟨hal-01922445⟩

Thomas Seiller. Interaction graphs: Graphings. Annals of Pure and Applied Logic, Elsevier Masson, 2017, 168 (2), pp.278 - 320. ⟨10.1016/j.apal.2016.10.007⟩. ⟨hal-01922459⟩

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller. An intensionally fully-abstract sheaf model for pi (expanded version). Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2017, 13 (4), pp.9. ⟨10.23638/LMCS-13(4:9)2017⟩. ⟨hal-01609945v2⟩

Clément Aubert, Thomas Seiller. Logarithmic space and permutations. Information and Computation, Elsevier, 2016, 248, pp.2-21. ⟨10.1016/j.ic.2014.01.018⟩. ⟨hal-02345670⟩

Thomas Seiller. Interaction graphs: Additives. Annals of Pure and Applied Logic, Elsevier Masson, 2016, 167 (2), pp.95 - 154. ⟨10.1016/j.apal.2015.10.001⟩. ⟨hal-01922470⟩

Thomas Seiller, Christian Retoré. Recension de "The blind spot. Lectures on logic" par J.-Y. Girard (European Mathematical Society, 2011).. Gazette des Mathématiciens, Société Mathématique de France, 2014, 142, pp.136-143. ⟨hal-01076369⟩

Clément Aubert, Thomas Seiller. Characterizing co-NL by a group action. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2014, First View, pp.1--33. ⟨10.1017/S0960129514000267⟩. ⟨hal-01005705⟩

Thomas Seiller. Interaction Graphs: Multiplicatives. Annals of Pure and Applied Logic, Elsevier Masson, 2012, 163 (12), pp.1808-1837. ⟨10.1016/j.apal.2012.04.005⟩. ⟨hal-01159218⟩

Clément Aubert, Marc Bagnol, Thomas Seiller. Unary Resolution: Characterizing Ptime.. Foundations of Software Science and Computation Structures (FOSSACS), Apr 2016, Eindhoven, Netherlands. pp.373-389, ⟨10.1007/978-3-662-49630-5_22⟩. ⟨hal-01321239⟩

Thomas Seiller. Interaction Graphs: Full Linear Logic. IEEE/ACM Logic in Computer Science (LICS) 2016, Jul 2016, New-York, United States. ⟨10.1145/2933575.2934568⟩. ⟨hal-01312688⟩

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller. An Intensionally Fully-abstract Sheaf Model for pi. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, Nimègue, Netherlands. pp.86--100, ⟨10.4230/LIPIcs.CALCO.2015.86⟩. ⟨hal-00873626v2⟩

Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller. Logic Programming and Logarithmic Space. 12th Asian Symposium, APLAS 2014, Oct 2014, Singapour, Singapore. pp.39-57, ⟨10.1007/978-3-319-12736-1_3⟩. ⟨hal-01309159⟩

Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller. Loop Quasi-Invariant Chunk Detection. Automated Technology for Verification and Analysis. ATVA 2017, pp.91-108, 2017, ⟨10.1007/978-3-319-68167-2_7⟩. ⟨hal-02345688⟩

Alberto Naibo, Mattia Petrolo, Thomas Seiller. Verificationism and classical realizability. Perspectives on Interrogative Models of Inquiry, 8, Springer, pp.163-197, 2016, Logic, Argumentation & Reasoning, 978-3-319-20761-2. ⟨10.1007/978-3-319-20762-9_9⟩. ⟨hal-01251229⟩

Alberto Naibo, Mattia Petrolo, Thomas Seiller. On the computational meaning of axioms. Epistemology, Knowledge and the Impact of Interaction, 38, Springer, pp. 141-184, 2016, Logic, Epistemology, and the Unity of Science, 978-3-319-26504-9. ⟨10.1007/978-3-319-26506-3_5⟩. ⟨halshs-01313400⟩

Boris Eng, Thomas Seiller. Multiplicative Linear Logic from Logic Programs and Tilings. 2021. ⟨hal-02895111v3⟩

Thomas Seiller. Zeta Functions and the (Linear) Logic of Markov Processes. 2021. ⟨hal-02458330v3⟩

Luc Pellissier, Thomas Seiller. Lower bounds for algebraic machines, semantically. 2021. ⟨hal-02487667v2⟩

Jean-Baptiste Joinet, Thomas Seiller. From abstraction and indiscernibility to classification and types: revisiting Hermann Weyl’s theory of ideal elements. 2021. ⟨hal-03128018⟩

Luc Pellissier, Thomas Seiller. PRAMs over integers do not compute maxflow efficiently. 2021. ⟨hal-01921942v2⟩

Thomas Seiller. Probabilistic Complexity Classes through Semantics. 2020. ⟨hal-02458358⟩

Thomas Seiller, Jakob Simonsen. An Embellished Account of Agafonov's Proof of Agafonov's Theorem. 2020. ⟨hal-02891463⟩

Thomas Seiller, Jakob Simonsen. Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution. 2020. ⟨hal-02993635⟩

Lê Thành Dũng Nguyễn, Thomas Seiller, Paolo Pistone, Lorenzo Tortora de Falco. Finite semantics of polymorphism, complexity and the power of type fixpoints. 2019. ⟨hal-01979009⟩

Thomas Seiller. Interaction Graphs: Full Linear Logic. 2015. ⟨hal-01141292⟩

Alberto Naibo, Mattia Petrolo, Thomas Seiller. On the Computational Meaning of Axioms. 2014. ⟨hal-00930222⟩

Clément Aubert, Thomas Seiller. Logarithmic Space and Permutations. 2013. ⟨hal-01005701⟩

Clément Aubert, Marc Bagnol, Thomas Seiller. Memoization for Unary Logic Programming: Characterizing PTIME. [Research Report] RR-8796, INRIA Grenoble - Rhône-Alpes; Université Paris-Est, LACL (EA 4219), UPEC, F-94010 Créteil, France; Aix Marseille Université, CNRS, Centrale Marseille, I2M UMR 7373, 13453, Marseille, France; IHÉS. 2015, pp.28. ⟨hal-01107377v3⟩

Thomas Seiller. Logique dans le Facteur Hyperfini: Géométrie de l'Interaction et Complexité. Logique [math.LO]. Aix-Marseille Université, 2012. Français. ⟨tel-00768403⟩