Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence

Journal of Algorithms

Volumn 23, Issue 2, 1997, Pages 329-344

  Wang, Biing Feng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343887989     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0839     Document Type: Article

References (20)

1. L. Alonso, E. M. Reingold, and R. Schott, Multidimensional divide-and-conquer maximin recurrences, SIAM J. Discrete Math. 8(3) (1995), 428-447.
2. C. J. K. Batty and D. G. Rogers, Some maximal solutions of the generalized subadditive inequality, SIAM J. Algebraic Discrete Methods 3 (1982), 369-378.
3. B. Chazelle and H. Edelsbrunner, Optimal algorithm for intersecting line segments in the plane, J. Assoc. Comput. Mach. 39(1) (1992), 1-54.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
5. D. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon, Comput. Graphics 22 (1988), 31-40.
6. M. L. Fredman, Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees, in "Proceedings of the 7th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery," New York, 1975, pp. 240-244.
7. S. K. Ghosh and D. M. Mount, An output sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20(5) (1991), 888-910.
8. R. L. Graham, D. E. Knuth, and O. Patashnik, "Concrete Mathematics," Addison-Wesley, Reading, MA, 1989.
9. D. H. Greene and D. E. Knuth, "Mathematics for the Analysis of Algorithms," Second ed., Birkhauser, Boston, 1982.
10. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987), 209-233.
11. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984), 338-355.
12. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, Sorting Jordan sequences in linear time, in "Proceedings of the 1985 Symposium on Computational Geometry," Association for Computing Machinery, New York, 1985, pp. 196-202.
13. E. Horowitz and S. Sahni, "Fundamentals of Computer Algorithms," Computer Science Press, New York, 1978.
14. Z. Li and E. M. Reingold, Solution of a divide-and-conquer maximin recurrence, SIAM J. Comput. 18(6) (1989), 1188-1200.
15. M. D. McIlroy, The number of 1's in binary integers: Bounds and extremal properties, SIAM J. Comput. 3 (1974), 255-261.
16. K. Mehlhorn, "Data Structures and Algorithms 1: Sorting and Searching," Springer-Verlag, Berlin/New York, 1984.
17. F. P. Preparata and M. I. Shamos, "Computational Geometry," Springer-Verlag, Berlin/New York, 1985.
18. E. M. Reingold and W. J. Hansen, "Data Structures in Pascal," Little, Brown, Boston, 1986.
19. R. E. Tarjan and C. J. Van Wyk, An O(n log log n)-time algorithm for triangulating a simple polygon, SIAM J. Comput. 17 (1988), 143-178.
20. P. Vaidya, An O(n log n) algorithm for the all-nearest-neighbors problem, Discrete Comput. Geom. 4 (1989), 101-115.