Finding the maximum, merging, and sorting in a parallel computation model-Reference-Cited by-同舟云学术

Finding the maximum, merging, and sorting in a parallel computation model

Published:1981-03 Issue:1 Volume:2 Page:88-102
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Shiloach Yossi,Vishkin Uzi

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference17 articles.

1. D. A. Alton and D. M. Eckstein, Parallel breadth-first search of p sparse graphs, Proc. of humboldt State University Conference on Graph Theory, Combinatorics and Computing (Phillis Clinn, Ed.), Utilitas Mathematica, University of Manitoba, Winnipeg, in press.

2. Sorting networks and their applications;Batcher,1968

3. Parallel Processing Using Depth-First Search and Breadth-First Search;Eckstein,1977

4. D. M. Eckstein and D. A. Alton, Parallel searching of nonsparse graphs, SIAM J. Comput., in press.

5. Parallelism in tape-sorting;Even;Comm. ACM,1974

Cited by 208 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Teaching Parallel Algorithms Using the Binary-Forking Model;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

2. Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC;Distributed Computing;2022-06-29

3. Optimal Parallel Algorithms in the Binary-Forking Model;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

4. All Nearest Smallers Made Simple;Parallel Processing Letters;2020-06

5. Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC;The 31st ACM Symposium on Parallelism in Algorithms and Architectures;2019-06-17