The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules

Journal of Algorithms

Volumn 30, Issue 2, 1999, Pages 423-448

  Chen, Wei Mei ^a   Hwang, Hsien Kuei ^b   Chen, Gen Huey ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (16)

1. 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.
2. P. Flajolet and M. Golin, Mellin transforms and asymptotics: the mergesort recurrence, Acta Inform. 31 (1994), 673-696.
3. P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Mellin transforms and asymptotics: digital sums, Theoret. Comput. Sci. 123 (1994), 291-314.
4. C. R. Glassey and R. M. Karp, On the optimality of Huffman trees, SIAM J. Appl. Math. 31 (1976), 368-378.
5. M. Golin and R. Sedgewick, Queue-mergesort, Inform. Process. Lett. 48 (1993), 253-259.
6. D. H. Greene and D. E. Knuth, "Mathematics for the Analysis of Algorithms," Birkhäuser, Boston, 1981.
7. J. M. Hammersley and G. R. Grimmett, Maximal solutions of the generalized subadditive inequality, in "Chapter 4 of Stochastic Geometry" (E. F. Harding and D. G. Kendall, Eds.), Wiley, New York, 1974.
8. H.-K. Hwang, Limit theorems for mergesort, Random Structures Algorithms 8 (1996), 319-336.
9. H.-K. Hwang and J.-M. Steyaert, On the number of heaps and the cost of heap construction, Theoret. Comput. Sci., to appear.
10. D. E. Knuth, "The Art of Computer Programming, Volume III-Sorting and Searching," 2nd ed., Addison-Wesley, Reading, MA, 1998.
11. M. Marden, "Geometry of Polynomials," 2nd ed., Mathematical Surveys, No. 3, Am. Math. Soc. Providence, RI, 1966.
12. W. Panny and H. Prodinger, Bottom-up mergesort - a detailed analysis, Algorithmica 14 (1995), 340-354.
13. V. V. Petrov, "Limit Theorems of Probability Theory. Sequences of Independent Random Variables," Clarendon, Oxford, 1995.
14. R. Sedgewick, "Algorithms in C," 3rd ed., Addison-Wesley, Reading, MA, 1998.
15. M. Snir, Exact balancing is not always good, Inform. Process. Lett. 22 (1986), 97-102.
16. T. Walsh, How evenly should one divide to conquer quickly? Inform. Process. Lett. 19 (1984), 203-208.