Florian Horn

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2011
j4		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)
c14		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: The Complexity of Request-Response Games. LATA 2011: 227-237
	2010
c13		Krishnendu Chatterjee, Florian Horn, Christof Löding: Obliging Games. CONCUR 2010: 284-296
c12		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Tail Games. SODA 2010: 847-862
c11		Julien Cristau, Claire David, Florian Horn: How do we remember the past in randomised strategies? GANDALF 2010: 30-39
i4		Nathanaël Fijalkow, Florian Horn: The surprizing complexity of reachability games. CoRR abs/1010.2420 (2010)
	2009
j3		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Games with Few Random Vertices. 5(2) (2009)
j2		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1) (2009)
c10		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
c9		Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Stochastic Games with Finitary Objectives. MFCS 2009: 34-54
c8		Florian Horn: Random Fruits on the Zielonka Tree. STACS 2009: 541-552
i3		Florian Horn: Random Fruits on the Zielonka Tree. CoRR abs/0902.2736 (2009)
	2008
b1		Florian Horn: Random games. RWTH Aachen University 2008, pp. 1-137
c7		Florian Horn, Wolfgang Thomas, Nico Wallmeier: Optimal Strategy Synthesis in Request-Response Games. ATVA 2008: 361-373
c6		Hugo Gimbert, Florian Horn: Solving Simple Stochastic Games. CiE 2008: 206-209
c5		Hugo Gimbert, Florian Horn: Simple Stochastic Games with Few Random Vertices Are Easy to Solve. FoSSaCS 2008: 5-19
c4		Julien Cristau, Florian Horn: Graph Games on Ordinals. FSTTCS 2008: 143-154
c3		Florian Horn: Explicit Muller Games are PTIME. FSTTCS 2008: 235-243
c2		Julien Cristau, Florian Horn: On Reachability Games of Ordinal Length. SOFSEM 2008: 211-221
i2		Florian Horn, Hugo Gimbert: Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions. CoRR abs/0811.3978 (2008)
i1		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)
	2007
j1		Florian Horn: Dicing on the Streett. Inf. Process. Lett. 104(1): 1-9 (2007)
c1		Florian Horn: Faster Algorithms for Finitary Games. TACAS 2007: 472-484

Coauthor Index

1	Krishnendu Chatterjee	[c14] [c13] [j2] [c9]
2	Julien Cristau	[c11] [c4] [c2]
3	Ajoy Kumar Datta	[j4] [c10] [i1]
4	Claire David	[c11]
5	Stéphane Devismes	[j4] [c10] [i1]
6	Nathanaël Fijalkow	[i4]
7	Hugo Gimbert	[c12] [j3] [c6] [c5] [i2]
8	Thomas A. Henzinger	[c14] [j2] [c9]
9	Lawrence L. Larmore	[j4] [c10] [i1]
10	Christof Löding	[c13]
11	Wolfgang Thomas	[c7]
12	Nico Wallmeier	[c7]

Colors in the list of coauthors

Last update Wed May 22 22:08:46 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page