Florian Horn
Chatterjee Group
6 Publications
2010 | Conference Paper | IST-REx-ID: 489 |
Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
[Submitted Version]
View
| Files available
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
[Published Version]
View
| Files available
| DOI
6 Publications
2010 | Conference Paper | IST-REx-ID: 489 |
Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2009 | Journal Article | IST-REx-ID: 3870 |
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
[Submitted Version]
View
| Files available
| DOI
2009 | Technical Report | IST-REx-ID: 5394 |
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
[Published Version]
View
| Files available
| DOI