Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking, to appear, Aegean Workshop on Computing, Corfu, 1988.
2. I. Bar-On and U. Vishkin, Optimal parallel generation of a computation tree form,ACM Trans. Prog. Lang. Sys.,7, 2 (1985), 348–357.
3. R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking,Inform, and Control,70 (1986), 32–53.
4. R. Cole and U. Vishkin, Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time,SIAM J. Comput.,17, 1 (1988), 128–142.
5. R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Technical Report No. 277, Courant Institute, New York University, 1987; to appear,Inform, and Computation.
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balancing Straight-line Programs;Journal of the ACM;2021-06-30
2. Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees;2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2021-05
3. Balancing Straight-Line Programs for Strings and Trees;Lecture Notes in Computer Science;2020
4. Balancing Straight-Line Programs;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
5. EFFICIENT IMPLEMENTATION OF TREE SKELETONS ON DISTRIBUTED-MEMORY PARALLEL COMPUTERS;SCALABLE COMPUT-PRAC;2017