default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Horn 0001
Person information
- affiliation: LIAFA, Université Paris 7, France
Other persons with the same name
- Florian Horn 0002 — Goethe Universität Frankfurt am Main, Germany
- Florian Horn 0003
![[0000-0001-5421-0888]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-5421-0888")
— Friedrich-Alexander-University Erlangen-Nuremberg, Erlangen, Germany - Florian Horn 0004 — TU Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20(1) (2024)- 2023
- [c20]Laurent Bulteau, Pierre-Yves David, Florian Horn:
The Problem of Discovery in Version Control Systems. LAGOS 2023: 209-216 - [i11]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - 2022
- [i10]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. CoRR abs/2212.12024 (2022) - 2020
- [c19]Florian Horn, Arnaud Sangnier:
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. CONCUR 2020: 46:1-46:16 - [i9]Florian Horn, Arnaud Sangnier:
Deciding the existence of cut-off in parameterized rendez-vous networks. CoRR abs/2007.05789 (2020)
2010 – 2019
- 2017
- [i8]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. CoRR abs/1709.03121 (2017) - [i7]Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. CoRR abs/1709.03122 (2017) - 2016
- [c18]Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin:
Entropy Games and Matrix Multiplication Games. STACS 2016: 11:1-11:14 - 2015
- [j6]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. 49(3): 179-203 (2015) - [c17]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. ICALP (2) 2015: 197-208 - [i6]Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin:
Entropy Games. CoRR abs/1506.04885 (2015) - 2014
- [c16]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe. FSTTCS 2014: 379-390 - [c15]Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) 2014: 267-278 - [i5]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal Strategy Synthesis for Request-Response Games. CoRR abs/1406.4648 (2014) - 2013
- [j5]Nathanaël Fijalkow, Florian Horn:
Les jeux d'accessibilité généralisée. Tech. Sci. Informatiques 32(9-10): 931-949 (2013) - 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)
2000 – 2009
- 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): 1:1-1:27 (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, Germany, 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
