|
|
|
| Informatik Abt. I | Proseminar Programming Pearls - Themen |
| Datum | Name | Thema | Betreuer | |
| 1 | 02.05.01 | Andre Kettschau | Cracking the Oyster AHA! Algorithms | Ebbers-Baumann |
| 2 | 09.05.01 | Patrick Cornelißen | Data Structures Programs (Folien, 1.4 MB) | Ebbers-Baumann |
| 3 | 16.05.01 | Yvonne Christ | Writing correct Programs A small matter of programming | Landgraf |
| 4 | 23.05.01 | Sascha Ternes | Perspective on Performace The Back of the Envelope | Langetepe |
| 5 | 30.05.01 | Andreas Lenerz | Algorithm Design Techniques | Klein |
| 6 | 13.06.01 | Christian Küster | Sorting (Folien) Vergleich der Laufzeiten von Quicksort, Worst-Case festem Quicksort und Mergesort | Kamphans |
| 7 | 20.06.01 | Doris Kiefer | A Sample Problem Searching | Langetepe |
| 8 | 27.06.01 | Dagmar de Haan | Heaps (als ZIP) | Landgraf |
| 9 | 04.07.01 | Imre Oßwald | ??? | Kamphans |
| 10 | 11.07.01 | Michael Wingender | Strings of Pearls (als ZIP) | Kamphans |
© Universität Bonn, Informatik Abt. I - Thomas Kamphans - Letzte Änderung: Thu Aug 2 11:08:43 2001, generated by TOVL