The following pages link to Clément Aubert (Q276246):
Displayed 31 items.
- Logarithmic space and permutations (Q276248) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Cobham recursive set functions (Q904151) (← links)
- Session types and subtyping for orchestrated interactions (Q1633346) (← links)
- Static versus dynamic reversibility in CCS (Q2022303) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Concurrencies in reversible concurrent calculi (Q2097423) (← links)
- Reversible sessions with flexible choices (Q2329306) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Logic Programming and Logarithmic Space (Q2789034) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- (Q4580325) (← links)
- (Q5089270) (← links)
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus (Q5162607) (← links)
- Unification and Logarithmic Space (Q5170809) (← links)
- (Q5216153) (← links)
- Characterizing<b>co-NL</b>by a group action (Q5741572) (← links)
- (Q5854675) (← links)
- Distributing and parallelizing non-canonical loops (Q6132484) (← links)
- Replications in reversible concurrent calculi (Q6148103) (← links)
- Implementation of a reversible distributed calculus (Q6148123) (← links)
- (Q6150427) (← links)
- The correctness of concurrencies in (reversible) concurrent calculi (Q6151611) (← links)
- Memoization for Unary Logic Programming: Characterizing PTIME (Q6258326) (← links)
- An in-between "implicit" and "explicit" complexity: Automata (Q6258673) (← links)
- Categories for Me, and You? (Q6327009) (← links)
- How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation (Q6340675) (← links)
- Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication) (Q6340676) (← links)
- An extended and more practical mwp flow analysis (Q6371682) (← links)
- pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs (Q6371684) (← links)
- mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity (Q6393104) (← links)