The seminar is devoted to the study of elegant, efficient, practial, interesting, classical and non-classical algorithms, including in particular algorithms with no apparent relationship to symbolic computation. The main emphasis will be put on algorithms that are typically not covered by introductory lectures or textbooks on algorithms, but which nevertheless are of general interest. Also little-known aspects of well-known algorithms are potential topics of the seminar. Only algorithms whose understanding requires a substantial amount of external background knowledge are excluded from consideration.
Algorithms from various areas will be discussed. For instance:
Typically, at each meeting there will be a self-contained presentation of some algorithm. Depending on the algorithm and on the interest of the audience, the focus of the discussion might be on complexity analysis, comparison to related algorithms, data structures, implementation details, or applications.
top| Course ID: | 326.087 |
| Organizers: | Manuel Kauers and Temur Kutsia |
| Time: | Thursday, 16.30 -- 18.00 (weekly) |
| Place: | RISC Seminar room, Hagenberg |
| Prerequesits: | Participants are expected to be familiar with fundamental algorithms as tought in introductory courses such as 326.011 by Carsten Schneider or 326.026 by Heinrich Rolletschek. |
| Date | Speaker | Title |
| 2006-10-05 | Manuel Kauers | Fast Median Search |
| 2006-10-12 | Temur Kutsia | Alternatives to Kruskal's Algorithm |
| 2006-10-19 | TBA | TBA |
| 2006-10-26 | TBA | TBA |