====== Talks on Generic Topics ======
In these talks the students present papers on a variety of topics.[[start|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|{{:Papers:faster_mecs.pdf|paper}}|
|Fixed points vs. infinite generation|D. Niwiński|{{:Papers:niwinski88.pdf|paper}}|
|Hacking nondeterminism with induction and coinduction|F. Bonchi and D. Pous|{{:Papers:p87-bonchi.pdf|paper}}|
|First-order definable languages|V. Diekert and P. Gastin|{{:papers:gastin-fo-definable.pdf|paper}}|
|Infinite games played on finite graphs|R. McNaughton|{{:Papers:game-mcnaughton.pdf|paper}}|
|A deterministic subexponential algorithm for solving parity games|M. Jurdziński, M. Paterson, and U. Zwich|{{:Papers:JPZ-subexpo-parity.pdf|paper}}|
|The equivalence problem for regular expressions with squaring requires exponential space|A.R. Meyer and L.J. Stockmeyer|{{:Papers:nba-equivalence.pdf|paper}}|
|Safra's determinization construction|K. Kumar|{{:Papers:safra-determinisation-lecture11.pdf|paper}}|