Olivier Serre

ORCID

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 23

Top Venues

CoRR

ACM Trans. Comput. Log.

LICS

Electron. Colloquium Comput. Complex.

Paris 8 University, Saint-Denis, France (PHD)

Education History

Paris 8 University, Saint-Denis, France

PHD

Publications

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 (2023)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30 (2) (2021)
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) (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22 (1) (2021)
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) (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. CoRR (2020)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. CoRR (2020)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game With Nature? CoRR (2020)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS (2020)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game with Nature? ACM Trans. Comput. Log. 21 (3) (2020)
Bastien Maubert, Aniello Murano, Olivier Serre
Reasoning about strategies on collapsible pushdown arenas with imperfect information. CoRR (2020)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Parity Games. CoRR (2020)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR (2018)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160 (4) (2018)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. 25 (2018)
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Automata and Recursion Schemes. ACM Trans. Comput. Log. 18 (3) (2017)
Olivier Carton, Léo Exibard, Olivier Serre
Two-Way Two-Tape Automata. DLT (2017)
Olivier Carton, Léo Exibard, Olivier Serre
Two-way Two-tape Automata. CoRR (2017)
Arnaud Carayol, Olivier Serre
Counting branches in trees using games. Inf. Comput. 252 (2017)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR (2017)
Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre
Streaming Property Testing of Visibly Pushdown Languages. ESA (2016)
Arnaud Carayol, Christof Löding, Olivier Serre
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS (2016)
Arnaud Carayol, Olivier Serre
Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. 116 (10) (2016)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game with Nature? LICS (2015)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. CoRR (2015)
Arnaud Carayol, Axel Haddad, Olivier Serre
Erratum for "Randomization in Automata on Infinite Trees". ACM Trans. Comput. Log. 16 (4) (2015)
Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre
Streaming Property Testing of Visibly Pushdown Languages. CoRR (2015)
Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont
Streaming Property Testing of Visibly Pushdown Languages. Electron. Colloquium Comput. Complex. 22 (2015)
Arnaud Carayol, Olivier Serre
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability. CoRR (2015)
Arnaud Carayol, Axel Haddad, Olivier Serre
Counting Branches in Trees Using Games. CoRR (2015)
Arnaud Carayol, Axel Haddad, Olivier Serre
Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. 15 (3) (2014)
Dietmar Berwanger, Olivier Serre
Introduction. Tech. Sci. Informatiques 32 (9-10) (2013)
Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS (2013)
Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre, Moshe Y. Vardi
Pushdown module checking with imperfect information. Inf. Comput. 223 (2013)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: a collapsible approach to higher-order verification. ICFP (2013)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) (2012)
Dietmar Berwanger, Olivier Serre
Parity games on undirected graphs. Inf. Process. Lett. 112 (23) (2012)
Arnaud Carayol, Olivier Serre
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. LICS (2012)
Arnaud Carayol, Axel Haddad, Olivier Serre
Qualitative Tree Languages. LICS (2011)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Recursion Schemes and Logical Reflection. LICS (2010)
Vincent Gripon, Olivier Serre
Qualitative Concurrent Games with Imperfect Information CoRR (2009)
Vincent Gripon, Olivier Serre
Qualitative Concurrent Stochastic Games with Imperfect Information. ICALP (2) (2009)
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre
Winning Regions of Higher-Order Pushdown Games. LICS (2008)
Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre
µ-calculus Pushdown Module Checking with Imperfect State Information. IFIP TCS (2008)
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Automata and Recursion Schemes. LICS (2008)
Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun
Tree Pattern Rewriting Systems. ATVA (2008)
Christof Löding, Carsten Lutz, Olivier Serre
Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. 73 (1-2) (2007)
Vince Bárány, Christof Löding, Olivier Serre
Regularity Problems for Visibly Pushdown Languages. STACS (2006)
Olivier Serre
Games with winning conditions of high Borel complexity. Theor. Comput. Sci. 350 (2-3) (2006)
Christof Löding, Olivier Serre
Propositional Dynamic Logic with Recursive Programs. FoSSaCS (2006)
Olivier Serre
Parity Games Played on Transition Graphs of One-Counter Processes. FoSSaCS (2006)
Olivier Serre
Games with Winning Conditions of High Borel Complexity. ICALP (2004)
Olivier Serre
Vectorial languages and linear temporal logic. Theor. Comput. Sci. 310 (1-3) (2004)
Christof Löding, P. Madhusudan, Olivier Serre
Visibly Pushdown Games. FSTTCS (2004)
Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz
Pushdown Games with Unboundedness and Regular Conditions. FSTTCS (2003)
Olivier Serre
Note on winning positions on pushdown games with [omega]-regular conditions. Inf. Process. Lett. 85 (6) (2003)
Olivier Serre
Vectorial Languages and Linear Temporal Logic. IFIP TCS (2002)

Olivier Serre.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Serre