Selected Algorithms (Seminar)

Description - Course Details - Schedule

Note: Because of administrational reasons, it was necessary to shift this seminar to summer semester 2009. We apologize for the inconvenience.


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.


Course Details

Course ID: 326.087
If you are JKU student, please register to this course via KUSSS.
Organizers: Manuel Kauers and Temur Kutsia
Time: Thursday, 16.15 -- 17.45 (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.


Schedule (Winter 2008/09)

Date Speaker Title
2008-10-09 Temur Kutsia TBA
2008-10-16 TBA TBA
2008-10-23 TBA TBA
2008-10-30 TBA TBA
2008-11-06 TBA TBA
2008-11-13 TBA TBA
2008-11-20 TBA TBA
2008-11-27 TBA TBA
2008-12-04 TBA TBA
2008-12-11 TBA TBA
2008-12-18 TBA TBA
2009-01-08 TBA TBA
2009-01-15 TBA TBA
2009-01-22 TBA TBA
2009-01-29 TBA TBA