Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum euclidean matching heuristic

Algorithmica (New York)

Volumn 22, Issue 4, 1998, Pages 529-546

  Hwang, H K ^a  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Divide and conquer; Exponential sums; Mellin transform; Minimum Euclidean matching; Van der Corput's method

Indexed keywords

EID: 12744265111     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009238     Document Type: Article

References (16)

1. P. Flajolet and M. Golin, Mellin transforms and asymptotics: the mergesort recurrence, Acta Informatica, 31, 673-696 (1994).
2. P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Mellin transforms and asymptotics: digital sums, Theoretical Computer Science, 123, 291-314 (1994).
3. P. Flajolet and L. Ramshaw, A note on Gray code and odd-even merges, SIAM Journal on Computing, 9, 142-158 (1980).
4. P. Grabner, Completely q-multiplicative functions: the Mellin transform approach, Acta Arithmetica, 65, 85-96 (1993).
5. P. Grabner and H. Prodinger, On the optimality of an algorithm of Reingold and Supowit, Journal of Automata, Languages and Combinatorics, 1, 5-11 (1996).
6. S. W. Graham and G. Kolesnik, Van der Corput's Method of Exponential Sums, Cambridge University Press, Cambridge, 1991.
7. G. H. Hardy and M. Riesz, The General Theory of Dirichlet's Series, Cambridge University Press, Cambridge, 1952.
8. H.-K. Hwang, Limit theorems for mergesort, Random Structures and Algorithms, 8, 319-336 (1996).
9. H.-K. Hwang, Asymptotic expansions of mergesort recurrences, Acta Informatica, to appear.
10. D. E. Knuth, The Art of Computer Programming, Volume III, Addison-Wesley, Reading, MA, 1973.
11. J.-L. Mauclaire and L. Murata, On q-additive functions, II, Japan Academy, Proceedings, Series A, Mathematical Sciences, 59, 441-444 (1983).
12. R. Sedgewick, Data movement in odd-even merging, SIAM Journal on Computing, 7, 239-272 (1978).
13. K. J. Supowit and E. M. Reingold, Divide and conquer heuristics for minimum weighted Euclidean matching, SIAM Journal on Computing, 12, 118-143 (1983).
14. G. Tenenbaum, Introduction à la théorie analytique et probabiliste des nombres, Institut Elie Cartan, Université de Nancy I, Nancy, 1990. (English translation by Cambridge University Press, Cambridge, 1995.)
15. E. C. Titchmarsh, The Theory of Functions, 2nd edn., Oxford University Press, London, 1939.
16. E. C. Titchmarsh, The Theory of Riemann Zeta-Function, 2nd edn. revised by D. R. Heath-Brown, Oxford Science Publications, Oxford, 1986.