The Complexity of Finding Reset Words in Finite Automata. - Jörg Olschewski; Michael Ummels (MFCS, 2010)

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. - Patricia Bouyer; Nicolas Markey; Jörg Olschewski; Michael Ummels (ATVA, 2011)

Languages vs. ω-Languages in Regular Infinite Games. - Namit Chaturvedi; Jörg Olschewski; Wolfgang Thomas (Developments in Language Theory, 2011)

Improved Ramsey-Based Büchi Complementation. - Stefan Breuers; Christof Löding; Jörg Olschewski (FoSSaCS, 2012)

Languages versus ω-Languages in Regular Infinite Games. - Namit Chaturvedi; Jörg Olschewski; Wolfgang Thomas (Int. J. Found. Comput. Sci., 2012)

Languages and strategies: a study of regular infinite games. - Jörg Olschewski (2013)