Author:
Anderson Richard J.,Miller Gary L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking.Information and Computation,70:32–53, 1986.
2. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time.Algorithmica,3:329–346, 1988.
3. R. Cole and U. Vishkin. Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking on logarithmic time.SIAM Journal on Computing,17:128–142, 1988.
4. R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking.Information and Computation,81:334–352, 1989.
5. H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. Extended abstract, 1986.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. More Efficient Parallel Integer Sorting;International Journal of Foundations of Computer Science;2022-03-24
2. Parallel Minimum Cuts in Near-linear Work and Low Depth;ACM Transactions on Parallel Computing;2021-06-30
3. Application of Distance Measurement NLP Methods for Address and Location Matching in Logistics;Intelligent Information and Database Systems: Recent Developments;2019-03-06
4. Parallel Minimum Cuts in Near-linear Work and Low Depth;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11
5. Efficient Implementation of Smoothed Particle Hydrodynamics (SPH) with Plane Sweep Algorithm;Communications in Computational Physics;2016-03