| 2026 | DLT | Tree Representations of Infinite Words and Their Logical Properties. | Arnaud Carayol, Lucien Charamond |
| 2024 | ICALP | The Structure of Trees in the Pushdown Hierarchy. | Arnaud Carayol, Lucien Charamond |
| 2023 | STACS | One Drop of Non-Determinism in a Random Deterministic Automaton. | Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud |
| 2020 | ICALP | Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. | Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud |
| 2018 | MFCS | Optimal Strategies in Pushdown Reachability Games. | Arnaud Carayol, Matthew Hague |
| 2017 | STACS | On Long Words Avoiding Zimin Patterns. | Arnaud Carayol, Stefan Gller |
| 2016 | KR | An Analysis of the Equational Properties of the Well-Founded Fixed Point. | Arnaud Carayol, Zoltn sik |
| 2016 | LICS | Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. | Arnaud Carayol, Christof Lding, Olivier Serre |
| 2015 | LICS | How Good Is a Strategy in a Game with Nature? | Arnaud Carayol, Olivier Serre |
| 2013 | ICFP | C-SHORe: a collapsible approach to higher-order verification. | Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre |
| 2012 | ICALP | Algebraic Synchronization Trees and Processes. | Luca Aceto, Arnaud Carayol, Zoltn sik, Anna Inglfsdttir |
| 2012 | ICALP | A Saturation Method for Collapsible Pushdown Systems. | Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre |
| 2012 | LICS | Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. | Arnaud Carayol, Olivier Serre |
| 2012 | STACS | Distribution of the number of accessible states in a random deterministic automaton. | Arnaud Carayol, Cyril Nicaud |
| 2011 | LICS | Qualitative Tree Languages. | Arnaud Carayol, Axel Haddad, Olivier Serre |
| 2010 | ICALP | Linear Orders in the Pushdown Hierarchy. | Laurent Braud, Arnaud Carayol |
| 2010 | LICS | Recursion Schemes and Logical Reflection. | Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre |
| 2008 | LICS | Winning Regions of Higher-Order Pushdown Games. | Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre |
| 2008 | MFCS | Positional Strategies for Higher-Order Pushdown Parity Games. | Arnaud Carayol, Michaela Slaats |
| 2007 | CSL | MSO on the Infinite Binary Tree: Choice and Order. | Arnaud Carayol, Christof Lding |
| 2006 | CSL | On Rational Trees. | Arnaud Carayol, Christophe Morvan |
| 2006 | MFCS | The Kleene Equality for Graphs. | Arnaud Carayol, Didier Caucal |
| 2005 | MFCS | Regular Sets of Higher-Order Pushdown Stacks. | Arnaud Carayol |
| 2005 | MFCS | Linearly Bounded Infinite Graphs. | Arnaud Carayol, Antoine Meyer |
| 2003 | ICALP | On Equivalent Representations of Infinite Structures. | Arnaud Carayol, Thomas Colcombet |