The SCEAS System
Navigation Menu

Search the dblp DataBase


Florian Horn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Florian Horn
    Faster Algorithms for Finitary Games. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:472-484 [Conf]
  2. Florian Horn
    Dicing on the Streett. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:1, pp:1-9 [Journal]

  3. Optimal Strategy Synthesis in Request-Response Games. [Citation Graph (, )][DBLP]

  4. Solving Simple Stochastic Games. [Citation Graph (, )][DBLP]

  5. Obliging Games. [Citation Graph (, )][DBLP]

  6. Simple Stochastic Games with Few Random Vertices Are Easy to Solve. [Citation Graph (, )][DBLP]

  7. Explicit Muller Games are PTIME. [Citation Graph (, )][DBLP]

  8. Graph Games on Ordinals. [Citation Graph (, )][DBLP]

  9. Self-Stabilizing k-out-of-l exclusion on tree networks. [Citation Graph (, )][DBLP]

  10. Stochastic Games with Finitary Objectives. [Citation Graph (, )][DBLP]

  11. Solving Simple Stochastic Tail Games. [Citation Graph (, )][DBLP]

  12. On Reachability Games of Ordinal Length. [Citation Graph (, )][DBLP]

  13. Random Fruits on the Zielonka Tree. [Citation Graph (, )][DBLP]

  14. Solving Simple Stochastic Games with Few Random Vertices [Citation Graph (, )][DBLP]

  15. Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions [Citation Graph (, )][DBLP]

  16. Self-stabilizing K-out-of-L exclusion on tree network [Citation Graph (, )][DBLP]

  17. Random Fruits on the Zielonka Tree [Citation Graph (, )][DBLP]

  18. How do we remember the past in randomised strategies? [Citation Graph (, )][DBLP]

Search in 0.030secs, Finished in 0.031secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002