论文信息 - Optimal Parallel Randomized Algorithms for 3-D Convex Hulls and Related Problems - 字舞流文

Optimal Parallel Randomized Algorithms for 3-D Convex Hulls and Related Problems

John H. Reif | Sandeep Sen

[1] Kenneth L. Clarkson,et al. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental , 1988, SCG '88.

[2] John H. Reif,et al. Random sampling techniques for efficient parallel algorithms in computational geometry , 1989 .

[3] Richard Cole,et al. Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

[4] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5] John H. Reif,et al. Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications , 1994, SIAM J. Comput..

[6] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.