Harvard University - Advanced Algorithms (COMPSCI 224), Lecture 2

[Costas]

Fusion trees, word-level parallelism, most significant set bit in constant time.

https://www.youtube.com/watch?v=3_o0-zPRQqw