Arnaud Carayol

68 papers A* 10A 4B 7C 1Journal 34Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Random Deterministic Automata With One Added Transition. Log. Methods Comput. Sci. Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2025	J	`jnl`	Weakly-unambiguous Parikh automata and their link to holonomic series. CoRR Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
2024	J	`jnl`	Random DFA With One Added Transition. CoRR Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2024	A*	`conf`	The Structure of Trees in the Pushdown Hierarchy. ICALP Arnaud Carayol, Lucien Charamond
2023	J	`jnl`	Games on Graphs. CoRR 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
2023	A	`conf`	One Drop of Non-Determinism in a Random Deterministic Automaton. STACS Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
2021	J	`jnl`	Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2021	J	`jnl`	Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. ACM Trans. Comput. Log. Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
2021	—	`ch.`	Higher-order recursion schemes and their automata models. Handbook of Automata Theory (II.) Arnaud Carayol, Olivier Serre
2020	J	`jnl`	Collapsible Pushdown Parity Games. CoRR Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
2020	J	`jnl`	Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. CoRR Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
2020	J	`jnl`	How Good Is a Strategy in a Game With Nature? CoRR Arnaud Carayol, Olivier Serre
2020	J	`jnl`	How Good Is a Strategy in a Game with Nature? ACM Trans. Comput. Log. Arnaud Carayol, Olivier Serre
2020	A*	`conf`	Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
2019	J	`jnl`	On Long Words Avoiding Zimin Patterns. Theory Comput. Syst. Arnaud Carayol, Stefan Göller
2019	J	`jnl`	On long words avoiding Zimin patterns. CoRR Arnaud Carayol, Stefan Göller
2019	J	`jnl`	Special issue - Implementation and Application of Automata (CIAA 2017). Theor. Comput. Sci. Arnaud Carayol, Cyril Nicaud
2018	J	`jnl`	Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
2018	B	`conf`	Optimal Strategies in Pushdown Reachability Games. MFCS Arnaud Carayol, Matthew Hague
2018	J	`jnl`	Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae Arnaud Carayol, Christof Löding, Olivier Serre
2017	J	`jnl`	An analysis of the equational properties of the well-founded fixed point. J. Log. Algebraic Methods Program. Arnaud Carayol, Zoltán Ésik
2017	J	`jnl`	C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
2017	J	`jnl`	Counting branches in trees using games. Inf. Comput. Arnaud Carayol, Olivier Serre
2017	C	`ed.`	Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings CIAA Arnaud Carayol, Cyril Nicaud
2017	A	`conf`	On Long Words Avoiding Zimin Patterns. STACS Arnaud Carayol, Stefan Göller
2017	J	`jnl`	Preface. Fundam. Informaticae David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz
2016	J	`jnl`	Algebraic Synchronization Trees and Processes. CoRR Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
2016	A*	`conf`	An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR Arnaud Carayol, Zoltán Ésik
2016	A*	`conf`	Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS Arnaud Carayol, Christof Löding, Olivier Serre
2016	J	`jnl`	Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. Arnaud Carayol, Olivier Serre
2015	J	`jnl`	An analysis of the equational properties of the well-founded fixed point. CoRR Arnaud Carayol, Zoltán Ésik
2015	J	`jnl`	Counting Branches in Trees Using Games. CoRR Arnaud Carayol, Axel Haddad, Olivier Serre
2015	J	`jnl`	Erratum for "Randomization in Automata on Infinite Trees". ACM Trans. Comput. Log. Arnaud Carayol, Axel Haddad, Olivier Serre
2015	A*	`conf`	How Good Is a Strategy in a Game with Nature? LICS Arnaud Carayol, Olivier Serre
2015	J	`jnl`	Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability. CoRR Arnaud Carayol, Olivier Serre
2015	J	`jnl`	Pure Strategies in Imperfect Information Stochastic Games. CoRR Arnaud Carayol, Christof Löding, Olivier Serre
2014	J	`jnl`	Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. Arnaud Carayol, Axel Haddad, Olivier Serre
2014	—	`conf`	Regular Strategies in Pushdown Reachability Games. RP Arnaud Carayol, Matthew Hague
2014	—	`conf`	Saturation algorithms for model-checking pushdown systems. AFL Arnaud Carayol, Matthew Hague
2013	A	`conf`	C-SHORe: a collapsible approach to higher-order verification. ICFP Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
2013	—	`ed.`	Proceedings Workshop on Fixed Points in Computer Science, FICS 2013, Turino, Italy, September 1st, 2013. FICS David Baelde, Arnaud Carayol
2013	J	`jnl`	The FC-rank of a context-free language. Inf. Process. Lett. Arnaud Carayol, Zoltán Ésik
2012	—	`conf`	A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS Arnaud Carayol, Zoltán Ésik
2012	—	`conf`	A Saturation Method for Collapsible Pushdown Systems. ICALP (2) Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
2012	—	`conf`	Algebraic Synchronization Trees and Processes. ICALP (2) Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
2012	A*	`conf`	Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. LICS Arnaud Carayol, Olivier Serre
2012	A	`conf`	Distribution of the number of accessible states in a random deterministic automaton. STACS Arnaud Carayol, Cyril Nicaud
2012	J	`jnl`	The FC-rank of a context-free language CoRR Arnaud Carayol, Zoltán Ésik
2011	A*	`conf`	Qualitative Tree Languages. LICS Arnaud Carayol, Axel Haddad, Olivier Serre
2010	—	`conf`	Linear Orders in the Pushdown Hierarchy. ICALP (2) Laurent Braud, Arnaud Carayol
2010	A*	`conf`	Recursion Schemes and Logical Reflection. LICS Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
2010	—	`conf`	Structures Defined by Higher-Order Recursion Schemes. FICS Arnaud Carayol
2008	B	`conf`	Positional Strategies for Higher-Order Pushdown Parity Games. MFCS Arnaud Carayol, Michaela Slaats
2008	A*	`conf`	Winning Regions of Higher-Order Pushdown Games. LICS Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre
2007	J	`jnl`	Linearly bounded infinite graphs CoRR Arnaud Carayol, Antoine Meyer
2007	B	`conf`	MSO on the Infinite Binary Tree: Choice and Order. CSL Arnaud Carayol, Christof Löding
2006	—	`—`	Automates infinis, logiques et langages. Arnaud Carayol
2006	J	`jnl`	Context-Sensitive Languages, Rational Graphs and Determinism CoRR Arnaud Carayol, Antoine Meyer
2006	J	`jnl`	Context-Sensitive Languages, Rational Graphs and Determinism. Log. Methods Comput. Sci. Arnaud Carayol, Antoine Meyer
2006	J	`jnl`	Linearly bounded infinite graphs. Acta Informatica Arnaud Carayol, Antoine Meyer
2006	B	`conf`	On Rational Trees. CSL Arnaud Carayol, Christophe Morvan
2006	B	`conf`	The Kleene Equality for Graphs. MFCS Arnaud Carayol, Didier Caucal
2005	B	`conf`	Linearly Bounded Infinite Graphs. MFCS Arnaud Carayol, Antoine Meyer
2005	J	`jnl`	On the representation of McCarthy's amb in the Pi-calculus. Theor. Comput. Sci. Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
2005	B	`conf`	Regular Sets of Higher-Order Pushdown Stacks. MFCS Arnaud Carayol
2003	A*	`conf`	On Equivalent Representations of Infinite Structures. ICALP Arnaud Carayol, Thomas Colcombet
2003	—	`conf`	On the Representation of McCarthy's EXPRESS Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
2003	—	`conf`	The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. FSTTCS Arnaud Carayol, Stefan Wöhrle