|
Volumn 1, Issue , 1996, Pages 255-262
|
Parallel and distributed meldable priority queues based on binomial heaps
|
Author keywords
[No Author keywords available]
|
Indexed keywords
DATA STRUCTURES;
QUEUEING THEORY;
BINARY INTEGERS;
HEAP DATA STRUCTURES;
HYPERCUBE MODEL;
LOGARITHMIC TIME;
OPTIMAL ALGORITHM;
PARALLEL RANDOM ACCESS MACHINES;
PRIORITY QUEUES;
UNION OPERATIONS;
TREES (MATHEMATICS);
|
EID: 84947990476
PISSN: 01903918
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICPP.1996.537167 Document Type: Conference Paper |
Times cited : (8)
|
References (10)
|