Dietmar Berwanger

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 15

Top Topics

Nash Equilibrium

Top Venues

Theory Comput. Syst.

Acta Informatica

Int. J. Found. Comput. Sci.

Publications

Dietmar Berwanger, Laurent Doyen
Observation and Distinction: Representing Information in Infinite Games. Theory Comput. Syst. 67 (1) (2023)
Dietmar Berwanger, Laurent Doyen, Thomas Soullard
Synthesising Full-Information Protocols. CoRR (2023)
Dietmar Berwanger, Laurent Doyen
Observation and Distinction. Representing Information in Infinite Games. STACS (2020)
Dietmar Berwanger, Marie van den Bogaard
Consensus Game Acceptors and Iterated Transductions. Int. J. Found. Comput. Sci. 29 (2) (2018)
Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard
Hierarchical information and the synthesis of distributed strategies. Acta Informatica 55 (8) (2018)
Dietmar Berwanger, Laurent Doyen
Observation and Distinction. Representing Information in Infinite Games. CoRR (2018)
Dietmar Berwanger, Anup Basil Mathew
Infinite games with finite knowledge gaps. Inf. Comput. 254 (2017)
Dietmar Berwanger, R. Ramanujam
Deviator Detection under Imperfect Monitoring. CoRR (2017)
Dietmar Berwanger, Anup Basil Mathew, R. Ramanujam
A Retraction Theorem for Distributed Synthesis. CoRR (2016)
Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard
Hierarchical Information Patterns and Distributed Strategy Synthesis. ATVA (2015)
Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard
Hierarchical Information Patterns and Distributed Strategy Synthesis. CoRR (2015)
Dietmar Berwanger, Marie van den Bogaard
Games with Delays - A Frankenstein Approach. FSTTCS (2015)
Dietmar Berwanger, Marie van den Bogaard
Games with Delays. A Frankenstein Approach. CoRR (2015)
Dietmar Berwanger, Marie van den Bogaard
Consensus Game Acceptors. DLT (2015)
Dietmar Berwanger, Marie van den Bogaard
A Characterisation of Context-Sensitive Languages by Consensus Games. CoRR (2015)
Dietmar Berwanger, Anup Basil Mathew
Infinite games with finite knowledge gaps. CoRR (2014)
Dietmar Berwanger, Anup Basil Mathew
Games with recurring certainty. SR (2014)
Dietmar Berwanger, Olivier Serre
Introduction. Tech. Sci. Informatiques 32 (9-10) (2013)
Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich
Entanglement and the complexity of directed graphs. Theor. Comput. Sci. 463 (2012)
Dietmar Berwanger, Olivier Serre
Parity games on undirected graphs. Inf. Process. Lett. 112 (23) (2012)
Dietmar Berwanger, Lukasz Kaiser, Simon Leßenich
Solving Counter Parity Games. MFCS (2012)
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
The dag-width of directed graphs. J. Comb. Theory, Ser. B 102 (4) (2012)
Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala
A Perfect-Information Construction for Coordination in Games. FSTTCS (2011)
Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger
Strategy construction for parity games with imperfect information. Inf. Comput. 208 (10) (2010)
Dietmar Berwanger, Lukasz Kaiser
Information Tracking in Games on Graphs. J. Log. Lang. Inf. 19 (4) (2010)
Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger
Alpaga: A Tool for Solving Parity Games with Imperfect Information. TACAS (2009)
Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger
Alpaga: A Tool for Solving Parity Games with Imperfect Information CoRR (2009)
Dietmar Berwanger, Sophie Pinchinat
Game Quantification Patterns. ICLA (2009)
Dietmar Berwanger, Laurent Doyen
On the Power of Imperfect Information. FSTTCS (2008)
Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje
Strategy Construction for Parity Games with Imperfect Information. CONCUR (2008)
Dietmar Berwanger
Infinite Coordination Games. LOFT (2008)
Dietmar Berwanger
Admissibility in Infinite Games. STACS (2007)
Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
The Variable Hierarchy of the µ-Calculus Is Strict. Theory Comput. Syst. 40 (4) (2007)
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
DAG-Width and Parity Games. STACS (2006)
Dietmar Berwanger, David Janin
Automata on Directed Graphs: Edge Versus Vertex Marking. ICGT (2006)
Dietmar Berwanger, Giacomo Lenzi
The Variable Hierarchy of the µ-Calculus Is Strict. STACS (2005)
Dietmar Berwanger, Erich Grädel
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. LPAR (2004)
Dietmar Berwanger, Erich Grädel
Fixed-Point Logics and Solitaire Games. Theory Comput. Syst. 37 (6) (2004)
Dietmar Berwanger
Game Logic is Strong Enough for Parity Games. Stud Logica 75 (2) (2003)
Dietmar Berwanger, Erich Grädel, Stephan Kreutzer
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. LPAR (2003)
Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
On the Variable Hierarchy of the Modal µ-Calculus. CSL (2002)
Dietmar Berwanger, Achim Blumensath
The Monadic Theory of Tree-like Structures. Automata, Logics, and Infinite Games (2001)
Dietmar Berwanger, Erich Grädel
Games and Model Checking for Guarded Logics. LPAR (2001)
Dietmar Berwanger, Achim Blumensath
Automata for Guarded Fixed Point Logics. Automata, Logics, and Infinite Games (2001)