Florian Horn
Chatterjee Group
6 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_20.
View
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 489 | 
Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .” In Proceedings of GandALF 2010, 25:30–39. Open Publishing Association, 2010. https://doi.org/10.4204/EPTCS.25.7.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Published | Journal Article | IST-REx-ID: 3870 |
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2009. https://doi.org/10.1145/1614431.1614432.
[Submitted Version]
View
| Files available
| DOI
2009 | Published | Conference Paper | IST-REx-ID: 4543
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
View
| DOI
2009 | Published | Technical Report | IST-REx-ID: 5394 |
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002.
[Published Version]
View
| Files available
| DOI
Search
Filter Publications
Display / Sort
Export / Embed
Grants
6 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_20.
View
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 489 |
Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .” In Proceedings of GandALF 2010, 25:30–39. Open Publishing Association, 2010. https://doi.org/10.4204/EPTCS.25.7.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Published | Journal Article | IST-REx-ID: 3870 |
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2009. https://doi.org/10.1145/1614431.1614432.
[Submitted Version]
View
| Files available
| DOI
2009 | Published | Conference Paper | IST-REx-ID: 4543
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
View
| DOI
2009 | Published | Technical Report | IST-REx-ID: 5394 |
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002.
[Published Version]
View
| Files available
| DOI