Florian Horn

Chatterjee Group

6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
Obliging games
K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
How do we remember the past in randomised strategies?
J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.
[Published Version] View | DOI | Download Published Version (ext.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).
[Submitted Version] View | Files available | DOI
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

  • 3 OA Fulltext(s)

Display / Sort

Export / Embed

Grants


6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
Obliging games
K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
How do we remember the past in randomised strategies?
J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.
[Published Version] View | DOI | Download Published Version (ext.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).
[Submitted Version] View | Files available | DOI
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

  • 3 OA Fulltext(s)

Display / Sort

Export / Embed