| Characterizing co-NL by a group action C Aubert, T Seiller Mathematical Structures in Computer Science 26 (4), 606-638, 2016 | 34 | 2016 |
| Logarithmic space and permutations C Aubert, T Seiller Information and Computation 248, 2-21, 2016 | 31 | 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 | 19 | 2017 |
| Unary resolution: Characterizing ptime C Aubert, M Bagnol, T Seiller International Conference on Foundations of Software Science and Computation …, 2016 | 19 | 2016 |
| 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 |
| Unification and logarithmic space C Aubert, M Bagnol Rewriting and Typed Lambda Calculi, 77-92, 2014 | 15 | 2014 |
| Reversible barbed congruence on configuration structures C Aubert, I Cristescu arXiv preprint arXiv:1508.04852, 2015 | 10 | 2015 |
| Sublogarithmic uniform Boolean proof nets C Aubert Proceedings Second Workshop on Developments in Implicit Computational …, 2012 | 8 | 2012 |
| Memoization for unary logic programming: Characterizing ptime C Aubert, M Bagnol, T Seiller arXiv preprint arXiv:1501.05104, 2015 | 7 | 2015 |
| Linear Logic and Sub-polynomial Classes of Complexity C Aubert Université Paris-Nord-Paris XIII, 2013 | 7 | 2013 |
| How reversibility can solve traditional questions: The example of hereditary history-preserving bisimulation C Aubert, I Cristescu arXiv preprint arXiv:2005.06814, 2020 | 6 | 2020 |
| An in-between" implicit" and" explicit" complexity: Automata C Aubert arXiv preprint arXiv:1502.00145, 2015 | 5 | 2015 |
| Structural equivalences for reversible calculi of communicating systems (oral communication) C Aubert, I Cristescu arXiv preprint arXiv:2005.06818, 2020 | 2 | 2020 |
| Réseaux de preuves booléens sous-logarithmiques C Aubert Mémoire de M2 LMFI, Paris VII. LIPN, 2010 | 2* | 2010 |
| An extended and more practical mwp flow analysis C Aubert, T Rubiano, N Rusch, T Seiller arXiv preprint arXiv:2107.00086, 2021 | 1 | 2021 |
| An implementation of flow calculus for complexity analysis (tool paper) C Aubert, T Rubiano, N Rusch, T Seiller arXiv preprint arXiv:2107.00097, 2021 | 1 | 2021 |
| History-preserving bisimulations on reversible calculus of communicating systems C Aubert, I Cristescu arXiv preprint arXiv:1804.10355, 2018 | 1 | 2018 |
| Explicit Identifiers and Contexts in Reversible Concurrent Calculus C Aubert, D Medić International Conference on Reversible Computation, 144-162, 2021 | | 2021 |
| The implicit computational complexity flavor of automata M Holcomb, C Aubert Augusta University Libraries, 2021 | | 2021 |
| Enabling Replications and Contexts in Reversible Concurrent Calculus C Aubert, D Medić arXiv preprint arXiv:2103.15623, 2021 | | 2021 |
Thomas SeillerCNRSAdresse e-mail validée de lipn.fr
