Publications of Jörg Olschewski
All Publications
| [BLO12] |
Stefan Breuers, Christof Löding, and Jörg Olschewski.
Improved Ramsey-based Büchi complementation.
In FoSSaCS 2012, volume 7213 of Lecture Notes in Computer
Science, pages 150-164. Springer, 2012.
(c) Springer. [ Abstract ] |
| [COT12] |
N. Chaturvedi, J. Olschewski, and W. Thomas.
Languages vs. omega-languages in regular infinite games.
International Journal of Foundations of Computer Science,
23(05):985-1000, August 2012.
Journal version of [COT11]. (c) 2012
World Scientific Publishing Company. [ pdf | http | Abstract ] |
| [BMOU11] |
Patricia Bouyer, Nicolas Markey, Jörg Olschewski, and Michael Ummels.
Measuring permissiveness in parity games: Mean-payoff parity
games revisited.
In Automated Technology for Verification and Analysis, volume
6996 of Lecture Notes in Computer Science, pages 135-149. Springer,
2011.
(c) Springer. [ Abstract ] |
| [COT11] |
N. Chaturvedi, J. Olschewski, and W. Thomas.
Languages vs. omega-languages in regular infinite games.
In Giancarlo Mauri and Alberto Leporati, editors, Proceedings of
the 15th International Conference on Developments in Language Theory, DLT
2011, volume 6795 of Lecture Notes in Computer Science, pages
180-191. Springer, 2011. [ pdf | http | Abstract ] |
| [OU10] |
Jörg Olschewski and Michael Ummels.
The complexity of finding reset words in finite automata.
In Mathematical Foundations of Computer Science 2010, volume
6281 of Lecture Notes in Computer Science, pages 568-579. Springer,
2010.
(c) Springer. [ pdf | Abstract ] |