default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Aubert
Person information
- affiliation: Augusta University, School of Computer and Cyber Sciences, USA
- affiliation (former): Appalachian State University, Computer Science Department, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Clément Aubert
:
The correctness of concurrencies in (reversible) concurrent calculi. J. Log. Algebraic Methods Program. 136: 100924 (2024)- 2023
- [c17]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
pymwp: A Static Analyzer Determining Polynomial Growth Bounds. ATVA 2023: 263-275 - [c16]Clément Aubert:
Replications in Reversible Concurrent Calculi. RC 2023: 15-23 - [c15]Clément Aubert, Peter Browning:
Implementation of a Reversible Distributed Calculus. RC 2023: 210-217 - [c14]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
Distributing and Parallelizing Non-canonical Loops. VMCAI 2023: 1-24 - [e2]Clément Aubert, Cinzia Di Giusto, Simon Fowler, Larisa Safina:
Proceedings 16th Interaction and Concurrency Experience, ICE 2023, Lisbon, Portugal, 19th June 2023. EPTCS 383, 2023 [contents] - 2022
- [j5]Clément Aubert, Daniele Varacca:
Processes against tests: On defining contextual equivalences. J. Log. Algebraic Methods Program. 129: 100799 (2022) - [c13]Clément Aubert, Ross Horne, Christian Johansen:
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. CONCUR 2022: 30:1-30:26 - [c12]Clément Aubert, E. Andrew Balas, Tiffany Townsend, Noah Sleeper, C. J. Tran:
Data Integration for the Study of Outstanding Productivity in Biomedical Research. CRIS 2022: 196-200 - [c11]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. FSCD 2022: 26:1-26:23 - [c10]Clément Aubert:
Concurrencies in Reversible Concurrent Calculi. RC 2022: 146-163 - [c9]Clément Aubert, Ross Horne, Christian Johansen:
Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus. EXPRESS/SOS 2022: 3-22 - [e1]Clément Aubert, Cinzia Di Giusto, Larisa Safina, Alceste Scalas:
Proceedings 15th Interaction and Concurrency Experience, ICE 2022, Lucca, Italy, 17th June 2022. EPTCS 365, 2022 [contents] - [i19]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. CoRR abs/2203.03943 (2022) - [i18]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
Realizing Implicit Computational Complexity. CoRR abs/2203.05221 (2022) - [i17]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. CoRR abs/2206.08760 (2022) - 2021
- [c8]Clément Aubert, Doriana Medic:
Explicit Identifiers and Contexts in Reversible Concurrent Calculus. RC 2021: 144-162 - [c7]Clément Aubert, Daniele Varacca:
Process, Systems and Tests: Three Layers in Concurrent Computation. ICE 2021: 1-21 - [i16]Clément Aubert, Doriana Medic:
Enabling Replications and Contexts in Reversible Concurrent Calculus. CoRR abs/2103.15623 (2021) - [i15]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
An extended and more practical mwp flow analysis. CoRR abs/2107.00086 (2021) - [i14]Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller:
An implementation of flow calculus for complexity analysis (tool paper). CoRR abs/2107.00097 (2021) - [i13]Clément Aubert:
Causal Consistent Replication in Reversible Concurrent Calculi. CoRR abs/2110.12697 (2021) - 2020
- [c6]Clément Aubert, Ioana Cristescu:
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. CONCUR 2020: 7:1-7:23 - [i12]Clément Aubert, Ioana Cristescu:
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. CoRR abs/2005.06814 (2020) - [i11]Clément Aubert, Ioana Cristescu:
Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication). CoRR abs/2005.06818 (2020)
2010 – 2019
- 2019
- [i10]Clément Aubert:
Categories for Me, and You? CoRR abs/1910.05172 (2019) - 2018
- [j4]Clément Aubert, Marc Bagnol:
Unification and Logarithmic Space. Log. Methods Comput. Sci. 14(3) (2018) - [i9]Clément Aubert, Ioana Cristescu:
History-Preserving Bisimulations on Reversible Calculus of Communicating Systems. CoRR abs/1804.10355 (2018) - [i8]Clément Aubert, Marc Bagnol:
Unification and Logarithmic Space. CoRR abs/1805.11988 (2018) - 2017
- [j3]Clément Aubert, Ioana Cristescu:
Contextual equivalences in configuration structures and reversibility. J. Log. Algebraic Methods Program. 86(1): 77-106 (2017) - 2016
- [j2]Clément Aubert, Thomas Seiller:
Logarithmic space and permutations. Inf. Comput. 248: 2-21 (2016) - [j1]Clément Aubert, Thomas Seiller:
Characterizing co-NL by a group action. Math. Struct. Comput. Sci. 26(4): 606-638 (2016) - [c5]Clément Aubert, Marc Bagnol, Thomas Seiller:
Unary Resolution: Characterizing Ptime. FoSSaCS 2016: 373-389 - 2015
- [c4]Clément Aubert, Ioana Cristescu:
Reversible Barbed Congruence on Configuration Structures. ICE 2015: 68-85 - [i7]Clément Aubert, Marc Bagnol, Thomas Seiller:
Memoization for Unary Logic Programming: Characterizing PTIME. CoRR abs/1501.05104 (2015) - [i6]Clément Aubert:
An in-between "implicit" and "explicit" complexity: Automata. CoRR abs/1502.00145 (2015) - [i5]Clément Aubert, Ioana Cristescu:
Contextual equivalences in configuration structures and reversibility. CoRR abs/1511.05750 (2015) - 2014
- [c3]Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller:
Logic Programming and Logarithmic Space. APLAS 2014: 39-57 - [c2]Clément Aubert, Marc Bagnol:
Unification and Logarithmic Space. RTA-TLCA 2014: 77-92 - [i4]Clément Aubert, Marc Bagnol:
Unification and Logarithmic Space. CoRR abs/1402.4327 (2014) - [i3]Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller:
Logic Programming and Logarithmic Space. CoRR abs/1406.2110 (2014) - 2013
- [b1]Clément Aubert:
Linear Logic and Sub-polynomial Classes of Complexity. (Logique linéaire et classes de complexité sous-polynomiales). Paris 13 University, Villetaneuse, Saint-Denis, Bobigny, France, 2013 - [i2]Thomas Seiller, Clément Aubert:
Logarithmic Space and Permutations. CoRR abs/1301.3189 (2013) - 2012
- [i1]Clément Aubert, Thomas Seiller:
Characterizing co-NL by a group action. CoRR abs/1209.3422 (2012) - 2011
- [c1]Clément Aubert:
Sublogarithmic uniform Boolean proof nets. DICE 2011: 15-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
