Data structureadvanced
Lock-free priority queue
Also called Sundell-Tsigas priority queue, skip-list priority queue.
Concurrent priority queue where delete-min is performed by logically marking the first node of a skip list.
Concurrent priority queue where delete-min is performed by logically marking the first node of a skip list.
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 F7GS7Y Edit this page History Report an error