A Parallel Priority Queue with Constant Time Operations
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 49 (1) , 4-21
- https://doi.org/10.1006/jpdc.1998.1425
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Optimal and load balanced mapping of parallel priority queues in hypercubesIEEE Transactions on Parallel and Distributed Systems, 1996
- Sublinear-Time Parallel Algorithms for Matching and Related ProblemsJournal of Algorithms, 1993
- Parallel heap: An optimal parallel priority queueThe Journal of Supercomputing, 1992
- Optimal merging and sorting on the EREW PRAMInformation Processing Letters, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959