Skip to content
lectern.tv
MIT 6.851: Advanced Data Structures →0/22
1

1. Persistent Data Structures

1:23:43
2

2. Retroactive Data Structures

1:18:39
3

3. Geometric Structures I

1:19:35
4

4. Geometric Structures II

1:22:09
5

5. Dynamic Optimality I

1:22:44
6

6. Dynamic Optimality II

1:23:31
7

7. Memory Hierarchy Models

1:22:54
8

8. Cache-Oblivious Structures I

1:27:21
9

Lecture 9: Cache-Oblivious Structures II (6.851)

1:24:38
10

Lecture 10: Dictionaries (6.851)

1:23:28
11

Lecture 11: Integer Models (6.851)

1:21:15
12

Lecture 12: Fusion Trees (6.851)

1:24:09
13

Lecture 13: Integer Lower Bounds (6.851)

1:22:10
14

Lecture 14: Sorting in Linear Time (6.851)

1:24:03
15

Lecture 15: Static Trees (6.851)

1:23:00
16

Lecture 16: Strings (6.851)

1:24:30
17

Lecture 17: Succinct Structures I (6.851)

1:20:11
18

Lecture 18: Succinct Structures II (6.851)

1:24:05
19

Lecture 19: Dynamic Graphs I (6.851)

1:14:44
20

Lecture 20: Dynamic Graphs II (6.851)

1:24:47
21

Lecture 21: Dynamic Connectivity Lower Bound (6.851)

1:22:18
22

Lecture 22: History of Memory Models (6.851)

59:24

4. Geometric Structures II

Erik DemaineMIT

Professor of Computer Science and Engineering

1:22:09·2013·graduate level

This lecture explores advanced geometric data structures, specifically covering fractional cascading for optimal 3D orthogonal range searching and introducing kinetic data structures such as kinetic predecessor structures and priority queues for managing moving points.

Theory & AlgosAlgorithms & Data StructuresComputational GeometryKinetic Data StructuresRange Searching

MIT 6.851 Advanced Data Structures, Spring 2012

View the complete course: http://ocw.mit.edu/6-851S12

Instructor: Erik Demaine

Previous · Lecture 3

3. Geometric Structures I

Next · Lecture 5

5. Dynamic Optimality I

Seminar notes & discussion

Sign in to comment

No public seminar notes on this lecture yet.