. Bro78, R. Mark, and . Brown, Implementation and analysis of binomial queue algorithms, SIAM Journal on Computing, vol.7, issue.3, pp.298-319, 1978.

P. [. Cheung, M. Flajolet, C. Y. Golin, and J. Lee, Multidimensional Divide-and-Conquer and Weighted Digital Sums (Extended Abstract), ANALCO, pp.58-65, 2009.
DOI : 10.1137/1.9781611972993.9

P. [. Cheung, M. Flajolet, C. Y. Golin, and J. Lee, Multidimensional divide-and-conquer and weighted digital sums, 2010.

H. Delange, Sur la fonction sommatoire de la fonction somme des chiffres, Enseignement Math, vol.21, issue.2, pp.31-47, 1975.

P. J. Flajolet, P. Grabner, H. Kirschenhofer, R. F. Prodinger, and . Tichy, 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

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

J. Peter, H. Grabner, and . Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence. Constructive Approximation, pp.149-179, 2005.

H. Hwang, Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic, Algorithmica, vol.22, issue.4, pp.529-546, 1998.
DOI : 10.1007/PL00009238

W. Panny and H. Prodinger, Bottom-up mergesort ? A detailed analysis, Algorithmica, vol.48, issue.4, pp.340-354, 1995.
DOI : 10.1007/BF01294131

R. Marko and . Riedel, Applications of the mellin-perron formula in number theory, 1996.

C. Edward and . Titchmarsh, The Theory of the Riemann Zeta-Function, 1986.

N. George, E. T. Watson, and . Whittaker, A Course of Modern Analysis, 1963.