- 8
- 4
- 2
- 2
- 1
Olivier Serre
17
Documents
Identifiants chercheurs
- olivier-serre
- 0000-0001-5936-240X
- IdRef : 089054407
Présentation
Publications
- 17
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 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
- 4
- 1
- 1
- 1
|
Games on Graphspp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩
Ouvrages
hal-04273394v1
|
|
Collapsible Pushdown Parity GamesACM Transactions on Computational Logic, 2021, 22 (3), pp.16:1-16:51
Article dans une revue
hal-03014435v1
|
|
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical PropertiesACM Transactions on Computational Logic, 2021, 22 (2), ⟨10.1145/3452917⟩
Article dans une revue
hal-03014425v1
|
|
How Good Is a Strategy in a Game with Nature?ACM Transactions on Computational Logic, 2020, 21 (3), pp.21:1-21:39. ⟨10.1145/3377137⟩
Article dans une revue
hal-02487233v1
|
|
Pure Strategies in Imperfect Information Stochastic GamesFundamenta Informaticae, 2018, 160 (4), pp.361-384. ⟨10.3233/FI-2018-1687⟩
Article dans une revue
hal-01831546v1
|
|
Counting Branches in Trees Using GamesInformation and Computation, 2017, 252, pp.221-242. ⟨10.1016/j.ic.2016.11.005⟩
Article dans une revue
hal-01563189v1
|
|
Marking shortest paths on pushdown graphs does not preserve MSO decidabilityInformation Processing Letters, 2016, 116 (10), pp.638-643. ⟨10.1016/j.ipl.2016.04.015⟩
Article dans une revue
hal-01362289v1
|
|
Randomisation in Automata on Infinite TreesACM Transactions on Computational Logic, 2014, 15 (3), pp.24. ⟨10.1145/2629336⟩
Article dans une revue
hal-01260669v1
|
|
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
|
|
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
|
|
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
|
|
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
|
|
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
|
|
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
|
|
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
|
|
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
|