Merging heaps in parallel

References

• Baase , S. 1988 . Computer Algorithms—An Introduction to Design and Analysis , Addison Wesley .
   Google Scholar
• Carlsson , S. 1987 . The deap—A double ended heap to implement double ended priority queues . Information Processing Letters , 26 : 33 – 36 .
   Google Scholar
• Gonnet , G. H. and Munro , I. 1986 . Heaps on heaps . SIAM Journal on Computing , 15 : 967 – 971 .
   Google Scholar
• Hwang , K. and Briggs , F. A. 1984 . Computer Architecture and Parallel Processing , McGraw-Hill .
   Google Scholar
• Mc Diarmid , C. J. H. and Reed , B. A. 1989 . Building heaps fast . Journal of Algorithms , 10 : 351 – 365 .
   Google Scholar
• Nevalainen , O. and Teuhola , J. 1977 . Pri-ority queue administration by sublist index . The Computer Journal , 22 : 220 – 224 .
   Google Scholar
• Olariu S. Wen Z. Fast Algorithms on Heaps Department of Computer Science, Old Dominion University February 1990 Tech. Report TR-90-12
   Google Scholar
• Sack , J.-R. and Strothotte , T. 1985 . An algorithm for merging heaps . Acta Informatica , 22 : 171 – 186 .
   Google Scholar
• Vishkin U. Synchronous Parallel Computation—A Survey Dept. of Computer Science, Courant Institute, NYU 1983 TR71
   Google Scholar