The following pages link to Dietmar Berwanger (Q444378):
Displayed 33 items.
- The dag-width of directed graphs (Q444380) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- Game logic is strong enough for parity games (Q1425188) (← links)
- Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
- Fixed-point logics and solitaire games (Q1764420) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- The variable hierarchy of the \(\mu\)-calculus is strict (Q2643142) (← links)
- Observation and distinction: representing information in infinite games (Q2701064) (← links)
- (Q2911640) (← links)
- Solving Counter Parity Games (Q2912718) (← links)
- Games and Model Checking for Guarded Logics (Q2996154) (← links)
- (Q3165948) (← links)
- (Q3408141) (← links)
- Consensus Game Acceptors (Q3451093) (← links)
- Hierarchical Information Patterns and Distributed Strategy Synthesis (Q3460580) (← links)
- Strategy Construction for Parity Games with Imperfect Information (Q3541028) (← links)
- Automata on Directed Graphs: Edge Versus Vertex Marking (Q3541946) (← links)
- Infinite Coordination Games (Q3584867) (← links)
- Admissibility in Infinite Games (Q3590934) (← links)
- Game Quantification Patterns (Q3601804) (← links)
- (Q4411834) (← links)
- The Monadic Theory of Tree-like Structures (Q4412839) (← links)
- Automata for Guarded Fixed Point Logics (Q4412842) (← links)
- Consensus Game Acceptors and Iterated Transductions (Q4640036) (← links)
- (Q4994895) (← links)
- (Q5275376) (← links)
- DAG-Width and Parity Games (Q5449827) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705923) (← links)
- STACS 2005 (Q5710722) (← links)
- (Q5874322) (← links)