Talks on Generic Topics

In these talks the students present papers on a variety of topics.Back to Start page

Title	Authors	Reference Papers
Faster and dynamic algorithms for maximal end-components decomposition and related graph problems in probabilistic verification	K. Chatterjee and M. Henzinger	paper
Fixed points vs. infinite generation	D. Niwiński	paper
Hacking nondeterminism with induction and coinduction	F. Bonchi and D. Pous	paper
First-order definable languages	V. Diekert and P. Gastin	paper
Infinite games played on finite graphs	R. McNaughton	paper
A deterministic subexponential algorithm for solving parity games	M. Jurdziński, M. Paterson, and U. Zwich	paper
The equivalence problem for regular expressions with squaring requires exponential space	A.R. Meyer and L.J. Stockmeyer	paper
Safra's determinization construction	K. Kumar	paper