Ranked #1
Session 12: Fusion Trees
Session 12: Fusion Trees
Fusion trees: sketching, parallel comparison, most significant set bit
28 Jun 2017
•
1hr 24mins
Ranked #2
Session 16: Strings
Session 16: Strings
Strings: suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document retrieval
28 Jun 2017
•
1hr 24mins
Similar Podcasts
Ranked #3
Session 14: Sorting in Linear Time
Session 14: Sorting in Linear Time
Integer: sorting in linear time for w = O(lg2+ε n), priority queues
28 Jun 2017
•
1hr 24mins
Ranked #4
Session 11: Integer Models
Session 11: Integer Models
Integer: models, predecessor problem, van Emde Boas, x-fast and y-fast trees, indirection
28 Jun 2017
•
1hr 21mins
Ranked #5
Session 13: Integer Lower Bounds
Session 13: Integer Lower Bounds
Integer data structure lower bounds. In particular, we'll prove that the min of van Emde Boas and fusion trees is an opt... Read more
28 Jun 2017
•
1hr 22mins
Ranked #6
Session 17: Succinct Structures I
Session 17: Succinct Structures I
Succinct: rank, select, tries
28 Jun 2017
•
1hr 20mins
Ranked #7
Session 10: Dictionaries
Session 10: Dictionaries
Dictionaries: universal, k-wise independent, simple tabulation hashing; chaining, dynamic perfect hashing, linear probin... Read more
28 Jun 2017
•
1hr 23mins
Ranked #8
Session 15: Static Trees
Session 15: Static Trees
Static trees: least common ancestor, range minimum queries, level ancestor
28 Jun 2017
•
1hr 23mins
Ranked #9
Session 9: Cache-Oblivious Structures II
Session 9: Cache-Oblivious Structures II
Memory hierarchy: distribution sweeping via lazy funnelsort; cache-oblivious orthogonal 2D range searching: batched and ... Read more
28 Jun 2017
•
1hr 24mins
Ranked #10
Session 8: Cache-Oblivious Structures I
Session 8: Cache-Oblivious Structures I
Memory hierarchy: ordered-file maintenance, list labeling, order queries, cache-oblivious priority queues
28 Jun 2017
•
1hr 27mins