Florian Horn

Chatterjee Group

6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.
[Published Version] View | DOI | Download Published Version (ext.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1. ACM, 2009.
[Submitted Version] View | Files available | DOI
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
K. Chatterjee, T. A. Henzinger, and 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

Citation Style: IEEE

Export / Embed

Grants


6 Publications

Mark all

[6]
2011 | Published | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 
[5]
2010 | Published | Conference Paper | IST-REx-ID: 3854
K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
View | DOI
 
[4]
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.
[Published Version] View | DOI | Download Published Version (ext.)
 
[3]
2009 | Published | Journal Article | IST-REx-ID: 3870 | OA
K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1. ACM, 2009.
[Submitted Version] View | Files available | DOI
 
[2]
2009 | Published | Conference Paper | IST-REx-ID: 4543
K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.
View | DOI
 
[1]
2009 | Published | Technical Report | IST-REx-ID: 5394 | OA
K. Chatterjee, T. A. Henzinger, and 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

Citation Style: IEEE

Export / Embed