Florian Horn

Chatterjee Group

6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
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.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
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
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
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
 
Marked Publication(s)

Search

Filter Publications

  • 3 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
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.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
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
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
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
 
Marked Publication(s)

Search

Filter Publications

  • 3 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed