01:07:30duration 1 hour 7 minutes
Apr 29: Predecessor searching on the ultra-wide…
Apr 29: Predecessor searching on the ultra-wide word RAM
From Jeff Erickson
01:10:11duration 1 hour 10 minutes
Apr 24: Fast integer sorting — Range…
Apr 24: Fast integer sorting — Range reduction, signature sort
01:05:19duration 1 hour 5 minutes
Apr 22: Fusion tree details
01:12:41duration 1 hour 12 minutes
Apr 17: y-fast tries and fusion trees
01:12:03duration 1 hour 12 minutes
Apr 15: van Emde Boas trees and x-fast tries
01:09:45duration 1 hour 9 minutes
Apr 10: Sorting with partial information
56:27duration 56 minutes 27 seconds
Apr 01: Power of d choices, always-go-left
01:11:52duration 1 hour 11 minutes
Mar 27: Cuckoo hashing
01:08:39duration 1 hour 8 minutes
Mar 12: More persistent data structures
01:07:47duration 1 hour 7 minutes
Mar 11: Persistent data structures
01:11:03duration 1 hour 11 minutes
Mar 06: Lower bounds for dynamic connectivity
01:10:29duration 1 hour 10 minutes
Mar 04: Dynamic connectivity
01:15:00duration 1 hour 15 minutes
Feb 20: Multiple-source shortest paths
01:14:11duration 1 hour 14 minutes
Feb 18: ST-trees
01:11:59duration 1 hour 11 minutes
Feb 13: Euler tour trees and ST-trees
01:10:59duration 1 hour 10 minutes
Feb 11: Tango/multisplay trees, geometry of…
Feb 11: Tango/multisplay trees, geometry of binary search trees
01:09:02duration 1 hour 9 minutes
Feb 06: Dynamic optimality, tango/multisplay trees
01:13:50duration 1 hour 13 minutes
Feb 04: Packed-memory arrays, splay trees
01:11:53duration 1 hour 11 minutes
Jan 30: Scapegoat trees
01:13:34duration 1 hour 13 minutes
Jan 28: Static-to-dynamic transformations
01:14:36duration 1 hour 14 minutes
Jan 23: Range minimum queries, continued
01:13:31duration 1 hour 13 minutes
Jan 21: Course overview, range minimum queries
Public, Restricted and Moderated