17. Succinct Structures I

Why it was recommended

Erik Demaine [1] gave two good lectures on succinct data structures [2] in the 2012 MIT 6.851 Advanced Data Structures course

Recommendationespeed · Original2018-10

What it covers

Erik Demaine's MIT 6.851 Advanced Data Structures lecture introducing succinct data structures, covering rank, select and tries. It is part of the Spring 2012 course. It is for someone who wants the derivation, proof, or implementation detail.

Video details

Channel

MIT OpenCourseWare

Length

1 hr 20 min

Year

2013

More in this topic

• CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
• The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
• Modern Dictionaries by Raymond Hettinger
• CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
• CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
• Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019