Krzysztof Apt
Erich Grädel
2011
Lectures in Game Theory for Computer Scientists
Cambridge University Press
10.1017/CBO9780511973468
Dietmar Berwanger
Anuj Dawar
Paul Hunter
Stephan Kreutzer
Jan Obdržálek
The DAG-Width of Directed Graphs
10.1016/j.jctb.2012.04.004
To appear
Dietmar Berwanger
Erich Grädel
2005
Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
Proceedings of LPAR 2004, Montevideo, Uruguay
LNCS
3452
Springer
209–223
10.1007/978-3-540-32275-7_15
Dietmar Berwanger
Erich Grädel
Łukasz Kaiser
Roman Rabinovich
Entanglement and the Complexity of Directed Graphs
Theoretical Computer Science
http://logic.rwth-aachen.de/~rabinovich/entangle.pdf
To appear
Bruno Courcelle
Joost Engelfriet
Grzegorz Rozenberg
1993
Handle-Rewriting Hypergraph Grammars
J. Comput. Syst. Sci.
46
2
218–270
10.1016/0022-0000(93)90004-G
John Fearnley
2010
Non-oblivious Strategy Improvement
Edmund M. Clarke
Andrei Voronkov
LPAR (Dakar)
LNCS
6355
Springer
212–230
10.1007/978-3-642-17511-4_13
Oliver Friedmann
A Subexponential Lower Bound for Policy Iteration Based on Snare Memorization
http://files.oliverfriedmann.de/papers/fearnley_lower_bound.pdf
Submitted for publication
Oliver Friedmann
A Subexponential Lower Bound for the Least Recently Considered Rule for Solving Linear Programs and Games
http://files.oliverfriedmann.de/papers/least_recently_considered_lower_bound.pdf
Submitted for publication
Oliver Friedmann
2011
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Ludwig-Maximilians-University Munich
http://edoc.ub.uni-muenchen.de/13294
P. Hunter
S. Kreutzer
2008
Digraph Measures: Kelly Decompositions, Games, and Orderings
Theor. Comput. Sci.
399
3
206–219
10.1016/j.tcs.2008.02.038
Marcin Jurdziński
1998
Deciding the Winner in Parity Games is in UP co-UP
Inf. Process. Lett.
68
3
119–124
10.1016/S0020-0190(98)00150-1
Marcin Jurdziński
2000
Small Progress Measures for Solving Parity Games
Horst Reichel
Sophie Tison
STACS
LNCS
1770
Springer
290–301
10.1007/3-540-46541-3 _24
Marcin Jurdziński
Mike Paterson
Uri Zwick
2006
A Deterministic Subexponential Algorithm for Solving Parity Games
SODA
ACM Press
117–123
10.1145/1109557.1109571
http://dl.acm.org/citation.cfm?id=1109557
Marcin Jurdziński
Jens Vöge
2000
A Discrete Strategy Improvement Algorithm for Solving Parity Games (Extended Abstract)
E. A. Emerson
A. P. Sistla
Computer Aided Verification, 12th International Conference, CAV 2000, Proceedings
LBCS
1855
Springer
Chicago, IL, USA
202–215
10.1007/10722167_18
Jan Obdržálek
2003
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
Warren A. Hunt Jr.
Fabio Somenzi
CAV
LNCS
2725
Springer
80–92
10.1007/978-3-540-45069-6_7
Jan Obdržálek
2007
Clique-Width and Parity Games
J. Duparc
T. A. Henzinger
CSL '07
LNCS
4646
Springer
54–68
10.1007/978-3-540-74915-8-8
Sven Schewe
2008
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
Michael Kaminski
Simone Martini
CSL
LNCS
5213
Springer
369–384
10.1007/978-3-540-87531-4_27