Pushdown Games with Unboundedness and Regular Conditions. - Alexis-Julien Bouquet; Olivier Serre; Igor Walukiewicz (FSTTCS, 2003)

Note on winning positions on pushdown games with [omega]-regular conditions. - Olivier Serre (Inf. Process. Lett., 2003)

Visibly Pushdown Games. - Christof Löding; P. Madhusudan; Olivier Serre (FSTTCS, 2004)

Vectorial languages and linear temporal logic. - Olivier Serre (Theor. Comput. Sci., 2004)

Contribution à l'étude des jeux sur des graphes de processus à pile. (Contribution to pushdown games studies). - Olivier Serre (2004)

Propositional Dynamic Logic with Recursive Programs. - Christof Löding; Olivier Serre (FoSSaCS, 2006)

Parity Games Played on Transition Graphs of One-Counter Processes. - Olivier Serre (FoSSaCS, 2006)

Regularity Problems for Visibly Pushdown Languages. - Vince Bárány; Christof Löding; Olivier Serre (STACS, 2006)

Games with winning conditions of high Borel complexity. - Olivier Serre (Theor. Comput. Sci., 2006)

Propositional dynamic logic with recursive programs. - Christof Löding; Carsten Lutz; Olivier Serre (J. Log. Algebraic Methods Program., 2007)

Tree Pattern Rewriting Systems. - Blaise Genest; Anca Muscholl; Olivier Serre; Marc Zeitoun (ATVA, 2008)

µ-calculus Pushdown Module Checking with Imperfect State Information. - Benjamin Aminof; Axel Legay; Aniello Murano; Olivier Serre (IFIP TCS, 2008)

Winning Regions of Higher-Order Pushdown Games. - Arnaud Carayol; Matthew Hague; Antoine Meyer; C.-H. Luke Ong; Olivier Serre (LICS, 2008)

Qualitative Concurrent Stochastic Games with Imperfect Information. - Vincent Gripon; Olivier Serre (ICALP (2), 2009)

Qualitative Concurrent Games with Imperfect Information - Vincent Gripon; Olivier Serre (CoRR, 2009)

Recursion Schemes and Logical Reflection. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (LICS, 2010)

Qualitative Tree Languages. - Arnaud Carayol; Axel Haddad; Olivier Serre (LICS, 2011)

A Saturation Method for Collapsible Pushdown Systems. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICALP (2), 2012)

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. - Arnaud Carayol; Olivier Serre (LICS, 2012)

Parity games on undirected graphs. - Dietmar Berwanger; Olivier Serre (Inf. Process. Lett., 2012)

Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. - Nathanaël Fijalkow; Sophie Pinchinat; Olivier Serre (FSTTCS, 2013)

C-SHORe: a collapsible approach to higher-order verification. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICFP, 2013)

Pushdown module checking with imperfect information. - Benjamin Aminof; Axel Legay; Aniello Murano; Olivier Serre; Moshe Y. Vardi (Inf. Comput., 2013)

Introduction. - Dietmar Berwanger; Olivier Serre (Tech. Sci. Informatiques, 2013)

Randomization in Automata on Infinite Trees. - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2014)

Playing with Trees and Logic. - Olivier Serre (2015)

Counting Branches in Trees Using Games. - Arnaud Carayol; Axel Haddad; Olivier Serre (CoRR, 2015)

Streaming Property Testing of Visibly Pushdown Languages. - Nathanaël François; Frédéric Magniez; Olivier Serre; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2015)

Erratum for "Randomization in Automata on Infinite Trees". - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2015)

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. - Arnaud Carayol; Christof Löding; Olivier Serre (LICS, 2016)

Marking shortest paths on pushdown graphs does not preserve MSO decidability. - Arnaud Carayol; Olivier Serre (Inf. Process. Lett., 2016)

Two-Way Two-Tape Automata. - Olivier Carton; Léo Exibard; Olivier Serre (DLT, 2017)

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2017)

Counting branches in trees using games. - Arnaud Carayol; Olivier Serre (Inf. Comput., 2017)

Collapsible Pushdown Automata and Recursion Schemes. - Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2017)

Emptiness of Stack Automata is NEXPTIME-complete: A Correction. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2018)

Pure Strategies in Imperfect Information Stochastic Games. - Arnaud Carayol; Christof Löding; Olivier Serre (Fundam. Informaticae, 2018)

Reasoning about strategies on collapsible pushdown arenas with imperfect information. - Bastien Maubert; Aniello Murano; Olivier Serre (CoRR, 2020)

How Good Is a Strategy in a Game with Nature? - Arnaud Carayol; Olivier Serre (ACM Trans. Comput. Log., 2020)

Higher-order recursion schemes and their automata models. - Arnaud Carayol; Olivier Serre (Handbook of Automata Theory (II.), 2021)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann; Olivier Serre (Comput. Complex., 2021)

Alternating Tree Automata with Qualitative Semantics. - Raphaël Berthon; Nathanaël Fijalkow; Emmanuel Filiot; Shibashis Guha; Bastien Maubert; Aniello Murano; Laureline Pinault; Sophie Pinchinat; Sasha Rubin; Olivier Serre (ACM Trans. Comput. Log., 2021)

Collapsible Pushdown Parity Games. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)