#persistentdatastructures#mit6.851#pointermachine
6.5M subscribers • 36 videos on Hallway • University channel
Advanced. Deep dive for people who know the field.
399K views12 years ago2 recommendations
Computer scienceData structuresAlgorithms
Erik Demaine introduces persistent data structures, explaining partial, full, and confluent persistence in this MIT lecture.
MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: ocw.mit.edu/6-851S12 Instructor: Erik Demaine "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"). License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.eduWhat people say. Recommended as part of an excellent advanced data structures lecture series.
u/philly_fan_in_chiin r/compsci • Recommends
On “Maximize Performance with this One Weird Trick or: Cache-Oblivious Data Structures”
Coding Interview Universitycurated list on GitHubRecommends
Under “Video Series”
u/philly_fan_in_chiin r/compsci • Recommends
On “If AVL/Red-black trees are O(log n) for all operations then are they used in pretty much everything?”