8. Cache-Oblivious Structures I

[@aleksagordic9593]

4:07 - 18:45 ordered file maintenance DS setup (used with B trees in last lecture) 18:45 - 32:30 analysis of ordered file maintenance DS 32:30 - 40:55 list labeling (relaxed version of ordered file maintenance DS) 40:55 - 49:50 list order maintenance (used with full-persistant DSs in lecture 1) 49:50 - 1:14:20 cache-oblivious priority queue 1:14:20 - 1:27:15 analysis of insert/push on priority queue (delete op is analogous and in the notes)