17. Succinct Structures I

preview_player
Показать описание
MIT 6.851 Advanced Data Structures, Spring 2012
Instructor: Erik Demaine

Succinct: rank, select, tries

License: Creative Commons BY-NC-SA
Рекомендации по теме
Комментарии
Автор

Really well explained, detailed and so comprehensible. Algorithms scientific papers should learn more from this. Although I get this was a lecture and can be done slightly differently :)

mazzespazze
Автор

2 minutes in and I already like it. Plus that is some quality chalk & blackboard.

JazzInATinCan
Автор

What are some examples of a "Compact" data structure?

denvaar
Автор

I wonder if it would be possible to store object as a value in such succinct trie node?

chimiwangmo