Sign inSign in

Fusion trees

A static integer data structure that achieves O(log⁡wn)O(\log_w n) time for predecessor and successor queries using word-level parallelism.
as Erik Demaine defines itMITThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Undergraduate

    • 1:12:18Integer Lower Bounds
    • 40:01Topics in Algorithms Research

Connections

7

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures3

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.