|
2023
|
|
| [BDH23] | Laurent Bulteau, Pierre-Yves David and Florian Horn. The problem of discovery in version control systems. In Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS'23, volume 223 of Procedia Computer Science, pages 209-216. Elsevier, 2023. (pdf, BibTeX) |
|
2020
|
|
| [HS20] | Florian Horn and Arnaud Sangnier. Deciding the Existence of Cut-Off in Parametrized Rendez-vous Networks. In Proceedings of the 31st International Conference on Concurrency Theory, CONCUR'20, volume 171 of LIPIcs, pages 46:1-46:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. (pdf, BibTeX ) |
|
2016
|
|
| [ACD+16] | Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn and Victor S. Kozyakin. Entropy Games and Matrix Multiplication Games. In Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, STACS'16, volume 47 of LIPIcs, pages 11:1-11:14. Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2016. (pdf, BibTeX ) |
|
2015
|
|
| [HTWZ15] | Florian Horn, Wolfgang Thomas, Nico Wallmeier and Martin Zimmermann. Optimal strategy synthesis for request-response games. In volume 49(3) of RAIRO - Theoretical Informatics and Applications, pages 179-203. EDP Sciences, 2015. (pdf, BibTeX ) |
| [FHKS15] | Nathanaël Fijalkow, Florian Horn, Denis Kuperberg and Michal Skrzypczak. Trading Bounds for Memory in Games with Counters. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, volume 9135 of Lecture Notes in Computer Science, pages 197-208. Springer, 2015. (pdf, BibTeX ) |
|
2014
|
|
| [FGHO14] | Nathanaël Fijalkow, Hugo Gimbert, Florian Horn and Youssouf Oualhadj Two Recursively Inseparable Problems for Probabilistic Automata. In Proceedings of the 39th International Symposium on the Mathematical Foundations of Computer Science, MFCS'14, Part I, volume 8634, pages 267-278 of Lecture Notes in Computer Science. Springer, 2014. (pdf, BibTeX ) |
| [CFH14] | Thomas Colcombet, Nathanaël Fijalkow and Florian Horn. Playing Safe. In Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS'14, volume 29 of LIPIcs, pages 379-390. Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014. (pdf, BibTeX ) |
|
2013
|
|
| [FH13] | Nathanaël Fijalkow and Florian Horn. Les jeux d'accessibilité généralisée. In volume 32(9-10) of Technique et Science Informatiques, pages 931-949. Lavoisier, 2013. (pdf, BibTeX ) |
|
2011
|
|
| [DDHL11] | Ajoy K. Datta, Stéphane Devimes, Florian Horn, and Lawrence L. Larmore. Self-stabilizing k-out-of-l Exclusion in Tree Networks. In International Journal of Foudations of Computer Science, IJFCS, volume 22(3), pages 657-677. World Scientific Publishing Company, 2011. (pdf, BibTeX ) |
| [CHH11] | Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. The Complexity of Request-Response Games. In Proceedings of the 5th International Conference on Language and Automata Theory and Applications, LATA'11, volume 6638 of Lecture Notes in Computer Science, pages 227-237. Springer-Verlag, 2011. (pdf, BibTeX ) |
|
2010
|
|
| [CHL10] | Krishnendu Chatterjee, Florian Horn, and Christof Loeding. Obliging Games. In Proceedings of the 21st International Conference on Concurrency Theory, CONCUR'10. |
| [CDH10] | Julien Cristau, Claire David, and Florian Horn. How do we remember the past in randomised strategies? In Proceedings of the First International Symposium on Games, Automata, Logics and Formal Verification, GandALF'10, volume 26 of Electronic Proceedings in Theoretical Computer Science, pages 24-33. 2010. (pdf, BibTeX ) |
| [GH10] | Hugo Gimbert and Florian Horn. Solving Simple Stochastic Tail Games. In Proceedings of the 21st Symposium on Discrete Algorithms, SODA'10, pages 847-863. Society for Industrial and Applied Mathematics, 2010. |
|
2009
|
|
| [CHH09b] | Krishnendu Chatterjee, Thomas A. Henzinger and Florian Horn. Stochastic Games with Finitary Objectives. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS'09, volume 5734 of Lecture Notes in Computer Science, pages 34-54. Springer-Verlag, 2009. (pdf, BibTeX ) |
| [DDHL09] | Ajoy K. Datta, Stéphane Devimes, Florian Horn, and Lawrence L. Larmore. Self-Stabilizing k-out-of-l Exclusion on Tree Networks. To appear in Proceedings of the 11th Workshop on Advances in Parallel and Distributed Computational Models, APDCM'2009. IEEE, 2009. (pdf, BibTeX ) |
| [GH09] | Hugo Gimbert and Florian Horn. Solving Simple Stochastic Games with Few Random Vertices. In Logical Methods in Computer Science, LMCS, volume 5(2): 9th. International Federation for Computational Logic, 2009. (pdf, BibTeX ) |
| [Hor09] | Florian Horn. Random Fruits on the Zielonka Tree. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS'09, volume 3 of Leibniz International Proceedings in Informatics, pages 541-552. Dagstuhl Research Online Publication Server, 2009. (pdf, BibTeX ) |
| [CHH09a] | Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Finitary Winning in ω-Regular Games. In ACM Transactions on Computational Logic, ToCL, volume 11(1): 1st. ACM Press, 2009. (pdf, BibTeX ) |
|
2008
|
|
| [Hor08b] | Florian Horn. Random Games. PhD Thesis under the supervision of Anca Muscholl and Wolfgang Thomas. (pdf, BibTeX ) |
| [Hor08a] | Florian Horn. Explicit Muller Games are PTIME. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'08, volume 2 of Leibniz International Proceedings in Informatics, pages 235-243. Dagstuhl Research Online Publication Server, 2008. (pdf, BibTeX ) |
| [CH08b] | Julien Cristau and Florian Horn. Graph Games on Ordinals. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'08, volume 2 of Leibniz International Proceedings in Informatics, pages 143-154. Dagstuhl Research Online Publication Server, 2008. (pdf, BibTeX ) |
| [HTW08] | Florian Horn, Wolfgang Thomas, and Nico Wallmeier. Optimal Strategy Synthesis in Request-Response Games. In Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis, ATVA'08, volume 5311 of Lecture Notes in Computer Science, pages 361-373. Springer-Verlag, 2008. (pdf, BibTeX ) |
| [GH08] | Hugo Gimbert and Florian Horn. Simple Stochastic Games with Few Random Vertices are Easy to Solve. In Proceedings of the 11th International Conference on the Foundations of Software Science and Computational Structures, FoSSaCS'08, volume 4962 of Lecture Notes in Computer Science, pages 5-19. Springer-Verlag, 2008. (pdf, BibTeX ) |
| [CH08a] | Julien Cristau and Florian Horn. On Reachability Games of Ordinal Length. In Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM'08, volume 4911 of Lecture Notes in Computer Science, pages 211-221. Springer-Verlag, 2008. (pdf, BibTeX ) |
|
2007
|
|
| [Hor07b] | Florian Horn. Dicing on the Streett. Information Processing Letters, volume 104(1), pages 1-9. Elsevier, 2008. (pdf, BibTeX ) |
| [Hor07a] | Florian Horn. Faster Algorithms for Finitary Games. In Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'07, volume 4424 of Lecture Notes in Computer Science, pages 472-484. Springer-Verlag, 2007. (pdf, BibTeX ) |
|
2005
|
|
| [Hor05] | Florian Horn. Streett Games on Finite Graphs. In the 2nd Workshop on Games in Design and Verification, GDV'05, 2005. (pdf, BibTeX ) |
