| Characterizing co-NL by a group action C Aubert, T Seiller Mathematical Structures in Computer Science 26 (4), 606-638, 2016 | 39 | 2016 |
| Logarithmic space and permutations C Aubert, T Seiller Information and Computation 248, 2-21, 2016 | 35 | 2016 |
| Unary Resolution: Characterizing Ptime C Aubert, M Bagnol, T Seiller International Conference on Foundations of Software Science and Computation …, 2016 | 27* | 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 | 26 | 2017 |
| 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 |
| Unification and logarithmic space C Aubert, M Bagnol Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA …, 2014 | 17 | 2014 |
| How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation C Aubert, I Cristescu 31st International Conference on Concurrency Theory (CONCUR 2020) 171, 7:1--7:23, 2020 | 16 | 2020 |
| mwp-analysis improvement and implementation: Realizing implicit computational complexity C Aubert, T Rubiano, N Rusch, T Seiller 7th International Conference on Formal Structures for Computation and …, 2022 | 13 | 2022 |
| Reversible barbed congruence on configuration structures C Aubert, I Cristescu 8th Interaction and Concurrency Experience (ICE 2015) 189, 68–85, 2015 | 13 | 2015 |
| Explicit identifiers and contexts in reversible concurrent calculus C Aubert, D Medić International Conference on Reversible Computation, 144-162, 2021 | 10 | 2021 |
| Sublogarithmic uniform Boolean proof nets C Aubert Proceedings Second Workshop on Developments in Implicit Computational …, 2012 | 9 | 2012 |
| Concurrencies in reversible concurrent calculi C Aubert International Conference on Reversible Computation, 146-163, 2022 | 7 | 2022 |
| Process, Systems and Tests: Three Layers in Concurrent Computation. C Aubert, D Varacca ICE, 1-21, 2021 | 7* | 2021 |
| Structural equivalences for reversible calculi of communicating systems (oral communication) C Aubert, I Cristescu arXiv preprint arXiv:2005.06818, 2020 | 6 | 2020 |
| An in-between" implicit" and" explicit" complexity: Automata C Aubert arXiv preprint arXiv:1502.00145, 2015 | 6 | 2015 |
| Distributing and Parallelizing Non-canonical Loops C Aubert, T Rubiano, N Rusch, T Seiller International Conference on Verification, Model Checking, and Abstract …, 2023 | 5* | 2023 |
| Linear Logic and Sub-polynomial Classes of Complexity C Aubert Université Paris-Nord-Paris XIII, 2013 | 5 | 2013 |
| Diamonds for security: a non-interleaving operational semantics for the applied pi-calculus C Aubert, R Horne, C Johansen | 4 | 2022 |
| The correctness of concurrencies in (reversible) concurrent calculi C Aubert Journal of Logical and Algebraic Methods in Programming 136, 100924, 2024 | 3 | 2024 |
| Replications in reversible concurrent calculi C Aubert International Conference on Reversible Computation, 15-23, 2023 | 3 | 2023 |
Thomas SeillerCNRSVerified email at cnrs.fr
