Proseminar Theoretische Informatik
Sommersemester 2011
Vortragstermine
| Datum | Vortragende(r) | Thema | ||
|---|---|---|---|---|
| 1 | 19.04.2011 | Astrid Frey | Longest common subsequence | |
| wird nachgeholt | ||||
| 3 | 03.05.2011 | Eric Hertwig | An activity-selection problem | |
| 4 | 10.05.2011 | Friedrich Malek | Compatison networks / The zero-one principle | |
| 5 | 17.05.2011 | Maksat Kadyrakunov | Knuth-Morris-Pratt Algorithmus | |
| 6 | 24.05.2011 | Anawin Chaloemseema | A bitonic sorting network | |
| 7 | 31.05.2011 | Mike Fährmann | A merging network / A sorting network | |
| 8 | 07.06.2011 | Vera Obländer | Datenkompression | |
| 9 | 14.06.2011 | Christopher Reichelt | Addition circuits | |
| 10 | 21.06.2011 | Felix Bytow | Huffman Codes | |
| 11 | 28.06.2011 | Peter Küffner | Greatest common divisor | |
| 12 | 05.07.2011 | Hang Meng | Editierdistanz |