Follow
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
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
1652006
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
1042012
Entanglement–a measure for the complexity of directed graphs with applications to logic and games
D Berwanger, E Grädel
Logic for Programming, Artificial Intelligence, and Reasoning: 11th …, 2005
922005
On the power of imperfect information
D Berwanger, L Doyen
IARCS Annual Conference on Foundations of Software Technology and …, 2008
612008
Admissibility in infinite games
D Berwanger
STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007
602007
The variable hierarchy of the μ-calculus is strict
D Berwanger, E Gradel, G Lenzi
Theory of Computing Systems 40, 437-466, 2007
512007
Games and model checking for guarded logics
D Berwanger, E Grädel
Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 2001
452001
Game logic is strong enough for parity games
D Berwanger
Studia logica 75, 205-219, 2003
442003
Entanglement and the complexity of directed graphs
D Berwanger, E Grädel, Ł Kaiser, R Rabinovich
Theoretical Computer Science 463, 2-25, 2012
402012
Information tracking in games on graphs
D Berwanger, Ł Kaiser
Journal of Logic, Language and Information 19, 395-412, 2010
362010
A perfect-information construction for coordination in games
D Berwanger, L Kaiser, B Puchala
IARCS Annual Conference on Foundations of Software Technology and …, 2011
292011
Alpaga: A tool for solving parity games with imperfect information
D Berwanger, K Chatterjee, M De Wulf, L Doyen, TA Henzinger
Tools and Algorithms for the Construction and Analysis of Systems: 15th …, 2009
292009
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
CONCUR 2008-Concurrency Theory: 19th International Conference, CONCUR 2008 …, 2008
252008
On the Variable Hierarchy of the Modal µ-Calculus.
D Berwanger, E Grädel, G Lenzi
CSL 2, 352-366, 2002
252002
The monadic theory of tree-like structures
D Berwanger, A Blumensath
Automata Logics, and Infinite Games: A Guide to Current Research, 285-301, 2002
252002
Fixed-point logics and solitaire games
D Berwanger, E Grädel
Theory of Computing Systems 37 (6), 675-694, 2004
242004
The Variable Hierarchy of the μ-Calculus Is Strict
D Berwanger, G Lenzi
STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science …, 2005
212005
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
Automated Technology for Verification and Analysis: 13th International …, 2015
172015
The system can't perform the operation now. Try again later.
Articles 1–20