verantwortlich : Karsten Schmidt Termin: Freitags, 11.00 - 13.00 Raum: RUD25 3.113
| 2.5. | kein Seminar | |
|---|---|---|
| 9.5. | Shortest Paths | Minimum Spanning Tree |
| 16.5. | Majority Voting | Depth First Search |
| 23.5. | Maximum True Square | String Matching |
| 30.5. | Saddleback Search | Largest Prefix |
| 6.6. | Convex Hull | Polynomial Multiplication |
| 13.6. | Line Segment Intersection | |
| 20.6. | Union/Find | Binary Trees |
| 27.6. | Closest Pair of Points | Radix Sort |
| 4.7. | Matrix Chain Multiplication | |
| 11.7. | ||