{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:50Z","timestamp":1725663590538},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:32Z","timestamp":1330257332000},"page":"137-149","source":"Crossref","is-referenced-by-count":4,"title":["Exact asymptotics of divide-and-conquer recurrences"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Mordecai","family":"Golin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"12_CR1","first-page":"239","volume":"5","author":"J.-P. Allouche","year":"1987","unstructured":"Allouche, J.-P. Automates finis en th\u00e9orie des nombres. Expositiones Mathematicae 5 (1987), 239\u2013266.","journal-title":"Expositiones Mathematicae"},{"key":"12_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., and Cohen, H. Dirichlet series and curious infinite products. Bulletin of the London Mathematical Society 17 (1985), 531\u2013538.","journal-title":"Bulletin of the London Mathematical Society"},{"key":"12_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., and Shallit, J. The ring of k-regular sequences. Theoretical Computer Science 98 (1992), 163\u2013197.","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Apostol, T. M. Introduction to Analytic Number Theory. Springer-Verlag, 1976.","DOI":"10.1007\/978-3-662-28579-4"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0022-314X(84)90094-5","volume":"19","author":"T. M. Apostol","year":"1984","unstructured":"Apostol, T. M., and Vu, T. H. Dirichlet series related to the Riemann zeta function. Journal of Number Theory 19 (1984), 85\u2013102.","journal-title":"Journal of Number Theory"},{"key":"12_CR6","unstructured":"Bentley, J. L., Clarkson, K. L., and Levine, D. B. Fast linear expected-time algorithms for computing maxima and convex hulls. In First Symposium on Discrete Algorithms (SODA) (1990)."},{"issue":"4","key":"12_CR7","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"J. L. Bentley","year":"1978","unstructured":"Bentley, J. L., Kung, H., Schkolnick, M., and Thompson, C. On the average number of maxima in a set of vectors and applications. Journal of the Association for Computing Machinery 25, 4 (October 1978), 536\u2013543.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR8","unstructured":"Billingsley, P. Probability and Measure, 2nd ed. John Wiley & Sons, 1986."},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(89)90156-7","volume":"33","author":"C. Buchta","year":"1989","unstructured":"Buchta, C. On the average number of maxima in a set of vectors. Information Processing Letters 33 (Nov. 1989), 63\u201365.","journal-title":"Information Processing Letters"},{"key":"12_CR10","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Cormen, T. H., Leiserson, C. E., and Rivest, R. L.Introduction to Algorithms. MIT Press, New York, 1990."},{"issue":"1","key":"12_CR11","first-page":"31","volume":"XXI","author":"H. Delange","year":"1975","unstructured":"Delange, H. Sur la fonction sommatoire de la fonction somme des chiffres. L'enseignement Math\u00e9matique XXI, 1 (1975), 31\u201347.","journal-title":"L'enseignement Math\u00e9matique"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02280782","volume":"30","author":"L. Devroye","year":"1983","unstructured":"Devroye, L. Moment inequalities for random variables in computational geometry. Computing 30 (1983), 111\u2013119.","journal-title":"Computing"},{"key":"12_CR13","unstructured":"Dumas, P. R\u00e9currences Mahl\u00e9riennes, suites automatiques, et \u00e9tudes asymptotiques. Doctorat de math\u00e9matiques, Universit\u00e9 de Bordeaux I, 1992. In preparation."},{"key":"12_CR14","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., and Thomas, A. Syst\u00e8mes de num\u00e9ration et fonctions fractales relatifs aux substitutions. Theoretical Computer Science 65 (1989), 153\u2013169.","journal-title":"Theoretical Computer Science"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Flajolet, P., and Golin, M. Mellin transforms and asymptotics: The mergesort recurrence. Preprint submitted to Acta Informatica., Jan. 1993.","DOI":"10.1007\/BF01177551"},{"key":"12_CR16","unstructured":"Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., and Tichy, R. Mellin transforms and asymptotics: Digital sums. Research Report 1498, Institut National de Recherche en Informatique et en Automatique, Sept. 1991. 23 pages. To appear in Theoretical Computer Science, December 1993."},{"key":"12_CR17","unstructured":"Knuth, D. E. The Art of Computer Programming, vol. 1: Fundamental Algorithms. Addison-Wesley, 1968. Second edition, 1973."},{"key":"12_CR18","unstructured":"Knuth, D. E. The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973."},{"key":"12_CR19","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"Sedgewick, R.Algorithms, second ed. Addison-Wesley, Reading, Mass., 1988.","edition":"second ed."},{"issue":"4","key":"12_CR20","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 Journal on Applied Mathematics 32, 4 (1977), 717\u2013730.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"12_CR21","unstructured":"Vardi, I. Computational Recreations in Mathematica. Addison Wesley, 1991."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:29Z","timestamp":1605647249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}