Dietmar Berwanger
Dietmar Berwanger
CNRS, Université Paris-Saclay, France
Verified email at lsv.fr - Homepage
Title
Cited by
Cited by
Year
DAG-width and parity games
D Berwanger, A Dawar, P Hunter, S Kreutzer
Annual Symposium on Theoretical Aspects of Computer Science, 524-536, 2006
1552006
Entanglement–a measure for the complexity of directed graphs with applications to logic and games
D Berwanger, E Grädel
International Conference on Logic for Programming Artificial Intelligence …, 2005
922005
The dag-width of directed graphs
D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek
Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012
902012
On the power of imperfect information
D Berwanger, L Doyen
IARCS Annual Conference on Foundations of Software Technology and …, 2008
562008
The variable hierarchy of the μ-calculus is strict
D Berwanger, E Gradel, G Lenzi
Theory of Computing Systems 40 (4), 437-466, 2007
502007
Admissibility in infinite games
D Berwanger
Annual Symposium on Theoretical Aspects of Computer Science, 188-199, 2007
502007
Entanglement and the complexity of directed graphs
D Berwanger, E Grädel, Ł Kaiser, R Rabinovich
Theoretical Computer Science 463, 2-25, 2012
402012
Game logic is strong enough for parity games
D Berwanger
Studia logica 75 (2), 205-219, 2003
402003
Games and model checking for guarded logics
D Berwanger, E Grädel
International Conference on Logic for Programming Artificial Intelligence …, 2001
392001
Information tracking in games on graphs
D Berwanger, Ł Kaiser
Journal of Logic, Language and Information 19 (4), 395-412, 2010
342010
Alpaga: A tool for solving parity games with imperfect information
D Berwanger, K Chatterjee, M De Wulf, L Doyen, TA Henzinger
International Conference on Tools and Algorithms for the Construction and …, 2009
282009
Strategy construction for parity games with imperfect information
D Berwanger, K Chatterjee, M De Wulf, L Doyen, TA Henzinger
Information and computation 208 (10), 1206-1220, 2010
272010
Strategy construction for parity games with imperfect information
D Berwanger, K Chatterjee, L Doyen, TA Henzinger, S Raje
International Conference on Concurrency Theory, 325-339, 2008
232008
Fixed-point logics and solitaire games
D Berwanger, E Grädel
Theory of Computing Systems 37 (6), 675-694, 2004
232004
On the variable hierarchy of the modal μ-calculus
D Berwanger, E Grädel, G Lenzi
International Workshop on Computer Science Logic, 352-366, 2002
232002
The monadic theory of tree-like structures
D Berwanger, A Blumensath
Automata logics, and infinite games, 285-301, 2002
232002
A perfect-information construction for coordination in games
D Berwanger, L Kaiser, B Puchala
IARCS Annual Conference on Foundations of Software Technology and …, 2011
222011
The variable hierarchy of the μ-calculus is strict
D Berwanger, G Lenzi
Annual Symposium on Theoretical Aspects of Computer Science, 97-109, 2005
222005
Once upon a Time in the West. Determinacy, Complexity and Definability of Path Games
D Berwanger, E Grädel, S Kreutzer
Logic for Programming, Artificial Intelligence, and Reasoning 2850, 229-243, 2003
18*2003
Hierarchical information patterns and distributed strategy synthesis
D Berwanger, AB Mathew, M Van den Bogaard
International Symposium on Automated Technology for Verification and …, 2015
172015
The system can't perform the operation now. Try again later.
Articles 1–20