Persistent Data Structures 
Persistent Data Structures
by MIT / Erik Demaine
Video Lecture 1 of 22
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
Not yet rated
Views: 1,934
Date Added: April 4, 2016

Lecture Description

"Persistence" - remembering all past versions of a data structure ("partial persistence"), being able to modify them - forking off new ones ("full persistence"), and merging different versions into one ("confluent persistence").

Course Index

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.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)