| Interaction graphs: multiplicatives T Seiller Annals of Pure and Applied Logic 163 (12), 1808-1837, 2012 | 41 | 2012 |
| Interaction graphs: Additives T Seiller Annals of Pure and Applied Logic 167 (2), 95-154, 2016 | 39* | 2016 |
| Characterizing co-NL by a group action C Aubert, T Seiller Mathematical Structures in Computer Science 26 (4), 606-638, 2016 | 38 | 2016 |
| Logarithmic space and permutations C Aubert, T Seiller Information and Computation 248, 2-21, 2016 | 35 | 2016 |
| Interaction graphs: Graphings T Seiller Annals of Pure and Applied Logic 168 (2), 278-320, 2017 | 34 | 2017 |
| Interaction graphs: Full linear logic T Seiller Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 31 | 2016 |
| Logique dans le facteur hyperfini: géometrie de l'interaction et complexité T Seiller Aix-Marseille Université, 2012 | 31 | 2012 |
| Interaction graphs: Non-deterministic automata T Seiller ACM Transactions on Computational Logic (TOCL) 19 (3), 1-24, 2018 | 28 | 2018 |
| Interaction graphs: Exponentials T Seiller Logical Methods in Computer Science 15, 2019 | 25 | 2019 |
| Unary Resolution: Characterizing Ptime C Aubert, M Bagnol, T Seiller International Conference on Foundations of Software Science and Computation …, 2016 | 22 | 2016 |
| Logic programming and logarithmic space C Aubert, M Bagnol, P Pistone, T Seiller Programming Languages and Systems: 12th Asian Symposium, APLAS 2014 …, 2014 | 22 | 2014 |
| An Intensionally Fully-abstract Sheaf Model for pi C Eberhart, T Hirschowitz, T Seiller LIPIcs-Leibniz International Proceedings in Informatics 35, 2015 | 20* | 2015 |
| On the Computational Meaning of Axioms A Naibo, M Petrolo, T Seiller | 17* | |
| Towards a complexity-through-realisability theory T Seiller arXiv preprint arXiv:1502.01257, 2015 | 16* | 2015 |
| A correspondence between maximal abelian sub-algebras and linear logic fragments T Seiller Mathematical Structures in Computer Science 28 (1), 77-139, 2018 | 15 | 2018 |
| Memoization for unary logic programming: Characterizing ptime C Aubert, M Bagnol, T Seiller arXiv preprint arXiv:1501.05104, 2015 | 14* | 2015 |
| Loop quasi-invariant chunk detection JY Moyen, T Rubiano, T Seiller International Symposium on Automated Technology for Verification and …, 2017 | 12 | 2017 |
| mwp-analysis improvement and implementation: Realizing implicit computational complexity C Aubert, T Rubiano, N Rusch, T Seiller arXiv preprint arXiv:2203.03943, 2022 | 10 | 2022 |
| PRAMs over integers do not compute maxflow efficiently L Pellissier, T Seiller | 7 | 2018 |
| Probabilistic complexity classes through semantics T Seiller arXiv preprint arXiv:2002.00009, 2020 | 6 | 2020 |
Clément AubertAugusta University, GA, USAVerified email at math.cnrs.fr
