UNIVERSITY OF AARHUS
BRICS INTERNATIONAL PHD SCHOOL

Algorithms, Spring 2001 (Study group)

Lecturer · Time and place · Course description · Literature · Handouts · Homework
Algorithms Fall 1999, 1998

Lecturer

Gerth Stølting Brodal.

Time and place

Wednesdays 14.15-16.00 in B4.18.

Course description

The course is a graduate-level introduction to the design and analysis of algorithms. The aim of the course will be to explain basic methodological aspects such as amortized analysis of data structures, probabilistic analysis of algorithms or competitive analysis. To illustrate these, specific examples from important application areas - e.g. graph algorithms, string matching, or algebraic algorithms - will be discussed. Note: The syllabus given above is a bit ambitious; chances are that only a subset will be covered. The order given is not the one which will be followed. Furthermore, the content is subject to change according to contingencies.

Literature

Handouts

  1. [Cormen et al., Chap. 23]
  2. [Kozen, Lectures 5, 8-9]
  3. [Kozen, Lectures 16-18]
  4. [Goldberg]
  5. [Cormen et al., Chap. 35]
  6. [Chan]
  7. [Ukkonen]
  8. [Cormen et al., Chap. 34]
  9. [Motwani and Raghavan, Chap. 8-9.2]
  10. [Baase, Chap. 2.4]
  11. [Skyum]
  12. [Cormen et al., Chap. 16]
  13. [Kozen, Lectures 36-37]
  14. [Kozen, Lectures 38-39]
  15. [Albers]
  16. Literature Notes on Homeworks (references.tex)

Homework


Page maintained by Gerth Stølting Brodal <gerth@cs.au.dk>.