Selected Algorithms (Seminar)

Description - Course Details - Schedule


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 2007/08)

Date Speaker Title
2007-10-11 Manuel Kauers Knuth-Morris-Pratt
2007-10-18 Temur Kutsia Tree Matching
2007-10-25 Christoph Koutschan MP3
2007-11-08 Manuel Kauers What is the Maximum?
2007-11-15 Veronika Pillwein Hashing
2007-11-22 Temur Kutsia B-Trees
2007-11-29 Alex Zapletal Stable Marriage
2007-12-06 Johannes Middeke Alpha-Beta Pruning
2007-12-13 Reka Nagy Christofides Algorithm
2008-01-10 Madalina Erascu Garbage Collection
2008-01-17 Christian Aistleitner How to slay dragons with bare hands
2008-01-24 cancelled
2008-01-31 cancelled