Florian Horn
Chatterjee Group
6 Publications
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View
| DOI
2010 | Conference Paper | IST-REx-ID: 489 | 
Cristau, J., David, C., & Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1614431.1614432
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
[Published Version]
View
| Files available
| DOI
6 Publications
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View
| DOI
2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View
| DOI
2010 | Conference Paper | IST-REx-ID: 489 |
Cristau, J., David, C., & Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1614431.1614432
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
View
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
[Published Version]
View
| Files available
| DOI