default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Carayol
Person information
- affiliation: Université Paris-Est Marne-la-Vallée, France
- affiliation (former): RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Arnaud Carayol, Lucien Charamond:
The Structure of Trees in the Pushdown Hierarchy. ICALP 2024: 131:1-131:18- [i16]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
Random DFA With One Added Transition. CoRR abs/2402.06591 (2024) - 2023
- [c29]Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
One Drop of Non-Determinism in a Random Deterministic Automaton. STACS 2023: 19:1-19:14 - [i15]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - 2021
- [j16]Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
:
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. ACM Trans. Comput. Log. 22(2): 12:1-12:37 (2021) - [j15]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22(3): 16:1-16:51 (2021) - [p1]Arnaud Carayol, Olivier Serre:
Higher-order recursion schemes and their automata models. Handbook of Automata Theory (II.) 2021: 1295-1341 - 2020
- [j14]Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? ACM Trans. Comput. Log. 21(3): 21:1-21:39 (2020) - [c28]Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud:
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP 2020: 114:1-114:16 - [i14]Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game With Nature? CoRR abs/2002.09942 (2020) - [i13]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. CoRR abs/2010.06361 (2020) - [i12]Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre:
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. CoRR abs/2010.06366 (2020)
2010 – 2019
- 2019
- [j13]Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. Theory Comput. Syst. 63(5): 926-955 (2019) - [j12]Arnaud Carayol, Cyril Nicaud:
Special issue - Implementation and Application of Automata (CIAA 2017). Theor. Comput. Sci. 787: 1 (2019) - [i11]Arnaud Carayol, Stefan Göller:
On long words avoiding Zimin patterns. CoRR abs/1902.05540 (2019) - 2018
- [j11]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160(4): 361-384 (2018) - [c27]Arnaud Carayol, Matthew Hague:
Optimal Strategies in Pushdown Reachability Games. MFCS 2018: 42:1-42:14 - [i10]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR abs/1805.11873 (2018) - 2017
- [j10]David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz:
Preface. Fundam. Informaticae 150(3-4): i-ii (2017) - [j9]Arnaud Carayol, Olivier Serre:
Counting branches in trees using games. Inf. Comput. 252: 221-242 (2017) - [j8]Arnaud Carayol, Zoltán Ésik:
An analysis of the equational properties of the well-founded fixed point. J. Log. Algebraic Methods Program. 86(1): 308-318 (2017) - [c26]Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. STACS 2017: 19:1-19:13 - [e2]Arnaud Carayol, Cyril Nicaud:
Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. Lecture Notes in Computer Science 10329, Springer 2017, ISBN 978-3-319-60133-5 [contents] - [i9]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR abs/1703.04429 (2017) - 2016
- [j7]Arnaud Carayol, Olivier Serre:
Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. 116(10): 638-643 (2016) - [c25]Arnaud Carayol, Zoltán Ésik:
An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR 2016: 533-536 - [c24]Arnaud Carayol, Christof Löding, Olivier Serre:
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS 2016: 227-236 - [i8]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir:
Algebraic Synchronization Trees and Processes. CoRR abs/1610.00450 (2016) - 2015
- [j6]Arnaud Carayol, Axel Haddad, Olivier Serre:
Erratum for "Randomization in Automata on Infinite Trees". ACM Trans. Comput. Log. 16(4): 36:1-36:2 (2015) - [c23]Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? LICS 2015: 609-620 - [i7]Arnaud Carayol, Axel Haddad, Olivier Serre:
Counting Branches in Trees Using Games. CoRR abs/1505.03852 (2015) - [i6]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. CoRR abs/1506.09140 (2015) - [i5]Arnaud Carayol, Olivier Serre:
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability. CoRR abs/1510.04000 (2015) - [i4]Arnaud Carayol, Zoltán Ésik:
An analysis of the equational properties of the well-founded fixed point. CoRR abs/1511.09423 (2015) - 2014
- [j5]Arnaud Carayol, Axel Haddad, Olivier Serre:
Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. 15(3): 24:1-24:33 (2014) - [c22]Arnaud Carayol, Matthew Hague:
Regular Strategies in Pushdown Reachability Games. RP 2014: 58-71 - [c21]Arnaud Carayol, Matthew Hague:
Saturation algorithms for model-checking pushdown systems. AFL 2014: 1-24 - 2013
- [j4]Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. Inf. Process. Lett. 113(8): 285-287 (2013) - [c20]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
C-SHORe: a collapsible approach to higher-order verification. ICFP 2013: 13-24 - [e1]David Baelde, Arnaud Carayol:
Proceedings Workshop on Fixed Points in Computer Science, FICS 2013, Turino, Italy, September 1st, 2013. EPTCS 126, 2013 [contents] - 2012
- [c19]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir:
Algebraic Synchronization Trees and Processes. ICALP (2) 2012: 30-41 - [c18]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) 2012: 165-176 - [c17]Arnaud Carayol, Zoltán Ésik:
A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS 2012: 104-118 - [c16]Arnaud Carayol, Olivier Serre:
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. LICS 2012: 165-174 - [c15]Arnaud Carayol, Cyril Nicaud:
Distribution of the number of accessible states in a random deterministic automaton. STACS 2012: 194-205 - [i3]Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. CoRR abs/1202.6275 (2012) - 2011
- [c14]Arnaud Carayol, Axel Haddad, Olivier Serre:
Qualitative Tree Languages. LICS 2011: 13-22 - 2010
- [c13]Arnaud Carayol:
Structures Defined by Higher-Order Recursion Schemes. FICS 2010: 7 - [c12]Laurent Braud, Arnaud Carayol:
Linear Orders in the Pushdown Hierarchy. ICALP (2) 2010: 88-99 - [c11]Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre:
Recursion Schemes and Logical Reflection. LICS 2010: 120-129
2000 – 2009
- 2008
- [c10]Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre:
Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204 - [c9]Arnaud Carayol, Michaela Slaats:
Positional Strategies for Higher-Order Pushdown Parity Games. MFCS 2008: 217-228 - 2007
- [c8]Arnaud Carayol, Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order. CSL 2007: 161-176 - [i2]Arnaud Carayol, Antoine Meyer:
Linearly bounded infinite graphs. CoRR abs/0705.3487 (2007) - 2006
- [b1]Arnaud Carayol:
Automates infinis, logiques et langages. University of Rennes 1, France, 2006 - [j3]Arnaud Carayol, Antoine Meyer:
Linearly bounded infinite graphs. Acta Informatica 43(4): 265-292 (2006) - [j2]Arnaud Carayol, Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism. Log. Methods Comput. Sci. 2(2) (2006) - [c7]Arnaud Carayol, Christophe Morvan:
On Rational Trees. CSL 2006: 225-239 - [c6]Arnaud Carayol, Didier Caucal:
The Kleene Equality for Graphs. MFCS 2006: 214-225 - [i1]Arnaud Carayol, Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism. CoRR abs/cs/0606053 (2006) - 2005
- [j1]Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi:
On the representation of McCarthy's amb in the Pi-calculus. Theor. Comput. Sci. 330(3): 439-473 (2005) - [c5]Arnaud Carayol:
Regular Sets of Higher-Order Pushdown Stacks. MFCS 2005: 168-179 - [c4]Arnaud Carayol, Antoine Meyer:
Linearly Bounded Infinite Graphs. MFCS 2005: 180-191 - 2003
- [c3]Arnaud Carayol, Stefan Wöhrle:
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. FSTTCS 2003: 112-123 - [c2]Arnaud Carayol, Thomas Colcombet:
On Equivalent Representations of Infinite Structures. ICALP 2003: 599-610 - [c1]Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi:
On the Representation of McCarthy's amb in the π-calculus. EXPRESS 2003: 73-89
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-10-07 22:18 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:
