2010 |
|
• |
D. Berwanger. Infinite Coordination Games. In Logic and the Foundations of Game and Decision Theory (LOFT8), Texts in Logic and Games. Amsterdam University Press, 2010. To appear. ( PDF | BibTeX + Abstract )
|
|
• |
D. Berwanger, K. Chatterjee, L. Doyen, M. De Wulf and Th. A. Henzinger. Strategy Construction for Parity Games with Imperfect Information. Information and Computation, 2010. To appear. ( PDF | PS | PS.GZ | BibTeX + Abstract )
|
|
• |
D. Berwanger and Ł. Kaiser. Information Tracking in Games on Graphs. Journal of Logic, Language and Information, 2010. To appear. ( PDF | BibTeX + Abstract )
|
2009 |
|
• |
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen and Th. A. Henzinger. Alpaga: A Tool for Solving Parity Games with Imperfect Information. In TACAS'09, LNCS 5505, pages 58-61. Springer, 2009. ( PDF | BibTeX + Abstract )
|
|
• |
D. Berwanger and S. Pinchinat. Game Quantification Patterns. In ICLA'09, LNAI 5378, pages 116-130. Springer, 2009. ( PDF | BibTeX + Abstract )
|
2008 |
|
• |
D. Berwanger and L. Doyen. On the Power of Imperfect Information. In FSTTCS'08, Leibniz International Proceedings in Informatics 2. Leibniz-Zentrum für Informatik, 2008. ( PDF | BibTeX + Abstract )
|
|
• |
D. Berwanger, K. Chatterjee, L. Doyen, Th. A. Henzinger and S. Raje. Strategy Construction for Parity Games with Imperfect Information. In CONCUR'08, LNCS 5201, pages 325-339. Springer, 2008. ( PDF | BibTeX )
|
2007 |
|
• |
D. Berwanger, E. Grädel and G. Lenzi. The variable hierarchy of the μ-calculus is strict. Theory of Computing Systems 40(4), pages 437-466, 2007. ( PDF | BibTeX )
|
|
• |
D. Berwanger. Admissibility in infinite games. In STACS'07, LNCS 4393, pages 188-199. Springer, 2007. ( PDF | BibTeX )
|
2006 |
|
• |
D. Berwanger and D. Janin. Automata on Directed Graphs: Vertex versus Edge Marking. In ICGT'06, LNCS 4178, pages 46-60. Springer, 2006. ( PDF | BibTeX )
|
|
• |
D. Berwanger, A. Dawar, P. Hunter and S. Kreutzer. DAG-width and parity games. In STACS'06, LNCS 3884, pages 524-536. Springer, 2006. ( PDF | BibTeX )
|
2005 |
|
• |
D. Berwanger. Games and Logical Expressiveness. Ph.D. Thesis, Department of Computer Science, RWTH Aachen, Germany, 2005. ( PDF | BibTeX )
|
|
• |
D. Berwanger and E. Grädel. Entanglement - A Measure for the Complexity of Directed Graphs with
Applications to Logic and Games. In LPAR'04, LNAI 3452, pages 209-223. Springer, 2005. ( PDF | BibTeX )
|
|
• |
D. Berwanger and G. Lenzi. The variable hierarchy of the μ-calculus is strict. In STACS'05, LNCS 3404, pages 97-109. Springer, 2005. ( PS | PS.GZ | BibTeX )
|
2004 |
|
• |
D. Berwanger and E. Grädel. Fixed-Point Logics and Solitaire Games. Theory of Computing Systems 37(6), pages 675-694, 2004. ( PDF | BibTeX )
|
2003 |
|
• |
D. Berwanger. Game Logic is Strong Enough for Parity Games. Studia Logica 75(2), pages 205-219, 2003. ( PDF | BibTeX )
|
|
• |
D. Berwanger, E. Grädel and S. Kreutzer. Once Upon a Time in the West. Determinacy, Complexity and Definability
of Path Games. In LPAR'03, LNAI 2850, pages 226-240. Springer, 2003. ( PS | PS.GZ | BibTeX )
|
2002 |
|
• |
D. Berwanger and A. Blumensath. Automata for Guarded Fixed Point Logics. In Automata, Logics, and Infinite Game, LNCS 2500, chapter 19, pages 343-355. Springer, 2002. ( PS | PS.GZ | BibTeX )
|
|
• |
D. Berwanger and A. Blumensath. The Monadic Theory of Tree-like Structures. In Automata, Logics, and Infinite Game, LNCS 2500, chapter 16, pages 285-301. Springer, 2002. ( PS | PS.GZ | BibTeX )
|
|
• |
D. Berwanger, E. Grädel and G. Lenzi. On the variable hierarchy of the modal μ-calculus. In CSL'02, LNCS 2471, pages 352-366. Springer, 2002. ( PS | PS.GZ | BibTeX )
|
2001 |
|
• |
D. Berwanger and E. Grädel. Games and Model Checking for Guarded Logics. In LPAR'01, LNAI 2250, pages 70-84. Springer, 2001. ( PS | PS.GZ | BibTeX )
|