default search action
Olivier Serre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i16]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
- [j18]Nathanaël Fijalkow
, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30(2): 14 (2021) - [j17]Raphaël Berthon
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22(1): 7:1-7:24 (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
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) - [c23]Nathanaël Fijalkow
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS 2020: 24:1-24:17 - [i15]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 abs/2002.03664 (2020) - [i14]Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game With Nature? CoRR abs/2002.09942 (2020) - [i13]Bastien Maubert, Aniello Murano, Olivier Serre:
Reasoning about strategies on collapsible pushdown arenas with imperfect information. CoRR abs/2007.15458 (2020) - [i12]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) - [i11]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
- 2018
- [j13]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160(4): 361-384 (2018) - [i10]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR abs/1805.11873 (2018) - [i9]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j12]Arnaud Carayol, Olivier Serre:
Counting branches in trees using games. Inf. Comput. 252: 221-242 (2017) - [j11]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Automata and Recursion Schemes. ACM Trans. Comput. Log. 18(3): 25:1-25:42 (2017) - [c22]Olivier Carton
Two-Way Two-Tape Automata. DLT 2017: 147-159 - [i8]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR abs/1703.04429 (2017) - [i7]Olivier Carton, Léo Exibard, Olivier Serre:
Two-way Two-tape Automata. CoRR abs/1710.00213 (2017) - 2016
- [j10]Arnaud Carayol, Olivier Serre:
Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. 116(10): 638-643 (2016) - [c21]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. ESA 2016: 43:1-43:17 - [c20]Arnaud Carayol, Christof Löding, Olivier Serre:
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS 2016: 227-236 - 2015
- [b2]Olivier Serre:
Playing with Trees and Logic. Paris Diderot University, France, 2015 - [j9]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) - [c19]Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? LICS 2015: 609-620 - [i6]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. CoRR abs/1505.03334 (2015) - [i5]Arnaud Carayol, Axel Haddad, Olivier Serre:
Counting Branches in Trees Using Games. CoRR abs/1505.03852 (2015) - [i4]Arnaud Carayol, Christof Löding, Olivier Serre:
Pure Strategies in Imperfect Information Stochastic Games. CoRR abs/1506.09140 (2015) - [i3]Arnaud Carayol, Olivier Serre:
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability. CoRR abs/1510.04000 (2015) - [i2]Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont:
Streaming Property Testing of Visibly Pushdown Languages. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j8]Arnaud Carayol, Axel Haddad, Olivier Serre:
Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. 15(3): 24:1-24:33 (2014) - 2013
- [j7]Benjamin Aminof, Axel Legay, Aniello Murano
Pushdown module checking with imperfect information. Inf. Comput. 223: 1-17 (2013) - [j6]Dietmar Berwanger, Olivier Serre:
Introduction. Tech. Sci. Informatiques 32(9-10): 907-908 (2013) - [c18]Nathanaël Fijalkow
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS 2013: 299-311 - [c17]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague
C-SHORe: a collapsible approach to higher-order verification. ICFP 2013: 13-24 - 2012
- [j5]Dietmar Berwanger
Parity games on undirected graphs. Inf. Process. Lett. 112(23): 928-932 (2012) - [c16]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) 2012: 165-176 - [c15]Arnaud Carayol, Olivier Serre:
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. LICS 2012: 165-174 - 2011
- [c14]Arnaud Carayol, Axel Haddad, Olivier Serre:
Qualitative Tree Languages. LICS 2011: 13-22 - 2010
- [c13]Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong
Recursion Schemes and Logical Reflection. LICS 2010: 120-129
2000 – 2009
- 2009
- [c12]Vincent Gripon, Olivier Serre:
Qualitative Concurrent Stochastic Games with Imperfect Information. ICALP (2) 2009: 200-211 - [i1]Vincent Gripon, Olivier Serre:
Qualitative Concurrent Games with Imperfect Information. CoRR abs/0902.2108 (2009) - 2008
- [c11]Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun:
Tree Pattern Rewriting Systems. ATVA 2008: 332-346 - [c10]Benjamin Aminof, Axel Legay, Aniello Murano
µ-calculus Pushdown Module Checking with Imperfect State Information. IFIP TCS 2008: 333-348 - [c9]Arnaud Carayol, Matthew Hague
Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204 - [c8]Matthew Hague
Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461 - 2007
- [j4]Christof Löding, Carsten Lutz
Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. 73(1-2): 51-69 (2007) - 2006
- [j3]Olivier Serre:
Games with winning conditions of high Borel complexity. Theor. Comput. Sci. 350(2-3): 345-372 (2006) - [c7]Christof Löding, Olivier Serre:
Propositional Dynamic Logic with Recursive Programs. FoSSaCS 2006: 292-306 - [c6]Olivier Serre:
Parity Games Played on Transition Graphs of One-Counter Processes. FoSSaCS 2006: 337-351 - [c5]Vince Bárány, Christof Löding, Olivier Serre:
Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431 - 2004
- [b1]Olivier Serre:
Contribution à l'étude des jeux sur des graphes de processus à pile. (Contribution to pushdown games studies). Paris 8 University, Saint-Denis, France, 2004 - [j2]Olivier Serre:
Vectorial languages and linear temporal logic. Theor. Comput. Sci. 310(1-3): 79-116 (2004) - [c4]Christof Löding, P. Madhusudan, Olivier Serre:
Visibly Pushdown Games. FSTTCS 2004: 408-420 - [c3]Olivier Serre:
Games with Winning Conditions of High Borel Complexity. ICALP 2004: 1150-1162 - 2003
- [j1]Olivier Serre:
Note on winning positions on pushdown games with [omega]-regular conditions. Inf. Process. Lett. 85(6): 285-291 (2003) - [c2]Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz:
Pushdown Games with Unboundedness and Regular Conditions. FSTTCS 2003: 88-99 - 2002
- [c1]Olivier Serre:
Vectorial Languages and Linear Temporal Logic. IFIP TCS 2002: 576-587
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-04-25 05:53 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: