Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

Theoretical Computer Science

Volumn 188, Issue 1-2, 1997, Pages 59-78

  Sen, Sandeep ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DECISION THEORY; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; PARALLEL PROCESSING SYSTEMS; SORTING; THEOREM PROVING; TREES (MATHEMATICS);

CONVEX HULL CONSTRUCTION; PARALLEL ALGEBRAIC DECISION TREES; TRAPEZOIDAL DECOMPOSITION;

PARALLEL ALGORITHMS;

EID: 0031276124     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00212-5     Document Type: Article

References (31)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, Parallel computational geometry, in: Proc. 25th Ann. Symp. on Foundations of Computer Science (1985) 468-477. Also appears in full version in Algorithmica 3 (1988) 293-327.
2. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, Parallel computational geometry, in: Proc. 25th Ann. Symp. on Foundations of Computer Science (1985) 468-477. Also appears in full version in Algorithmica 3 (1988) 293-327.
3. N. Alon and Y. Azar, The average complexity of deterministic and randomized parallel comparison-sorting algorithms, SIAM J. Comput. 17 (1988) 1178-1192.
4. M.J. Atallah, R. Cole and M.T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms. SIAM J. Comput. 18 (1989) 499-532.
5. M.J. Atallah and M. Goodrich, in: J.H. Reif, ed., Deterministic Parallel Computational Geometry (Morgan Kaufman, Los Altos, CA, 1993).
6. N.M. Amato, M.T. Goodrich and E.A. Ramos, Parallel algorithms for higher-dimensional convex hulls, in: Proc. 35th Ann. FOCS (1994) 683-694.
7. Y. Azar and U. Vishkin, Tight comparison bounds on the complexity of parallel sorting, SIAM J. Comput. 16 (1987) 458-464.
8. P. Beame and J. Hastad, Optimal bounds for decision problems on CRCW PRAMS, in: Proc. 19th ACM STOC (1987) 83-93.
9. M. Ben-Or, Lower bounds for algebraic computation trees, in: Proc. 15th STOC (1983) 80-86.
10. R.B. Boppana, The average-case parallel complexity of sorting, Inform. Process. Lett. 33 (1989) 145-146.
11. B. Chazelle and D. Dobkin, Intersection of convex objects in two and three dimensions, J. ACM 34 (1987) 1-27.
12. K.L. Clarkson, Applications of random sampling in computational geometry-II, in: Proc. 4th Ann. ACM Symp. on Computational Geometry (1988) 1-11.
13. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770-785.
14. D. Dobkin and R.J. Lipton, Multidimensional searching problems, SIAM J. Comput. 5 (1976) 181-186.
15. M. Dietzfelbinger, H. Bast and T. Hagerup, A perfect parallel dictionary, in: Proc. 17th Internal. Symp. on Math. Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin, 1992) 133-141.
16. N. Gupta and S. Sen, Optimal and output sensitive algorithms for constructing planar hulls in parallel, Comput. Geom. Theory Appl., to appear.
17. T. Hagerup, The log star revolution, in: Proc. 9th Ann. STACS, Lecture Notes in Computer Science, Vol. 577, (Springer, Berlin, 1992) 259-278.
18. T. Hagerup and R. Raman, Waste makes haste: tight bounds for loose, parallel sorting, in: Proc. 33rd Ann. FOCS (1992) 628-637.
19. J. Jaĺa, An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
20. S. Kapoor and P. Ramanan, Lower bounds for maximal and convex layer problems, Algorithmica (1989) 447-459.
21. P. MacKenzie and Q. Stout, Ultra-fast expected time parallel algorithms, in: Proc. 2nd SODA (1991) 414-423.
22. U. Manber and M. Tompa, The effect of number of hamiltonian paths on the complexity of a vertex coloring problem, SIAM J. Comput. 13 (1984) 109-115.
23. S. Rajasekaran and S. Sen, in: J.H. Reif, ed., Random Sampling Techniques and Parallel Algorithm Design (Morgan Kaufman, Los Altos, CA 1993).
24. J.H. Reif and S. Sen, Optimal parallel randomized algorithms for 3-d convex hull, and related problems, SIAM J. Comput. 21 (1992) 466-485.
25. J.H. Reif and S. Sen, Optimal randomized parallel algorithms for, computational geometry, Algorithmica 7 (1992) 91-117.
26. M.F. Roy and R. Pollack, On the number of cells defined by a set of polynomials, Comptes Rendus 316 (1992) 573-577.
27. S. Sen, Random sampling techniques for efficient parallel algorithms in computational geometry, Ph.D. Thesis, Duke University, 1989.
28. J. Steele and A.C. Yao, Lower bounds for algebraic decision trees, J. Algorithms (1982) 1-8.
29. A.C. Yao, Probabilistic computation - towards a unified measure of complexity, in: Proc. 18th Foundations of Computer Science (1977) 222-227.
30. A.C. Yao, A lower bound for finding convex hulls, J. ACM 28 (1981) 780-787.
31. C.K. Yap, Parallel triangulation of a polygon in two calls to the, trapezoidal map, Algorithmica 3 (1988) 279-288.