Florian Horn
Chatterjee Group
6 Publications
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. Obliging games. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:284-296. doi:10.1007/978-3-642-15375-4_20
View
| DOI
2010 | Conference Paper | IST-REx-ID: 489 | 
Cristau J, David C, Horn F. How do we remember the past in randomised strategies? . In: Proceedings of GandALF 2010. Vol 25. Open Publishing Association; 2010:30-39. doi:10.4204/EPTCS.25.7
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 2009;11(1). doi:10.1145/1614431.1614432
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives. In: Vol 5734. Springer; 2009:34-54. doi:10.1007/978-3-642-03816-7_4
View
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002
[Published Version]
View
| Files available
| DOI
6 Publications
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. Obliging games. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:284-296. doi:10.1007/978-3-642-15375-4_20
View
| DOI
2010 | Conference Paper | IST-REx-ID: 489 |
Cristau J, David C, Horn F. How do we remember the past in randomised strategies? . In: Proceedings of GandALF 2010. Vol 25. Open Publishing Association; 2010:30-39. doi:10.4204/EPTCS.25.7
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 2009;11(1). doi:10.1145/1614431.1614432
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives. In: Vol 5734. Springer; 2009:34-54. doi:10.1007/978-3-642-03816-7_4
View
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002
[Published Version]
View
| Files available
| DOI