Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. L. Adleman and K. Manders, ‘Reducibility, Randomness and Untractability," Proc. 9th ACM STOC, 1977, pp. 151–163.
2. A. Aggarwal and R. Anderson, "A Random NC Algorithm for Depth First Search," Proc of the 19th ACM STOC, 1987, pp. 325–334.
3. Aggarwal et al., ‘Parallel Computational Geometry,’ Proc. of the 26th Annual Symp on F.O.C.S., 1985, pp. 468–477. Also appears in ALGORITHMICA, Vol. 3, No. 3, 1988, pp. 293–327.
4. Atallah, Cole and Goodrich, ‘Cascading Divide-and-conquer: A technique for designing parallel algorithms, Proc. of the 28th Annual Symp. on F.O.C.S., 1987, pp. 151–160.
5. Clarkson, ‘Applications of random sampling in Computational Geometry II,’ Proc. of the 4th Annual Symp. on Computational Geometry, June 1988, pp. 1–11.