Deterministic parallel list ranking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 319 LNCS, Issue , 1988, Pages 81-90

  Anderson, Richard J ^a   Miller, Gary L ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

VLSI CIRCUITS;

CONSTANT FACTORS; LIST RANKINGS;

COMPUTER ARCHITECTURE;

EID: 85031923295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0040376     Document Type: Conference Paper

References (14)

1. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th ACM Symposium on Theory of Computation, pages 206-219, 1985.
2. R. Cole and U. Vishkin. Approximate scheduling, exact scheduling, and applications to parallel algorithms. In 27th Symposium on Foundations of Computer Science, pages 478-491, 1986. Part I to appear in SIAM Journal of Computing.
3. R. Cole and U. Vishkin. Faster Optimal Parallel Prefix Sums and List Ranking. Technical Report 56/86, Tel Aviv University, December 1986.
4. H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. 1986. Extended abstract.
5. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. In Proceedings of the 19th ACM Symposium on Theory of Computation, pages 315-324, 1987.
6. Y. Han. Designing Fast and Efficient Parallel Algorithms. PhD thesis, Duke University, 1987.
7. C. Kruskal, L. Rudolf, and M. Snir. The power of parallel prefix computation. In International Conference on Parallel Processing, pages 180-185, 1985.
8. B. D. Lubachevsky and A. G. Greenberg. Simple, efficient asynchronous parallel prefix algorithms. In International Conference on Parallel Processing, pages 66-69, 1987.
9. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In 26th Symposium on Foundations of Computer Science, pages 478-489, 1985.
10. J. H. Reif. An optimal parallel algorithm for integer sorting. In 26th Symposium on Foundations of Computer Science, pages 496-503, 1985.
11. R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14(4):862-874, 1985.
12. U. Vishkin. Randomized speed-ups in parallel computation. In Proceedings of the 16th ACM Symposium on Theory of Computation, pages 230-239 1984.
13. R. A. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In International Conference on Paralle Processing, pages 924-930, 1986.
14. J. C. Wyllie. The Complexity of Parallel Computation. PhD thesis, De partment of Computer Science, Cornell University, 1979