Florian Horn

	2011
23		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: The Complexity of Request-Response Games. LATA 2011: 227-237
22		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. 22(3): 657-677 (2011)
	2010
21		Krishnendu Chatterjee, Florian Horn, Christof Löding: Obliging Games. CONCUR 2010: 284-296
20		Julien Cristau, Claire David, Florian Horn: How do we remember the past in randomised strategies? GANDALF 2010: 30-39
19		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Tail Games. SODA 2010: 847-862
18		Nathanaël Fijalkow, Florian Horn: The surprizing complexity of reachability games CoRR abs/1010.2420: (2010)
	2009
17		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-Stabilizing k-out-of-l exclusion on tree networks. IPDPS 2009: 1-8
16		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Stochastic Games with Finitary Objectives. MFCS 2009: 34-54
15		Florian Horn: Random Fruits on the Zielonka Tree. STACS 2009: 541-552
14		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1): (2009)
13		Florian Horn: Random Fruits on the Zielonka Tree CoRR abs/0902.2736: (2009)
12		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Games with Few Random Vertices Logical Methods in Computer Science 5(2): (2009)
	2008
11		Florian Horn, Wolfgang Thomas, Nico Wallmeier: Optimal Strategy Synthesis in Request-Response Games. ATVA 2008: 361-373
10		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Games. CiE 2008: 206-209
9		Julien Cristau, Florian Horn: Graph Games on Ordinals. FSTTCS 2008: 143-154
8		Florian Horn: Explicit Muller Games are PTIME. FSTTCS 2008: 235-243
7		Hugo Gimbert, Florian Horn: Simple Stochastic Games with Few Random Vertices Are Easy to Solve. FoSSaCS 2008: 5-19
6		Julien Cristau, Florian Horn: On Reachability Games of Ordinal Length. SOFSEM 2008: 211-221
5		Florian Horn, Hugo Gimbert: Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions CoRR abs/0811.3978: (2008)
4		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-stabilizing K-out-of-L exclusion on tree network CoRR abs/0812.1093: (2008)
3		Florian Horn: Random games. RWTH Aachen University 2008: 1-137
	2007
2		Florian Horn: Faster Algorithms for Finitary Games. TACAS 2007: 472-484
1		Florian Horn: Dicing on the Streett. Inf. Process. Lett. 104(1): 1-9 (2007)

Coauthor Index

1	Krishnendu Chatterjee	[14] [16] [21] [23]
2	Julien Cristau	[6] [9] [20]
3	Ajoy Kumar Datta	[4] [17] [22]
4	Claire David	[20]
5	Stéphane Devismes	[4] [17] [22]
6	Nathanaël Fijalkow	[18]
7	Hugo Gimbert	[5] [7] [10] [12] [19]
8	Thomas A. Henzinger	[14] [16] [23]
9	Lawrence L. Larmore	[4] [17] [22]
10	Christof Löding	[21]
11	Wolfgang Thomas	[11]
12	Nico Wallmeier	[11]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page