| Characterizing co-NL by a group action C Aubert, T Seiller Mathematical Structures in Computer Science 26 (4), 606-638, 2016 | 35 | 2016 |
| Logarithmic space and permutations C Aubert, T Seiller Information and Computation 248, 2-21, 2016 | 32 | 2016 |
| Contextual equivalences in configuration structures and reversibility C Aubert, I Cristescu Journal of Logical and Algebraic Methods in Programming 86 (1), 77-106, 2017 | 24 | 2017 |
| Unary Resolution: Characterizing Ptime C Aubert, M Bagnol, T Seiller Foundations of Software Science and Computation Structures: 19th …, 2016 | 20 | 2016 |
| Logic programming and logarithmic space C Aubert, M Bagnol, P Pistone, T Seiller Programming Languages and Systems: 12th Asian Symposium, APLAS 2014 …, 2014 | 20 | 2014 |
| Unification and logarithmic space C Aubert, M Bagnol Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA …, 2014 | 17 | 2014 |
| Memoization for unary logic programming: Characterizing ptime C Aubert, M Bagnol, T Seiller arXiv preprint arXiv:1501.05104, 2015 | 14* | 2015 |
| Reversible barbed congruence on configuration structures C Aubert, I Cristescu 8th Interaction and Concurrency Experience (ICE 2015) 189, 68–85, 2015 | 13 | 2015 |
| How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation C Aubert, I Cristescu arXiv preprint arXiv:2005.06814, 2020 | 11 | 2020 |
| An in-between" implicit" and" explicit" complexity: Automata C Aubert arXiv preprint arXiv:1502.00145, 2015 | 9* | 2015 |
| Sublogarithmic uniform Boolean proof nets C Aubert Proceedings Second Workshop on Developments in Implicit Computational …, 2012 | 8 | 2012 |
| Linear Logic and Sub-polynomial Classes of Complexity C Aubert Université Paris-Nord-Paris XIII, 2013 | 7 | 2013 |
| Explicit identifiers and contexts in reversible concurrent calculus C Aubert, D Medić Reversible Computation: 13th International Conference, RC 2021, Virtual …, 2021 | 6 | 2021 |
| mwp-analysis improvement and implementation: Realizing implicit computational complexity C Aubert, T Rubiano, N Rusch, T Seiller arXiv preprint arXiv:2203.03943, 2022 | 5 | 2022 |
| Processes, Systems and Tests: Defining Contextual Equivalences C Aubert, D Varacca arXiv preprint arXiv:2007.08187, 2020 | 4 | 2020 |
| Structural equivalences for reversible calculi of communicating systems (oral communication) C Aubert, I Cristescu arXiv preprint arXiv:2005.06818, 2020 | 4 | 2020 |
| Distributing and Parallelizing Non-canonical Loops C Aubert, T Rubiano, N Rusch, T Seiller Verification, Model Checking, and Abstract Interpretation: 24th …, 2023 | 2 | 2023 |
| Concurrencies in reversible concurrent calculi C Aubert Reversible Computation: 14th International Conference, RC 2022, Urbino …, 2022 | 2 | 2022 |
| Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus C Aubert, R Horne, C Johansen 33rd International Conference on Concurrency Theory (CONCUR 2022), 2022 | 2 | 2022 |
| Réseaux de preuves booléens sous-logarithmiques C Aubert Mémoire de M2 LMFI, Paris VII. LIPN, 2010 | 2* | 2010 |
Thomas SeillerCNRSAdresse e-mail validée de cnrs.fr
