Highly parallelizable problems
作者： Omer Berkman , Dany Breslauer , Zvi Galil , Baruch Schieber , Uzi Vishkin
DOI: 10.1145/73007.73036
关键词: Parallel computing 、 Computer science 、 Parallelizable manifold
摘要:
acm.org
sci-hub.se 参考文章(26)
Mikhail J. Atallah, Michael Truman Goodrich, Efficient parallel techniques for computational geometry Purdue University. ,(1987)
Vijaya Ramachandran, Uzi Vishkin, Efficient Parallel Triconnectivity in Logarithmic Time AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures. pp. 33- 42 ,(1988) , 10.1007/BFB0040371
Yossi Shiloach, Uzi Vishkin, Finding the maximum, merging and sorting in a parallel computation model Conpar 81. pp. 314- 327 ,(1981) , 10.1007/BFB0105127
Andrew C. Yao, Space-time tradeoff for answering range queries (Extended Abstract) Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 128- 136 ,(1982) , 10.1145/800070.802185
Mikhail J. Atallah, Michael T. Goodrich, Efficient parallel solutions to some geometric problems Journal of Parallel and Distributed Computing. ,vol. 3, pp. 492- 507 ,(1986) , 10.1016/0743-7315(86)90011-0
Harold N. Gabow, Jon Louis Bentley, Robert E. Tarjan, Scaling and related techniques for geometry problems symposium on the theory of computing. pp. 135- 143 ,(1984) , 10.1145/800057.808675
Uzi Vishkin, Ilan Bar-on, Optimal Parallel Generation of a Computation Tree Form ,(2018)
Uzi Vishkin, Optimal Parallel Pattern Matching in Strings ,(2011)
Gen-Huey Chen, MS Yu, Lung-Tien Liu, None, Two algorithms for constructing a binary tree from its traversals Information Processing Letters. ,vol. 28, pp. 297- 299 ,(1988) , 10.1016/0020-0190(88)90177-9
R. Häggkvist, P. Hell, Sorting and Merging in Rounds Siam Journal on Algebraic and Discrete Methods. ,vol. 3, pp. 465- 473 ,(1982) , 10.1137/0603047