Sign inSign in

Cache-oblivious priority queue

A priority queue data structure that adapts to block and memory sizes without knowing them in advance, achieving sub-constant amortized time per operation.
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.

Lecturers

1
  • Erik Demaine

    MIT · Undergraduate

    • 1:00:09Cache-Oblivious Algorithms: Searching & Sorting

Connections

6

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

Concepts4

Lectures2

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.