References
- Atkinson , M.D. , Sack , J.R. , Santoro , N. and Strothotte , T. 1986 . Min-max heaps and generalized priority queues . Communications of ACM , 29 : 996 – 1000 .
- Baase , S. 1988 . Computer Algorithms-An Introduction to Design and Analysis , Addison Wesley .
- Carlsson , S. 1987 . The deap—A double ended heap to implement double ended priority queues . Information Processing Letters , 26 : 33 – 36 .
- Carlsson , S. , Chen , J. and Strothotte , T. 1989 . A note on the construction of the data structure 'deap' . Information Processing Letters , 31 : 315 – 317 .
- Cole , R. 1988 . An optimally efficient selection algorithm . Information Processing Letters , 26 ( 6 ) : 295 – 299 .
- Cole , R. and Vishkin , U. 1986 . Faster optimal parallel prefix sums and list ranking , Israel : Tel Aviv University . TR 56/86, The Moise and Frida Eskenazy Institute for Computer Science
- Coffman , E.G. and Hofri , M. 1982 . On scanning disks and the analysis of their steady state behaviour . Proceedings of the Conference of Measurement, Modelling and Evaluating Com. Systems . October 1982 , New York, NY.
- Hofri , M. 1980 . Disk Scheduling: FCFS vs SSTF, Revisited . Comm. of ACM , 23 October
- Hwang , K. and Briggs , F.A. 1984 . Computer Architecture and Parallel Processing , McGraw-Hill .
- Knuth , D. 1975 . The Art of Computer Programming , Vol. 3 , Addison-Wesley .
- Nevalainen , O. and Teuhola , J. 1977 . Priority queue administration by sublist index . The Computer Journal , 22 : 220 – 224 .
- Olariu S. Wen Z. Fast Parallel Heap Algorithms, Department of Computer Science Old Dominion University February 1990 Tech. Report TR-90-12
- Vishkin , U. 1983 . Synchronous Parallel Computation—a Survey , NYU : Courant Institute . TR 71, Dept. of Computer Science