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

Persistent Data Structures

1:23:43
2

Retroactive Data Structures

1:18:39
3

Geometric Structures I

1:19:35
4

Geometric Structures II

1:22:09
5

Dynamic Optimality I

1:22:44
6

Dynamic Optimality II

1:23:31
7

Memory Hierarchy Models

1:22:54
8

Cache-Oblivious Structures I

1:27:21
9

Cache-Oblivious Structures II

1:24:38
10

Dictionaries

1:23:28
11

Integer Models

1:21:15
12

Fusion Trees

1:24:09
13

Integer Lower Bounds

1:22:10
14

Sorting in Linear Time

1:24:03
15

Static Trees

1:23:00
16

Strings

1:24:30
17

Succinct Structures I

1:20:11
18

Succinct Structures II

1:24:05
19

Dynamic Graphs I

1:14:44
20

Dynamic Graphs II

1:24:47
21

Dynamic Connectivity Lower Bound

1:22:18
22

History of Memory Models

59:24

History of Memory Models

Erik DemaineMacArthur FellowMIT

Professor

59:24·2013·graduate level

The session provides a historical overview of memory models, tracing their evolution from idealized 2-level models and the red-blue pebble game to external memory, HMM, BT, (U)MH, and cache-oblivious models.

Systems & CSTheory & AlgosComputer ArchitectureAlgorithms & Data StructuresBehavioral & Evolutionary BiologyMemory Hierarchy

MIT 6.851 Advanced Data Structures, Spring 2012

History of memory models: idealized 2-level, red-blue pebble game, external memory, HMM, BT, (U)MH, cache oblivious

Source: MIT OpenCourseWare via YouTubeWatch on YouTube
LecturerAll lecturers →
Erik DemaineMacArthur Fellow

MacArthur Genius Fellow & Professor of Computer Science, MIT

MIT Professor of Computer Science and MacArthur Fellow renowned for algorithmic data structures, computational origami, and hardness proofs.

3 courses · 62 lecturesCanon
Previous · Lecture 21

Dynamic Connectivity Lower Bound

Comments

Add a comment...Sign in