References
- Berkman , O. , Breslauer , D. , Galil , Z. , Schieber , B. and Vishkin , U. 1989 . Proceedings of STOC . Highly Parallelizable Problems . 1989 . pp. 770 – 785 .
- Cole , R. 1988 . Parallel Merge Sort . SIAM Journal on Computing , 17 : 770 – 785 .
- Cole , R. and Vishkin , U. 1988 . Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time . SIAM Journal on Computing , 17 : 128 – 142 .
- Kim , S. K. 1989 . Proc. 27-th Annual Allerton Conference on Communications, Control, and Computing . Optimal parallel algorithms on sorted intervals . 1989 . pp. 766 – 775 .
- Preas , B. T. 1988 . “ Physical design automation of VLSI systems ” . Edited by: Lorenzetti , M. J. Menlo Park : Benjamin/Cummings .
- Preparata , F. P. and Shamos , M. I. 1985 . Computational Geometry: An Introduction , Springer-Verlag .
- Stojmenovic , I. and Miyakawa , M. 1988 . An optimal parallel algorithm for solving the maximal elements problem in the plane . Parallel Computting , 7 : 249 – 251 .
- Vishkin U. Synchronous parallel computation—a survey Dept. of Computer Science, Courant Institute. NYU 1983 TR 71