Parallel priority queues based on binomial heaps (Q1583321)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel priority queues based on binomial heaps |
scientific article; zbMATH DE number 1521783
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel priority queues based on binomial heaps |
scientific article; zbMATH DE number 1521783 |
Statements
Parallel priority queues based on binomial heaps (English)
0 references
26 October 2000
0 references
binomial heaps
0 references
carry adder
0 references
insert and delete operations
0 references
meldable priority queues
0 references
parallel data structures
0 references
time complexity
0 references
