Succinct data structures, binary tries, rank, select, ordered rooted trees, balanced parentheses, related results
These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students before the scribe notes (which are more complete) become available. See the scribe notes page. Accessibility
[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]