J. L. Bentley, D. Haken, and J. B. Saxe, A general method for solving divide-and-conquer recurrences, ACM SIGACT News, vol.12, issue.3, pp.36-44, 1980.
DOI : 10.1145/1008861.1008865

]. T. Cha99 and . Chan, Geometric applications of a randomized optimization technique, Discrete and Computational Geometry, vol.22, pp.547-567, 1999.

C. [. Cormen, R. L. Leiserson, and . Rivest, Introduction to Algorithms, 1990.

M. [. Flajolet and . Golin, Mellin transforms and asymptotics, Acta Informatica, vol.32, issue.4, pp.673-696, 1994.
DOI : 10.1007/BF01177551
URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Flajolet, P. Grabner, P. Kirschenhofer, and H. Prodinger, Mellin transforms and asymptotics: digital sums, Theoretical Computer Science, vol.123, issue.2, pp.291-314, 1994.
DOI : 10.1016/0304-3975(92)00065-Y
URL : https://hal.archives-ouvertes.fr/inria-00075064

R. [. Flajolet and . Sedgewick, An Introduction to the Analysis of Algorithms, 1996.

B. [. Flajolet and . Sedgewick, Analytic combinatorics. To appear, 2006.
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

H. [. Grabner and . Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence. Constructive Approximation, PP95] W. Panny and H. Prodinger. Bottom-up mergesort. A detailed analysis. Algorithmica, pp.149-179340, 1995.
DOI : 10.1007/s00365-004-0561-x
URL : http://algo.stat.sinica.edu.tw/counter.asp?paper=pdf/Sum-of-Digits.pdf

]. R. Sei91 and . Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete & Computational Geometry, vol.6, issue.5, pp.423-434, 1991.

E. [. Sharir and . Welzl, A combinatorial bound for linear programming and related problems, Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.569-579, 1992.
DOI : 10.1007/3-540-55210-3_213

G. [. Whittaker and . Watson, A Course of Modern Analysis, 1927.