{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:15:10Z","timestamp":1760368510147},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1007\/bf01177551","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:16:56Z","timestamp":1108657016000},"page":"673-696","source":"Crossref","is-referenced-by-count":34,"title":["Mellin transforms and asymptotics"],"prefix":"10.1007","volume":"31","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Mordecai","family":"Golin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"239","volume":"5","author":"J.-P. Allouche","year":"1987","unstructured":"Allouche, J.-P.: Automates finis en th\u00e9orie des nombres. Expo. Math.5, 239?266, (1987)","journal-title":"Expo. Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1112\/blms\/17.6.531","volume":"17","author":"J.-P. Allouche","year":"1985","unstructured":"Allouche, J.-P., Cohen, H.: Dirichlet series and curious infinite products. Bull. Lond. Math. Soc.17, 531?538 (1985)","journal-title":"Bull. Lond. Math. Soc."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J.-P. Allouche","year":"1992","unstructured":"Allouche, J.-P., Shallit, J.: The ring ofk-regular sequences. Theor. Comput. Sci.98, 163?197 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"CR4","volume-title":"Introduction to analytic number theory","author":"T.M. Apostol","year":"1976","unstructured":"Apostol, T.M.: Introduction to analytic number theory. Berlin, Heidelberg, New York: Springer 1976"},{"key":"CR5","volume-title":"Probability and measure","author":"P. Billingsley","year":"1986","unstructured":"Billingsley, P.: Probability and measure, 2nd edn. New York: John Wiley 1986","edition":"2nd edn."},{"key":"CR6","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. New York: MIT Press 1990"},{"issue":"1","key":"CR7","first-page":"31","volume":"21","author":"H. Delange","year":"1975","unstructured":"Delange, H.: Sur la fonction sommatoire de la fonction somme des chiffres. Enseign. Math.21 (1), 31?47 (1975)","journal-title":"Enseign. Math."},{"key":"CR8","unstructured":"Dumas, P.: Crit\u00e8res de B-r\u00e9gularit\u00e9. Cah. S\u00e9min. Th\u00e9orie Nombres (Bordeaux) (1994, to appear)"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(89)90041-8","volume":"65","author":"J.-M. Dumont","year":"1989","unstructured":"Dumont, J.-M., Thomas, A.: Syst\u00e8mes de num\u00e9ration et fonctions fractales relatifs aux substitutions. Theor. Comput. Sci.65, 153?169 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"CR10","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-56939-1_68","volume-title":"Automata, languages, and programming","author":"P. Flajolet","year":"1993","unstructured":"Flajolet, P., Golin, M.: Exact asymptotics of divide-and-conquer recurrences. In: Lingas, S.C.A., Karlsson, R. (eds.) Automata, languages, and programming (Lect. Notes Comput. Sci., vol. 700, pp. 137?149) Berlin, Heidelberg, New York: Springer 1993"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(92)00065-Y","volume":"123","author":"P. Flajolet","year":"1994","unstructured":"Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., Tichy, R.: Mellin transforms and asymptotics: Digital sums. Theor. Comput. Sci.123, 291?314 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci.31 (2), 182?209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR13","volume-title":"The art of comput4r programming, vol. 3: Fundamental algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The art of comput4r programming, vol. 3: Fundamental algorithms, 2nd edn. Reading, MA: Addison-Wesley 1968","edition":"2nd edn."},{"key":"CR14","volume-title":"The art of computer programming, vol. 3: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, vol. 3: Sorting and searching. Reading, MA: Addison-Wesley 1973"},{"key":"CR15","volume-title":"Algorithms","author":"R. Sedgwick","year":"1988","unstructured":"Sedgwick, R.: Algorithms, 2nd edn. Reading, MA: Addison-Wesley 1988","edition":"2nd edn."},{"issue":"4","key":"CR16","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/0132060","volume":"32","author":"K.B. Stolarsky","year":"1977","unstructured":"Stolarsky, K.B.: Power and exponential sums of digital sums related to binomial coefficients. SIAM J. Appl. Math.32 (4) 717?730 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"CR17","volume-title":"Computational recreations in mathematica","author":"I. Vardi","year":"1991","unstructured":"Vardi, I.: Computational recreations in mathematica. Reading, MA: Addison Wesley 1991"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01177551.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01177551\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01177551","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:07:19Z","timestamp":1556629639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01177551"}},"subtitle":["The mergesort recurrence"],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["BF01177551"],"URL":"https:\/\/doi.org\/10.1007\/bf01177551","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}