Constructing Priority Queues and Deques Optimally in Parallel
Jingsen Chen · World Computer Congress on Algorithms, Software, Architecture · 1992
The author investigates the parallel complexity of constructing data structures that implement priority queues (viz. the heap) and double-ended priority queues (namely, the twin-heap, the min-max h ...