Clément Aubert
Clément Aubert
Augusta University, GA, USA
Adresse e-mail validée de math.cnrs.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Characterizing co-NL by a group action
C Aubert, T Seiller
Mathematical Structures in Computer Science 26 (4), 606-638, 2016
342016
Logarithmic space and permutations
C Aubert, T Seiller
Information and Computation 248, 2-21, 2016
312016
Contextual equivalences in configuration structures and reversibility
C Aubert, I Cristescu
Journal of Logical and Algebraic Methods in Programming 86 (1), 77-106, 2017
192017
Unary resolution: Characterizing ptime
C Aubert, M Bagnol, T Seiller
International Conference on Foundations of Software Science and Computation …, 2016
192016
Logic programming and logarithmic space
C Aubert, M Bagnol, P Pistone, T Seiller
Asian Symposium on Programming Languages and Systems, 39-57, 2014
192014
Unification and logarithmic space
C Aubert, M Bagnol
Rewriting and Typed Lambda Calculi, 77-92, 2014
152014
Reversible barbed congruence on configuration structures
C Aubert, I Cristescu
arXiv preprint arXiv:1508.04852, 2015
102015
Sublogarithmic uniform Boolean proof nets
C Aubert
Proceedings Second Workshop on Developments in Implicit Computational …, 2012
82012
Memoization for unary logic programming: Characterizing ptime
C Aubert, M Bagnol, T Seiller
arXiv preprint arXiv:1501.05104, 2015
72015
Linear Logic and Sub-polynomial Classes of Complexity
C Aubert
Université Paris-Nord-Paris XIII, 2013
72013
How reversibility can solve traditional questions: The example of hereditary history-preserving bisimulation
C Aubert, I Cristescu
arXiv preprint arXiv:2005.06814, 2020
62020
An in-between" implicit" and" explicit" complexity: Automata
C Aubert
arXiv preprint arXiv:1502.00145, 2015
52015
Structural equivalences for reversible calculi of communicating systems (oral communication)
C Aubert, I Cristescu
arXiv preprint arXiv:2005.06818, 2020
22020
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
12021
An implementation of flow calculus for complexity analysis (tool paper)
C Aubert, T Rubiano, N Rusch, T Seiller
arXiv preprint arXiv:2107.00097, 2021
12021
History-preserving bisimulations on reversible calculus of communicating systems
C Aubert, I Cristescu
arXiv preprint arXiv:1804.10355, 2018
12018
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
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20