Conceptadvanced
Relaxed priority queue
Also called relaxed concurrent priority queue.
Priority queue whose delete-min may return an element close to the minimum, trading order for scalability.
Priority queue whose delete-min may return an element close to the minimum, trading order for scalability.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag V0W0KM Edit this page History Report an error