List ranking on meshes

Acta Informatica

Volumn 35, Issue 7, 1998, Pages 543-566

  Sibeyn, Jop F ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032336334     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050131     Document Type: Article

References (20)

1. Anderson, R.J., Miller, G.L.: Deterministic Parallel List Ranking, Algorithmica 6, 859-868 (1991)
2. Atallah, M.J., Hambrusch, S.E.: Solving Tree Problems on a Mesh-Connected Processor Array, Inf Control 69, 168-187 (1986)
3. Cole, R., Vishkin, U.: Deterministic Coin Tossing and Accelerated Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, Proc. 18th Symposium on Theory of Computing, pp. 206-219, ACM 1986
4. Gibbons, A., Rytter, W.: Efficient Parallel Algorithms, Cambridge: Cambridge University Press 1988
5. Gibbons, A.M., Srikant, Y.N.: A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation, Inf Process Lett 32, pp. 305-311 (1989)
6. Hagerup, T., Rüb, C.: A Guided Tour of Chernoff Bounds, Inf Process Lett 33, 305-308 (1990)
7. JáJá, J.: An Introduction to Parallel Algorithms, Addison-Wesley 1992
8. Kaufmann, M., Sibeyn, J.F., Suel, T.: Derandomizing Routing and Sorting Algorithms for Meshes, Proc. 5th Symposium on Discrete Algorithms, pp. 669-679, ACM-SIAM 1994
9. Kunde, M.: Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound, Proc. European Symposium on Algorithms, LNCS 726, pp. 272-283, Berlin Heidelberg New York: Springer 1993
10. Leighton, T.: Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, San Mateo, CA: Morgan-Kaufmann 1992
11. Leighton, T., Makedon, F., Tollis, Y.: A 2n - 2 Step Algorithm for Routing in an n × n Array with Constant Size Queues, Algorithmica 14, 291-304 (1995)
12. McDiarmid, C.: On the Method of Bounded Differences, In: Siemens, J. (ed.) Surveys in Combinatorics, 1989 London Mathematical Society Lecture Note Series 141, pp. 148-188, Cambridge: Cambridge University Press 1989
13. Park, A., Balasubramanian, K.: Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers, J Parallel Distrib Comput 9 318-322 (1990)
14. Rajasekaran, S., Overholt, R.: Constant Queue Routing on a Mesh, J Parallel Distrib Comput 15, 160-166 (1992)
15. Ryu, K.W., JáJá, J.: Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube, IEEE Trans Parallel Distrib Syst, 1, 83-90 (1990)
16. Sibeyn, J.F.: Algorithms for Routing on Meshes, Ph.D. thesis, Utrecht University, Utrecht, the Netherlands, 1992
17. Sibeyn, J.F.: Desnakification of Mesh Sorting Algorithms, Proc. 2nd European Symposium on Algorithms, LNCS 855, pp. 377-390, Berlin Heidelberg New York: Springer 1994. To appear in SIAM Journal on Computing
18. Sibeyn, J.F.: Desnakification of Mesh Sorting Algorithms, Proc. 2nd European Symposium on Algorithms, LNCS 855, pp. 377-390, Berlin Heidelberg New York: Springer 1994. To appear in SIAM Journal on Computing
19. Sibeyn, J.F., Chlebus, B.S., Kaufmann, M.: 'Shorter Queues for Permutation Routing on Meshes,' Proc. 19th Symposium on Mathematical Foundations of Computer Science, LNCS 841, pp. 597-607, Berlin Heidelberg New York: Springer 1994. To appear in Journal of Algorithms
20. Sibeyn, J.F., Chlebus, B.S., Kaufmann, M.: 'Shorter Queues for Permutation Routing on Meshes,' Proc. 19th Symposium on Mathematical Foundations of Computer Science, LNCS 841, pp. 597-607, Berlin Heidelberg New York: Springer 1994. To appear in Journal of Algorithms