Author:
Dehne Frank,Song Siang W.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. J. R. Anderson and G. L. Miller, “A simple randomized parallel algorithm for list ranking”. Information Processing Letters, Vol. 33, No. 5, 1990, pp. 269–273.
2. J. R. Anderson and G. L. Miller, “Deterministic parallel list ranking”, J. H. Reif (ed.), VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, Springer Verlag, Lecture Notes in Computer Science, Vol. 319, 1988, pp. 81–90.
3. R.J. Anderson, and L. Snyder, “A Comparison of Shared and Nonshared Memory Models of Computation,” in Proc. of the IEEE, 79(4), pp. 480–487.
4. M. J. Atallah, S. E. Hambrusch, “Solving tree problems on a mesh-connected processor array,” Information and Control, Vol. 69, 1986, pp. 168–187.
5. S. Baase, “Introduction to parallel connectivity, list ranking, and Euler tour techniques”. J. H. Reif (ed.) Synthesis of Parallel Algorithms. Morgan Kaufmann Publisher, 1993.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable Assembly for Massive Genomic Graphs;2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID);2017-05
2. SWAP-Assembler 2: Optimization of De Novo Genome Assembler at Extreme Scale;2016 45th International Conference on Parallel Processing (ICPP);2016-08
3. CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters;Recent Advances in Parallel Virtual Machine and Message Passing Interface;2003
4. Minimizing Global Communication in Parallel List Ranking;Euro-Par 2003 Parallel Processing;2003
5. Portable List Ranking: An Experimental Study;Algorithm Engineering;2001