Dietmar Berwanger

According to our database, Dietmar Berwanger authored at least 38 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Observation and Distinction: Representing Information in Infinite Games.

Dietmar Berwanger, Laurent Doyen

Theory Comput. Syst., February, 2023

Synthesising Full-Information Protocols.

Dietmar Berwanger, Laurent Doyen, Thomas Soullard

CoRR, 2023

2018

Consensus Game Acceptors and Iterated Transductions.

Dietmar Berwanger, Marie van den Bogaard

Int. J. Found. Comput. Sci., 2018

Hierarchical information and the synthesis of distributed strategies.

Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard

Acta Informatica, 2018

2017

Infinite games with finite knowledge gaps.

Dietmar Berwanger, Anup Basil Mathew

Inf. Comput., 2017

Deviator Detection under Imperfect Monitoring.

Dietmar Berwanger, R. Ramanujam

CoRR, 2017

2016

A Retraction Theorem for Distributed Synthesis.

Dietmar Berwanger, Anup Basil Mathew, R. Ramanujam

CoRR, 2016

2015

A Characterisation of Context-Sensitive Languages by Consensus Games.

Dietmar Berwanger, Marie van den Bogaard

CoRR, 2015

Games with Delays - A Frankenstein Approach.

Dietmar Berwanger, Marie van den Bogaard

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Consensus Game Acceptors.

Dietmar Berwanger, Marie van den Bogaard

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Hierarchical Information Patterns and Distributed Strategy Synthesis.

Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard

Proceedings of the Automated Technology for Verification and Analysis, 2015

2014

Games with recurring certainty.

Dietmar Berwanger, Anup Basil Mathew

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

2013

Introduction.

Dietmar Berwanger, Olivier Serre

Tech. Sci. Informatiques, 2013

2012

Entanglement and the complexity of directed graphs.

Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich

Theor. Comput. Sci., 2012

The dag-width of directed graphs.

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek

J. Comb. Theory B, 2012

Parity games on undirected graphs.

Dietmar Berwanger, Olivier Serre

Inf. Process. Lett., 2012

Solving Counter Parity Games.

Dietmar Berwanger, Lukasz Kaiser, Simon Leßenich

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

A Perfect-Information Construction for Coordination in Games.

Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Information Tracking in Games on Graphs.

Dietmar Berwanger, Lukasz Kaiser

J. Log. Lang. Inf., 2010

Strategy construction for parity games with imperfect information.

Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger

Inf. Comput., 2010

2009

Alpaga: A Tool for Solving Parity Games with Imperfect Information.

Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

Game Quantification Patterns.

Dietmar Berwanger, Sophie Pinchinat

Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

2008

Infinite Coordination Games.

Dietmar Berwanger

Proceedings of the Logic and the Foundations of Game and Decision Theory, 2008

On the Power of Imperfect Information.

Dietmar Berwanger, Laurent Doyen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Strategy Construction for Parity Games with Imperfect Information.

Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007

The Variable Hierarchy of the µ-Calculus Is Strict.

Dietmar Berwanger, Erich Grädel, Giacomo Lenzi

Theory Comput. Syst., 2007

Admissibility in Infinite Games.

Dietmar Berwanger

Proceedings of the STACS 2007, 2007

2006

DAG-Width and Parity Games.

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer

Proceedings of the STACS 2006, 2006

Automata on Directed Graphs: Edge Versus Vertex Marking.

Dietmar Berwanger, David Janin

Proceedings of the Graph Transformations, Third International Conference, 2006

2005

The Variable Hierarchy of the µ-Calculus Is Strict.

Dietmar Berwanger, Giacomo Lenzi

Proceedings of the STACS 2005, 2005

2004

Fixed-Point Logics and Solitaire Games.

Dietmar Berwanger, Erich Grädel

Theory Comput. Syst., 2004

Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.

Dietmar Berwanger, Erich Grädel

Proceedings of the Logic for Programming, 2004

2003

Game Logic is Strong Enough for Parity Games.

Dietmar Berwanger

Stud Logica, 2003

Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games.

Dietmar Berwanger, Erich Grädel, Stephan Kreutzer

Proceedings of the Logic for Programming, 2003

2002

On the Variable Hierarchy of the Modal µ-Calculus.

Dietmar Berwanger, Erich Grädel, Giacomo Lenzi

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Games and Model Checking for Guarded Logics.

Dietmar Berwanger, Erich Grädel

Proceedings of the Logic for Programming, 2001

Automata for Guarded Fixed Point Logics.

Dietmar Berwanger, Achim Blumensath

Proceedings of the Automata, 2001

The Monadic Theory of Tree-like Structures.

Dietmar Berwanger, Achim Blumensath

Proceedings of the Automata, 2001