default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Paperman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Michaël Cadilhac
, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. Theory Comput. Syst. 68(4): 593-614 (2024)- 2023
- [j5]Antoine Amarilli, Charles Paperman:
Locality and Centrality: The Variety ZG. Log. Methods Comput. Sci. 19(4) (2023) - [c18]Mateusz Gienieczko, Filip Murlak, Charles Paperman:
Supporting Descendants in SIMD-Accelerated JSONPath. ASPLOS (4) 2023: 338-361 - [c17]Charles Paperman, Sylvain Salvati, Claire Soyez-Martin:
An Algebraic Approach to Vectorial Programs. STACS 2023: 51:1-51:23 - 2022
- [j4]Michaël Cadilhac, Charles Paperman:
The regular languages of wire linear AC0. Acta Informatica 59(4): 321-336 (2022) - [c16]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. LICS 2022: 58:1-58:11 - [i12]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. CoRR abs/2203.06075 (2022) - 2021
- [c15]Antoine Amarilli, Louis Jachiet, Charles Paperman:
Dynamic Membership for Regular Languages. ICALP 2021: 116:1-116:17 - [c14]Corentin Barloy, Filip Murlak, Charles Paperman:
Stackless Processing of Streamed Trees. PODS 2021: 109-125 - [i11]Antoine Amarilli, Charles Paperman:
Locality and Centrality: The Variety ZG. CoRR abs/2102.07724 (2021) - [i10]Antoine Amarilli, Louis Jachiet, Charles Paperman:
Dynamic Membership for Regular Languages. CoRR abs/2102.07728 (2021) - 2020
- [j3]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16(1) (2020) - [c13]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17 - [i9]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On polynomial recursive sequences. CoRR abs/2002.08630 (2020)
2010 – 2019
- 2018
- [j2]Laure Daviaud, Charles Paperman:
Classes of languages generated by the Kleene star of a word. Inf. Comput. 262: 90-109 (2018) - [c12]Antoine Amarilli, Charles Paperman:
Topological Sorting with Regular Constraints. ICALP 2018: 115:1-115:14 - [i8]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity and Rational Functions. CoRR abs/1802.10555 (2018) - 2017
- [j1]Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. ACM Trans. Comput. Log. 18(3): 20:1-20:17 (2017) - [c11]Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity and Rational Functions. ICALP 2017: 115:1-115:14 - [c10]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. ICALP 2017: 117:1-117:13 - [c9]Michaël Cadilhac, Charles Paperman:
A crevice on the Crane Beach: Finite-degree predicates. LICS 2017: 1-9 - [c8]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. STACS 2017: 24:1-24:14 - [i7]Michaël Cadilhac, Charles Paperman:
A Crevice on the Crane Beach: Finite-Degree Predicates. CoRR abs/1701.02673 (2017) - [i6]Antoine Amarilli, Charles Paperman:
A Dichotomy on Constrained Topological Sorting. CoRR abs/1707.04310 (2017) - [i5]Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. CoRR abs/1709.03117 (2017) - 2016
- [c7]Filip Murlak, Charles Paperman, Michal Pilipczuk:
Schema Validation via Streaming Circuits. PODS 2016: 237-249 - [i4]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. CoRR abs/1609.00214 (2016) - [i3]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. CoRR abs/1612.06233 (2016) - 2015
- [c6]Charles Paperman:
Finite-Degree Predicates and Two-Variable First-Order Logic. CSL 2015: 616-630 - [c5]Luc Dartois, Charles Paperman:
Alternation Hierarchies of First Order Logic with Regular Predicates. FCT 2015: 160-172 - [c4]Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman:
A Circuit Complexity Approach to Transductions. MFCS (1) 2015: 141-153 - [c3]Laure Daviaud, Charles Paperman:
Classes of Languages Generated by the Kleene Star of a Word. MFCS (1) 2015: 167-178 - [i2]Charles Paperman:
Finite-Degree Predicates and Two-Variable First-Order Logic. CoRR abs/1507.05175 (2015) - 2014
- [c2]Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. MFCS (1) 2014: 279-290 - [i1]Luc Dartois, Charles Paperman:
Adding modular predicates. CoRR abs/1401.6576 (2014) - 2013
- [c1]Luc Dartois, Charles Paperman:
Two-variable first order logic with modular predicates over words. STACS 2013: 329-340
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-09-21 23:42 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:
