Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Anderson, R.J., Miller, G.L.: Deterministic Parallel List Ranking. Algorithmica 6, 859–868 (1991)
2. Cole, R., Vishkin, U.: Approximate Parallel Scheduling, Part I: the Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM Journal on Computing 17(1), 128–142 (1988)
3. Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. In: Proc. 9th Computational Geometry, pp. 298–307. ACM, New York (1993)
4. Lecture Notes in Computer Science;F. Dehne,1996
5. Lecture Notes in Computer Science;T. Hayashi,1996