Florian Horn

From MaRDI portal
Person:2379983



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Playing Safe, Ten Years Later
Logical Methods in Computer Science
2024-03-11Paper
scientific article; zbMATH DE number 7559502 (Why is no real title available?)
(available as arXiv preprint)
2022-07-18Paper
How do we remember the past in randomised strategies?2021-02-16Paper
Entropy Games and Matrix Multiplication Games
(available as arXiv preprint)
2018-01-24Paper
Playing Safe2017-04-25Paper
Optimal strategy synthesis for request-response games
RAIRO. Theoretical Informatics and Applications
2016-01-22Paper
Trading bounds for memory in games with counters
Automata, Languages, and Programming
2015-11-04Paper
Finitary winning in \({\omega}\)-regular games
ACM Transactions on Computational Logic
2015-09-17Paper
Two recursively inseparable problems for probabilistic automata
Mathematical Foundations of Computer Science 2014
2014-10-14Paper
Solving simple stochastic tail games2014-05-22Paper
Explicit Muller games are PTIME2012-10-19Paper
Graph games on ordinals2012-10-19Paper
Random fruits on the zielonka tree2012-04-24Paper
The complexity of request-response games
Language and Automata Theory and Applications
2011-06-03Paper
Self-stabilizing \(k\)-out-of-\(\ell\) exclusion in tree networks
International Journal of Foundations of Computer Science
2011-05-10Paper
Obliging games
CONCUR 2010 - Concurrency Theory
2010-08-31Paper
Dicing on the Streett
Information Processing Letters
2010-03-24Paper
Stochastic Games with Finitary Objectives
Mathematical Foundations of Computer Science 2009
2009-10-16Paper
Solving Simple Stochastic Games with Few Random Vertices
Logical Methods in Computer Science
2009-06-30Paper
Optimal strategy synthesis in request-response games
Lecture Notes in Computer Science
2008-11-20Paper
Solving Simple Stochastic Games
Logic and Theory of Algorithms
2008-06-19Paper
Simple Stochastic Games with Few Random Vertices Are Easy to Solve
Foundations of Software Science and Computational Structures
2008-04-11Paper
On Reachability Games of Ordinal Length
SOFSEM 2008: Theory and Practice of Computer Science
2008-03-07Paper
Faster Algorithms for Finitary Games
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper


Research outcomes over time


This page was built for person: Florian Horn