Succinct Data Structures

Why it was recommended

one of his many talks that left me with an incredibly lasting impression

Strong recommendationKirinDave · Original2018-05

What it covers

Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast. It is for someone who wants the derivation, proof, or implementation detail.

Video details

Channel

Edward Kmett

Length

1 hr 26 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