| Interaction graphs: multiplicatives T Seiller Annals of Pure and Applied Logic 163 (12), 1808-1837, 2012 | 36 | 2012 |
| Characterizing co-NL by a group action C Aubert, T Seiller Mathematical Structures in Computer Science 26 (4), 606-638, 2016 | 35 | 2016 |
| 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 | 32 | 2016 |
| Logique dans le facteur hyperfini: géometrie de l'interaction et complexité T Seiller Aix-Marseille Université, 2012 | 29 | 2012 |
| Interaction graphs: Graphings T Seiller Annals of Pure and Applied Logic 168 (2), 278-320, 2017 | 24 | 2017 |
| Interaction graphs: Full linear logic T Seiller 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016 | 20 | 2016 |
| Unary resolution: Characterizing ptime C Aubert, M Bagnol, T Seiller International Conference on Foundations of Software Science and Computation …, 2016 | 20 | 2016 |
| 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 | 19 | 2014 |
| Interaction graphs: Exponentials T Seiller Logical Methods in Computer Science 15, 2019 | 16 | 2019 |
| Interaction graphs: Non-deterministic automata T Seiller ACM Transactions on Computational Logic (TOCL) 19 (3), 1-24, 2018 | 16 | 2018 |
| 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 | 14 | 2018 |
| 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 | 7 | 2015 |
| Verificationism and classical realizability A Naibo, M Petrolo, T Seiller Perspectives on Interrogative Models of Inquiry, 163-197, 2016 | 5 | 2016 |
| Interaction graphs and complexity T Seiller Abstract, 2014 | 5 | 2014 |
| PRAMs over integers do not compute maxflow efficiently L Pellissier, T Seiller arXiv preprint arXiv:1811.06787, 2018 | 4 | 2018 |
| From dynamic to static semantics, quantitatively T Seiller arXiv preprint arXiv:1604.05047, 2016 | 4* | 2016 |
Clément AubertAugusta University, GA, USAAdresse e-mail validée de math.cnrs.fr
