Succinct Data Structures
What it is
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 queries. It ties together the research and walks through his Haskell succinct library.
Why Hacker News recommends it
Commenters credit it as the place they first learned about succinct data structures, and found it left a lasting impression.
- 1 people recommended it
- 1 different months
- 1 strong recommendations
- first 2017, last 2025
What HN commenters said
“one of his many talks that left me with an incredibly lasting impression”
Kmett's talk stitching together succinct structures research left a lasting impression.
KirinDave, 2018-05 · Strong recommendation · in “Algorithms Behind Modern Storage Systems”
Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.
Topics: succinct data structures, haskell, compressed indexes, bitvectors, algorithms
Also recommended by the same people
talkCppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”CppCon · 9 HN recommenders · 2018–2026
explainerThe Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?Reducible · 7 HN recommenders · 2021–2026
talkModern Dictionaries by Raymond HettingerSF Python · 9 HN recommenders · 2016–2025
talkCppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"CppCon · 7 HN recommenders · 2014–2024
talkCppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”CppCon · 5 HN recommenders · 2017–2025
talkSorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019CppCon · 7 HN recommenders · 2019–2024
explainerThe Fastest Way to Board a Plane Feels Like the SlowestCGP Grey · 9 HN recommenders · 2020–2023
explainer30 Weird Chess Algorithms: Elo Worldsuckerpinch · 8 HN recommenders · 2019–2026