UNIVERSITY OF AARHUS BRICS INTERNATIONAL PHD SCHOOL Algorithms, Fall 1999 

Lecturers · Time and place · Course description · Schedule · Literature · Handouts · Homework · Takehome exam · Evalutation 
Week  Date  Topics 
44  October 25  Graph representations, BFS, DFS, Topological Sorting [Cormen et al., Chap. 23.123.4] 
October 27  Strongly connected components [Dijkstra, Chap. 25]  
45  November 2  Shortest path [Kozen, Lecture 5], Amortized analysis 
November 3  Binomial queues [Kozen, Lecture 8], Fibonacci heaps [Kozen, Lecture 9]  
46  November 9  Maximum flow [Goldberg; Kozen, Lecture 16] 
November 10  Maximum flow [Kozen, Lectures 17 and 18]  
47  November 16  Convex hull [Cormen et al., Chap. 35.1 and 35.3; Chan, Sections 12 and 45] 
November 17  Segment intersection [Cormen et al., Chap. 35.2], Suffix tree construction [Ukkonen]  
48  November 23  Suffix tree construction [Ukkonen]; String matching [Cormen et al., Chap. 34.1, 34.34] 
November 24  FKS hashing [Motwani and Raghavan, Chap. 8.5]  
49  November 30  Lower bounds, Decision trees, Algebraic decision trees [Baase, Chap. 2.4; Skyum] 
December 1  Algegraic decision trees [Skyum]; Dynamic programming [Cormen et al., Chap. 16]  
50  December 7  Quick sort, Randomized convex hull, Treaps [Motwani and Randomized, Chap. 9.19.2; Seidel and Aragon] 
December 8  Treaps, Paging algorithms [Seidel and Aragon; Albers, Chap. 12] 