An asymptotic theory for recurrence relations based on minimization and maximization

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1475-1501

  Hwang, Hsien Kuei ^a   Tsai, Tsung Hsi ^a  

^a Institute of Statistical Science   (United States)

Author keywords

Divide and conquer; Optimal algorithms; Power of two rules; Recurrence relations; Slowly varying functions

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

DIVIDE AND CONQUER; OPTIMAL ALGORITHM; POWER-OF-TWO; RECURRENCE RELATIONS; SLOWLY VARYING FUNCTIONS;

ASYMPTOTIC ANALYSIS;

EID: 85009192420     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00066-X     Document Type: Article

References (57)

1. [1] Aho, A.V., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Second Printing, 1975, Addison-Wesley, Reading, MA.
2. [2] Alonso, L., Reingold, E.M., Schott, R., Multidimensional divide-and-conquer maximin recurrences. SIAM J. Discrete Math. 8 (1995), 428–447.
3. [3] Batty, C.J.K., Rogers, D.G., Some maximal solutions of the generalized subadditive inequality. SIAM J. Algebraic Discrete Methods 3 (1982), 369–378.
4. [4] Bingham, N.H., Goldie, C.M., Teugels, J.L., Regular Variation, 1989, Cambridge University Press, Cambridge, New York.
5. [5] de Bruijn, N.G., Erdős, P., Some linear and some quadratic recursion formulas. II. Indagationes Mathematicae 14 (1952), 152–163.
6. [6] Carlitz, L., A sorting function. Duke Math. J. 38 (1971), 561–568.
7. [7] Chang, C.-S., Thomas, J.A., Huffman algebras for independent random variables. Discrete Events Dynamic Systems: Theory Appl. 4 (1994), 23–40.
8. [8] Chen, W.-M., Hwang, H.-K., Chen, G.-H., The cost distribution of queue-mergesort, optimal mergesorts, and power-of-2rules. J. Algorithms 30 (1999), 423–448.
9. [9] Cormen, T.H., Leiserson, C.E., Rivest, R.L., Introduction to Algorithms, 1990, MIT Press, Cambridge, MA.
10. [10] Delange, H., Sur la fonction sommatoire de la fonction somme des chiffres. Enseign. Math. 21 (1975), 31–47.
11. [11] Devroye, L., Moment inequalities for random variables in computational geometry. Computing 30 (1983), 111–119.
12. [12] Fill, J.A., On the distribution of binary search trees under the random permutation model. Random Structures and Algorithms 8 (1996), 1–25.
13. [13] Flajolet, P., Golin, M., Mellin transforms and asymptotics: the mergesort recurrence. Acta Inform. 31 (1994), 673–696.
14. [14] Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., Tichy, R.F., Mellin transforms and asymptotics: digital sums. Theoret. Comput. Sci. 123 (1994), 291–314.
15. [15] Flajolet, P., Zimmerman, P., Van Cutsem, B., A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci. 132 (1994), 1–35.
16. [16] Fredman, M.L., Knuth, D.E., Recurrence relations based on minimization. J. Math. Anal. Appl. 48 (1974), 534–559.
17. [17] Gal, S., A discrete search game. SIAM J. Appl. Math. 27 (1974), 641–648.
18. [18] Glassey, C.R., Karp, R.M., On the optimality of Huffman trees. SIAM J. Appl. Math. 31 (1976), 368–378.
19. [19] Golin, M.J., Sedgewick, R., Queue-mergesort. Inform. Process. Lett. 48 (1993), 253–259.
20. [20] Greene, D.H., Knuth, D.E., Mathematics for the Analysis of Algorithms, 3rd edition, 1990, Birkhäuser, Boston.
21. [21] Hammersley, J.M., Generalization of the fundamental theorem on sub-additive functions. Proc. Cambridge Philos. Soc. 58 (1962), 235–238.
22. [22] Hammersley, J.M., Grimmett, G.R., Maximal solutions of the generalized subadditive inequality. Harding, E.F., Kendall, D.G., (eds.) Stochastic Geometry, 1974, Wiley, London, 270–284.
23. [23] Harding, E.F., The probabilities of rooted tree-shapes generated by random bifurcation. Adv. Appl. Probab. 3 (1971), 44–77.
24. [24] Hart, S., A note on the edges of the n-cube. Discrete Math. 14 (1976), 157–163.
25. [25] Hassin, R., Henig, M., Dichotomous search for random objects on an interval. Math. Oper. Res. 9 (1984), 301–308.
26. [26] Hassin, R., Rotovely, R., Asymptotic analysis of dichotomous search with search and travel costs. European J. Oper. Res. 58 (1992), 78–89.
27. [27] Hinderer, K., On dichotomous search with direction-dependent costs for a uniformly hidden object. Optimization 21 (1990), 215–229.
28. [28] Hinderer, K., Stieglitz, M., On polychotomous search problem. European J. Oper. Res. 73 (1994), 279–294.
29. [29] Hong, Z., Sedgewick, R., Notes on merging networks. ACM Symposium on Theory of Computing (STOC’82), 1982, ACM Press, New York, 296–302.
30. [30] Hwang, H.-K., Limit theorems for mergesort. Random Structures and Algorithms 8 (1996), 319–336.
31. [31] Hwang, F.K., Pfeifer, C.G., Enis, P., An optimal hierarchical procedure for a modified binomial group-testing problem. J. Amer. Statist. Assoc. 76 (1981), 947–949.
32. [32] H.-K. Hwang, J.-M. Steyaert, On the number of heaps and the cost of heap construction, Colloquium on Mathematics and Computer Science 2002 (Versailles), accepted.
33. [33] Jünger, M., Pulleyblank, W., New primal and dual matching heuristics. Algorithmica 13 (1995), 357–380.
34. [34] Kapoor, S., Reingold, E.M., Recurrence relations based on minimization and maximization. J. Math. Anal. Appl. 109 (1985), 591–604.
35. [35] Kapoor, S., Reingold, E.M., Optimum lopsided binary trees. J. Assoc. Comput. Math. 36 (1989), 573–590.
36. [36] D.E. Knuth, Mathematical analysis of algorithms, in: Information Processing’71, Proceedings of IFIP Congress, Ljubljana, 1971, Vol. 1: Foundations and Systems, Amsterdam, North-Holland, 1972, pp. 19–27.
37. [37] Knuth, D.E., The Art of Computer Programming, Volume III—Sorting and Searching, 2nd edition, 1998, Addison-Wesley, Reading, MA.
38. [38] Li, S.Y.R., Binary trees and uniform distribution of traffic cutback. J. Comput. System Sci. 32 (1986), 1–14.
39. [39] Li, Z., Reingold, E.M., Solution of a divide-and-conquer maximin recurrence. SIAM J. Comput. 18 (1989), 1188–1200.
40. [40] McIlroy, M.D., The number of 1's in binary integers: bounds and extremal properties. SIAM J. Comput. 3 (1974), 255–261.
41. [41] Morris, R., Some theorems on sorting. SIAM J. Appl. Math. 17 (1969), 1–6.
42. [42] Murakami, S., A dichotomous search. J. Oper. Res. Soc. Japan 14 (1971), 127–142.
43. [43] O'Geran, J.H., Wynn, H.P., Zhiglyavsky, A.A., Search. Acta Appl. Math. 25 (1991), 241–276.
44. [44] Panny, W., Prodinger, H., Bottom-up mergesort—a detailed analysis. Algorithmica 14 (1995), 340–354.
45. [45] M.J. Pelling, D.G. Rogers, A problem in the design of electrical circuits, a generalized subadditive inequality and the recurrence relation j(n,m)=j ([n/2], m)+j ([n+1/2], m)+(j n, m−1), Lecture Notes in Mathematics, Vol. 622, Springer, Berlin, New York, 1977, pp. 153–169.
46. [46] Pelling, M.J., Rogers, D.G., A combinatorial problem in the design of electrical circuits. Southeast Asian Bull. Math. 4 (1980), 29–33.
47. [47] Pippenger, N., An elementary approach to some analytic asymptotics. SIAM J. Math. Anal. 24 (1993), 1361–1377.
48. [48] Pohl, I., A sorting problem and its complexity. Comm. ACM 15 (1972), 462–464.
49. [49] Reingold, E.M., Tarjan, R.E., On a greedy heuristic for complete matching. SIAM J. Comput. 10 (1981), 676–681.
50. [50] Reingold, E.M., Tilford, J.S., Tidier drawings of trees. IEEE Trans. Software Eng. 7 (1981), 223–228.
51. [51] Roura, S., Improved master theorems for divide-and-conquer recurrences. J. Assoc. Comput. Math. 48 (2001), 170–205.
52. [52] Snir, M., Exact balancing is not always good. Inform. Process. Lett. 22 (1986), 97–102.
53. [53] J.M. Steele, Probability theory and combinatorial optimization, CBMS-NSF Regional Conf., Series in Applied Mathematics, Vol. 69, SIAM, PA, 1997.
54. [54] Walsh, T.R., How evenly should one divide to conquer quickly?. Inform. Process. Lett. 19 (1984), 203–208.
55. [55] Wang, B.-F., Tighter bounds on the solution of a divide-and-conquer maximin recurrence. J. Algorithms 23 (1997), 329–344.
56. [56] Wong, E., A linear search problem. SIAM Rev. 6 (1964), 168–174.
57. [57] J.E. Yukich, Probability theory of classical Euclidean optimization problems, Lecture Notes in Mathematics, Vol. 1675, Springer, Berlin, 1998.