{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:26:14Z","timestamp":1733289974690,"version":"3.30.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00238-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"145-158","source":"Crossref","is-referenced-by-count":3,"title":["Uniform asymptotics of some Abel sums arising in coding theory"],"prefix":"10.1016","volume":"263","author":[{"given":"Hsien-Kuei","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1985","series-title":"Ramanujan's Notebooks, Part I","author":"Berndt","key":"10.1016\/S0304-3975(00)00238-3_BIB1"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB2","first-page":"139","article-title":"The asymptotic behavior of the Dickman\u2013de Bruijn function","volume":"35","author":"Canfield","year":"1982","journal-title":"Cong. Numer."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB3","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/210346.210412","article-title":"Expected deadlock time in a multiprocessor system","volume":"42","author":"Compton","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"volume":"vol. 99","year":"1989","author":"Consul","key":"10.1016\/S0304-3975(00)00238-3_BIB4"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","article-title":"On the Lambert W function","volume":"5","author":"Corless","year":"1996","journal-title":"Adv. Comput. Math."},{"volume":"vol. IV","year":"1961","author":"Evgrafov","key":"10.1016\/S0304-3975(00)00238-3_BIB6"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB7","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, vol. I, 2nd ed., Wiley, New York, 1970."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","article-title":"Birthday paradox, coupon collectors, caching algorithms and self-organizing search","volume":"39","author":"Flajolet","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","article-title":"Mellin transforms and asymptotics: harmonic sums","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0377-0427(93)E0258-N","article-title":"On Ramanujan's Q-function","volume":"58","author":"Flajolet","year":"1995","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB12","series-title":"Random Mapping Statistics, Lecture Notes in Computer Science, vol. 434, EUROCRYPT \u201989","first-page":"329","author":"Flajolet","year":"1990"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB13","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1214\/aoap\/1177004705","article-title":"Probabilistic analysis of an algorithm in the theory of markets in indivisible goods","volume":"5","author":"Frieze","year":"1995","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB14","unstructured":"X. Gourdon, Combinatoire, algorithmique et g\u00e9om\u00e9trie des polyn\u00f4mes, Ph.D. Thesis, Ecole polytechnique, 1996."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.5802\/jtnb.101","article-title":"Integers without large prime factors","volume":"5","author":"Hildebrand","year":"1993","journal-title":"J. Th\u00e9orie Nombres Bordeaux"},{"year":"1992","series-title":"Univariate Discrete Distributions","author":"Johnson","key":"10.1016\/S0304-3975(00)00238-3_BIB16"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/18.370096","article-title":"Bounds for the worst case probability of undetected error","volume":"41","author":"Kl\u00f8ve","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1997","series-title":"The Art of Computer Programming, vol. I: Fundamental Algorithms","author":"Knuth","key":"10.1016\/S0304-3975(00)00238-3_BIB18"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0196-6774(85)90037-9","article-title":"An analysis of optimum caching","volume":"6","author":"Knuth","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1090\/S0002-9939-1989-0949878-9","article-title":"A recurrence related to trees","volume":"105","author":"Knuth","year":"1989","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","article-title":"The expected linearity of a simple equivalence algorithm","volume":"6","author":"Knuth","year":"1978","journal-title":"Theoret. Comput. Sci."},{"year":"1986","series-title":"Random Mappings","author":"Kolchin","key":"10.1016\/S0304-3975(00)00238-3_BIB22"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/3615391","article-title":"Pseudo-random sequence loops","volume":"68","author":"Lawden","year":"1984","journal-title":"Math. Gazette"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB24","unstructured":"J. Massey, Coding techniques for digital networks, Proc. Internat. Conf. on Information Theory Systems, Berlin, Germany, 1978, pp. 307\u2013315."},{"key":"10.1016\/S0304-3975(00)00238-3_BIB25","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1111\/j.2517-6161.1957.tb00269.x","article-title":"Normal approximations to machine interference with many repairmen","volume":"19","author":"Naor","year":"1957","journal-title":"J. Roy. Statist. Soc. Ser. B, Methodological"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB26","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1111\/j.2517-6161.1985.tb01359.x","article-title":"On Palm's model with a large number of machines and repairmen","volume":"47","author":"Salia","year":"1985","journal-title":"J. Roy. Statist. Soc. Ser. B, Methodological"},{"year":"1986","series-title":"Empirical Processes with Applications to Statistics Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics","author":"Shorack","key":"10.1016\/S0304-3975(00)00238-3_BIB27"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB28","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1109\/18.476341","article-title":"On asymptotics of certain sums arising in coding theory","volume":"41","author":"Szpankowski","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB29","first-page":"55","article-title":"On asymptotics of certain recurrences arising in universal coding","volume":"34","author":"Szpankowski","year":"1998","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB30","series-title":"Nonparametric Techniques in Statistical Inference (Proc. Symp., Indiana Univ., Bloomington, Ind., 1969)","first-page":"359","article-title":"Combinatorial methods in the theory of order statistics","author":"Tak\u00e1cs","year":"1970"},{"key":"10.1016\/S0304-3975(00)00238-3_BIB31","series-title":"Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Vitter","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T17:33:21Z","timestamp":1733247201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002383"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00238-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}