- 19
- 18
- 3
- 2
- 2
- 2
- 1
Olivier Serre
47
Documents
Identifiants chercheurs
- olivier-serre
- 0000-0001-5936-240X
- IdRef : 089054407
Présentation
Publications
- 17
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 4
- 1
- 3
- 3
- 2
- 1
- 3
- 4
- 1
- 2
- 1
- 4
- 1
- 4
- 4
- 2
- 1
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 3
- 2
- 2
- 1
- 1
- 1
|
Games on Graphspp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩
Ouvrages
hal-04273394v1
|
Les décodeuses du numériqueCNRS Editions, 2021, 2271139481
Ouvrages
hal-03661197v1
|
|
Higher-order recursion schemes and their automata modelsJean-Éric Pin. Handbook of Automata Theory, 2, European Mathematical Society, pp.1295-1341, 2021, 978-3-98547-006-8
Chapitre d'ouvrage
hal-03176662v1
|
|
Lower Bounds for Arithmetic Circuits via the Hankel Matrix37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Montpellier, France. pp.24:1-24:17, ⟨10.4230/LIPIcs.STACS.2020.24⟩
Communication dans un congrès
hal-02440692v1
|
|
Two-Way Two-Tape AutomataDevelopments in Language Theory - 21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159
Communication dans un congrès
hal-02112626v1
|
|
Automata on Infinite Trees with Equality and Disequality Constraints Between SiblingsLICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.227-236, ⟨10.1145/2933575.2934504⟩
Communication dans un congrès
hal-01804545v1
|
|
Streaming Property Testing of Visibly Pushdown Languages *24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.17, ⟨10.4230/LIPIcs.ESA.2016.43⟩
Communication dans un congrès
hal-01362276v1
|
|
How Good Is a Strategy in a Game with Nature?30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015), 2015, Kyoto, Japan. pp.12, ⟨10.1109/LICS.2015.62⟩
Communication dans un congrès
hal-01260696v1
|
|
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013), 2013, Guwahati, India. pp.13, ⟨10.4230/LIPIcs.FSTTCS.2013.299⟩
Communication dans un congrès
hal-01260682v2
|
|
C-SHORe: a collapsible approach to higher-order verificationACM SIGPLAN International Conference on Functional Programming (ICFP'13), Sep 2013, Boston, MA, United States. pp.13-24, ⟨10.1145/2500365.2500589⟩
Communication dans un congrès
hal-00865155v1
|
|
A Saturation Method for Collapsible Pushdown SystemsAutomata, Languages and Programming, 39th International Colloquium, ICALP 2012, 2012, Warwick, United Kingdom. pp.165-176, ⟨10.1007/978-3-642-31585-5_18⟩
Communication dans un congrès
hal-00694991v1
|
|
Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selectionLICS 2012, Jun 2012, Dubrovnik, Croatia. pp.165-174, ⟨10.1109/LICS.2012.73⟩
Communication dans un congrès
hal-00733467v1
|
|
Qualitative Tree LanguagesTwenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011), 2011, Toronto, Canada. pp.13-22, ⟨10.1109/LICS.2011.28⟩
Communication dans un congrès
hal-00616304v1
|
|
Recursion Schemes and Logical ReflectionTwenty-Fifth Annual IEEE Symposium on Logic in Computer Science (LICS 2010), 2010, Edinburgh, United Kingdom. pp.120-129
Communication dans un congrès
hal-00479818v1
|
|
Qualitative Concurrent Stochastic Games with Imperfect InformationAutomata, Languages and Programming, 36th International Colloquium, ICALP 2009, Jul 2009, Rhodes, Greece. pp.200-211
Communication dans un congrès
hal-00360857v3
|
|
Collapsible Pushdown Automata and Recursion SchemesTwenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.452-461
Communication dans un congrès
hal-00345945v1
|
|
Tree Pattern Rewriting SystemsAutomated Technology for Verification and Analysis, 2008, Séoul, South Korea. pp.332-346, ⟨10.1007/978-3-540-88387-6_29⟩
Communication dans un congrès
hal-00344551v1
|
|
Winning regions of higher-order pushdown gamesTwenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204
Communication dans un congrès
hal-00345939v1
|
|
μ-Calculus Pushdown Module Checking with Imperfect State InformationFifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC1, Foundations of Computer Science, Sep 2008, Milano, Italy. pp.333-348
Communication dans un congrès
hal-00345948v1
|
|
Propositional Dynamic Logic with Recursive ProgramsFOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. pp.292-306
Communication dans un congrès
hal-00016667v1
|
|
Parity games played on transition graphs of one-counter processesFOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. pp.337-351
Communication dans un congrès
hal-00016665v1
|
|
Regularity Problems for Visibly Pushdown Languages23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006, 2006, Marseille, France. pp.420-431
Communication dans un congrès
hal-00016661v1
|
|
Visibly Pushdown GamesFST TCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th Conference, 2004, Chennai, India. pp.408-420
Communication dans un congrès
hal-00012137v1
|
|
Games with Winning Conditions of High Borel ComplexityAutomata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, 2004, Turku, Finland. pp.1150-1162
Communication dans un congrès
hal-00012134v1
|
|
Pushdown games with unboundedness and regular conditionsFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, 2003, Mumbai, India. pp.88-99
Communication dans un congrès
hal-00012141v1
|
|
Vectorial Languages and Linear Temporal Logic2nd IFIP International Conference Theoretical Computer Science (TCS@2002), 2002, Montreal, Canada. pp.576-587
Communication dans un congrès
hal-00012656v1
|
Reasoning about strategies on collapsible pushdown arenas with imperfect information2020
Pré-publication, Document de travail
hal-03014438v1
|
|
|
Pushdown Module Checking with Imperfect Information2010
Pré-publication, Document de travail
hal-00479839v2
|
|
Emptiness Of Alternating Parity Tree Automata Using Games With Imperfect Information[Research Report] PI-1992, 2012, pp.6
Rapport
hal-00700334v1
|
|
Contribution à l'étude des jeux sur des graphes de processus à pileAutre [cs.OH]. Université Paris VIII Vincennes-Saint Denis, 2004. Français. ⟨NNT : ⟩
Thèse
tel-00011326v1
|
|
Playing with Trees and LogicLogic in Computer Science [cs.LO]. Université Paris Diderot — Paris 7, 2015
HDR
tel-01260775v1
|