Searching...
- Home
- Video Lectures
- About The Professor
Course
| Subject: | Computer Science |
| Views: | 29,264 |
Instructor
Name
Erik Demaine
Copyright Information: Erik Demaine. 6.851 Advanced Data Structures, Spring 2012. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu (Accessed 4 Apr, 2016). License: Creative Commons BY-NC-SA
Lecture Description
Dictionaries: universal, k-wise independent, simple tabulation hashing; chaining, dynamic perfect hashing, linear probing, cuckoo hashing
Course Index
- Persistent Data Structures
- Retroactive Data Structures
- Geometric Structures I
- Geometric Structures II
- Dynamic Optimality I
- Dynamic Optimality II
- Memory Hierarchy Models
- Cache-Oblivious Structures I
- Cache-Oblivious Structures II
- Dictionaries
- Integer Models
- Fusion Trees
- Integer Lower Bounds
- Sorting in Linear Time
- Static Trees
- Strings
- Succinct Structures I
- Succinct Structures II
- Dynamic Graphs I
- Dynamic Graphs II
- Dynamic Connectivity Lower Bound
- History of Memory Models
Course Description
Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms.
For a list of major results and current directions of research in data structures covered by this course, please see the syllabus.
Comments
There are no comments.
Be the first to post one.
Posting Comment...
