An optimal parallel algorithm to construct a deap

DOI10.1080/00207169208804050zbMath0742.68015OpenAlexW1987437971MaRDI QIDQ3989753

Stephan Olariu, Zhaofang Wen

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804050

zbMATH Keywords

optimal algorithmsheapEREW-PRAMCRCW-PRAMdeapdouble-ended priority queue

Mathematics Subject Classification ID

Related Items (1)

Optimal parallel construction of heaps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimally efficient selection algorithm
• A note on the construction of the data structure ``deap
• Faster optimal parallel prefix sums and list ranking
• Priority queue administration by sublist index
• Dynamic parallel memories
• Min-max heaps and generalized priority queues
• On the Expected Performance of Scanning Disks

This page was built for publication: An optimal parallel algorithm to construct a deap