|
|
|
|
|
|
Outline of course |
|
|
|
Intro: I/O-model and fundamental bounds
Sorting and Searching: External sorting, B-trees |
[AV] sec 3+5
[Agis] sec 1, 2, 3.1-3.2, [AL] [Mehlhorn], [Ads] sec 2.0 |
|
|
Sorting and Searching: Buffer-trees, lower bounds | [Agis] sec 3.3, [Abuffer]
sec 1-4, [Alower]
[AV] (only stuff on sorting/permuting lower bound) |
|
|
Graph problems: List ranking, algorithms on trees. | [CGGTVV], sec 3-6, [Abuffer] sec 4.1 |
|
|
Graph problems: Depth-First and Breadth-First Search | [CGGTVV], sec 7, [BGVW], [MR] sec 5.1. 3.1 |
|
|
Graph problems: Minimal Spanning Tree,
Shortest paths (tournement tree) |
[ABT] sec 2. (note on vertex contraction later)
[KS] sec 3. |
|
|
Graph problems: Shortest paths, discussion of other results,
lower bounds (model discussion and SPN, CC, list ranking bounds) |
[KS] sec 5.2, [T], (review
of [ABW])
[CGGTVV] sec. 2, [Aobbd] sec 2.3-lemma 2 (review of [MR] sec 2-4, [AKL] sec 1-4]) |
|
|
Graph problems: Graph blocking
Batched geometric problems: Distribution sweeping, external segment trees, batched filtering |
[NGV]
[Agis] sec 4.1-4.2. [GTVV] sec 2 |
|
|
Batched geometric problems: External extended segment trees
and fractional cascading |
[AVV] sec 1-2, [Agis] 4.3.1-4.3.2 |
|
|
|
|
|
|
Batched geometric problems: Overview of results (line segment
intersection, convex hull, randomized algorithms), lower bounds Geometric searching problems: Weight-balanced and persistent B-trees |
([Agis] sec 4.3.3-4.4, [AVV]
sec 3,
[CGGTVV], [CFMMR]sec 6, [AM] sec 1) [Ads] sec 2.1, [AVi] sec 3.1, [BGOSW], ([VV]) |
|
|
Geometric searching problems: External interval tree, logarithmic
method, dynamic point location |
[Ads] sec 3-4, [AVi],
[AABV] sec 1-2, [AVa] sec 1-3 |
|
|
|
|
|
|
Geometric searching problems: External priority search
tree,
external range tree, kd-B trees |
[Ads] sec 5-6, [ASV] sec 1+3-4,[AAPV] |
|
|
Geometric searching problems: O-tree, overview of other
worst-case and heuristic results |
[KS] sec 4, [Ads] sec 7-9, [NW] |