Bachelor Project Theoretical Computer Science

Please find below a preliminary schedule for the presentations of the bachelor projects of 2015-2016.

Presentations June 30, 2016, 10.00-12.30 in room M648

10.00-10.20 Luc Veldhuis: The iterative lexicographic path ordering in Haskell
10.20-10.40 Nicole Kappelhof: Min cost maximum matching
10.40-11.00 Hans-Dieter Hiep: Alternative connectives for classical propositional logic

11.30-11.50 Ramon Winder: Dijkstra's shared bathroom problem revisited
11.50-12.10 George Karlos: A fault-tolerant variant of Safra's termination detection algorithm

Presentations July 1, 2016, 10.00-11.20 in room M648

10.00-10.20 Floris Golbach: A parallel implementation of DFA minimization
10.20-10.40 Evangelos Chatzikalymnios: Comparison of Two Algorithms for Detecting Useless Transitions in Pushdown Automata
10.40-11.00 Mykyta Iefymov: Developing a music licensing web stock using machine learning methods
11.00-11.20 Jehat Esmailzadeh: String matching algorithms: imperative versus functional

Back to the homepage of theoretical computer science.
Last update June 30, 2016.