Helmut Lescow

Modular construction of strategies winning infinite games

Helmut Lescow, 1997 .

On Polynomial-Size Programs Winning Finite-State Games

Helmut Lescow, Helmut Lescow, 1995, CAV.

Logical Specifications of Infinite Computations

Wolfgang Thomas, Helmut Lescow, W. Thomas, 1993, REX School/Symposium.

Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions

Helmut Lescow, Jens Vöge, Nils Buhrke, 1996, TACAS.

Minimal Separating Sets for Acceptance Conditions in Muller Automata

Helmut Lescow, Jens Vöge, 2000, Theor. Comput. Sci..

Minimal Separating Sets for Muller Automata

Helmut Lescow, Jens Vöge, 1997, Workshop on Implementing Automata.