Author:
Gazit Hillel,Miller Gary L.,Teng Shang-Hua
Reference13 articles.
1. Richard Anderson and Gary L. Miller. Optimal Parallel Algorithms for List Ranking. Technical Report, USC, Los Angeles, 1987.
2. I. Bar-On and U. Vishkin. Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems, 7 (2): 348–357, April 1985.
3. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In 27th Annual Symposium on Foundations of Computer Science, pages 478–491, IEEE, Toronto, Oct 1986.
4. Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal list ranking. Information and Control, 70 (1): 32–53, 1986.
5. Eliezer Dekel, Simeon Ntafos, and Shie-Tung Peng. Parallel Tree Techniques and Code Opimization, pages 205–216. Volume 227 of Lecture Notes in Computer Science, Springer-Verlag, 1986.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. A Universal Tree Balancing Theorem;ACM Transactions on Computation Theory;2019-01-16
3. To Push or To Pull;Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing;2017-06-26
4. Parallel Algorithms for Asymmetric Read-Write Costs;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
5. Parallel Tree Accumulations on MapReduce;International Journal of Parallel Programming;2015-03-20