Range-restricted mergeable priority queues (Q689640)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 446248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Range-restricted mergeable priority queues |
scientific article; zbMATH DE number 446248 |
Statements
Range-restricted mergeable priority queues (English)
0 references
15 November 1993
0 references
We define a new class of mergeable heaps that we call \(H\)-heaps. Using \(H\)-Heaps we can process an on-line sequence of mergeable priority queue operations when the elements are integers in the range \(1,\ldots,N\) in amortized time \(O(\log \log N)\) and worst-case time \(O(\log N)\) per operation.
0 references
heaps
0 references
priority queue
0 references
0.8260586261749268
0 references
0.82145094871521
0 references
0.8214508891105652
0 references
0.8190879225730896
0 references
0.7830398082733154
0 references
