UNIVERSITY OF AARHUS BRICS INTERNATIONAL PHD SCHOOL Algorithms, Fall 1998 

Lecturer · Time and place · Course description · Schedule · Literature · Handouts · Homework · Takehome exam · Evalutation 
Week  Date  Topics 
44  October 28  [Cormen et al., Chap. 23], [Dijkstra, Chap. 25]: BFS, DFS, Topological Sorting, Strongly Connected Components 
October 30  [Kozen, Lectures 5.1, 89]: Dijkstra's SingleSource Shortest Paths Algorithm, Binomial Heaps, Amortized analysis  
45  November 4  [Kozen, Lectures 9, 16]: Fibonacci Heaps, Max Flow 
November 6  [Kozen, Lectures 1718]: Max Flow  
46  November 11  [Cormen et al., Chap. 35] Computational Geometry: SegmentIntersection, Convex Hull 
November 13  [Chan] Convex Hull  
47  November 18  [Cheng and Janardan] Dynamic Planar Point Location 
November 20  [Cormen et al., Chap. 34.1,34] String Matching  
48  November 25  [Motwani and Raghavan, Chap. 9.2, 8.2.] Randomized Convex Hull, Backwards Analysis, Random Treaps 
November 27  [Motwani and Raghavan, Chap. 8.3, 8.4.12] Skip Lists, Hash Tables  
49  December 2  [Motwani and Raghavan, Chap. 8.4.3] Hash Tables, [Kozen, Lecture 36] Randomized Maximal Independent Sets in Parallel 
December 4  [Kozen, Lectures 37,38] Randomized Maximal Independent Sets in Parallel, Miller's Primality Test  
50  December 9  [Kozen, Lectures 39] Miller's Primality Test 
December 11  [Albers, Chapter 1] Paging Algorithms 