An efficient algorithm for concurrent priority queue heaps (Q1350117): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3683547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Concurrent access of priority queues / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00148-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099292526 / rank | |||
Normal rank | |||
Latest revision as of 11:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for concurrent priority queue heaps |
scientific article |
Statements
An efficient algorithm for concurrent priority queue heaps (English)
0 references
27 February 1997
0 references
Concurrency
0 references
Data structures
0 references
Priority queue
0 references
Heap
0 references
Bit-reversal
0 references
Synchronization
0 references
