{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:58:22Z","timestamp":1648929502465},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3669,"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":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00051-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T04:26:12Z","timestamp":1049516772000},"page":"59-86","source":"Crossref","is-referenced-by-count":7,"title":["Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis"],"prefix":"10.1016","volume":"304","author":[{"given":"Guy","family":"Louchard","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00051-3_BIB1","series-title":"Probability Approximations via the Poisson Clumping Heuristic","author":"Aldous","year":"1989"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB2","article-title":"The Theory of Partitions","volume":"Vol. 2","author":"Andrews","year":"1976"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0097-3165(73)90038-1","article-title":"Central and local limit theorems applied to asymptotics enumeration","volume":"15","author":"Bender","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB4","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1968"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.2307\/2319133","article-title":"A combinatorial property of q-Eulerian numbers","volume":"82","author":"Carlitz","year":"1975","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01934993","article-title":"Approximate counting","volume":"25","author":"Flajolet","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB7","unstructured":"P. Flajolet, On permutation enumeration via regular languages, Private communication, 2000."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","article-title":"Mellin transforms and asymptotics","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(93)90364-Y","article-title":"General combinatorial schemes","volume":"114","author":"Flajolet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB10","series-title":"Encyclopedia of Mathematics and its Applications","article-title":"Basic hypergeometric series","author":"Gasper","year":"1990"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB11","unstructured":"H.K. Hwang, Th\u00e9or\u00e8mes limites pour les structures al\u00e9atoires et les fonctions arithm\u00e9tiques, Th\u00e8se, Ecole Polytechnique de Palaiseau, 1994."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/eujc.1997.0179","article-title":"On convergence rates in the central limit theorems for combinatorial structures","volume":"19","author":"Hwang","year":"1998","journal-title":"European J. Combin."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB13","series-title":"Markov Chain Models\u2014Rarity and Exponentiality","author":"Keilson","year":"1979"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB14","unstructured":"D.E. Knuth, The Art of Computer Programming, Sorting and Searching, Vol. 3, 2nd Edition, Addison-Wesley, Reading, MA, 1998."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB15","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"issue":"1","key":"10.1016\/S0304-3975(03)00051-3_BIB16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(95)00201-4","article-title":"Probabilistic analysis of some (un)directed animals","volume":"159","author":"Louchard","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<151::AID-RSA4>3.0.CO;2-R","article-title":"Probabilistic analysis of column-convex and directed diagonally-convex animals","volume":"11","author":"Louchard","year":"1997","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199908)15:1<1::AID-RSA1>3.0.CO;2-5","article-title":"Probabilistic analysis of column-convex and directed diagonally-convex animals. II","volume":"15","author":"Louchard","year":"1999","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(03)00051-3_BIB19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-0427(01)00465-4","article-title":"Runs of geometrically distributed random variables","volume":"142","author":"Louchard","year":"2002","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(03)00051-3_BIB20","first-page":"71","article-title":"Probabilistic analysis of Carlitz compositions","volume":"5","author":"Louchard","year":"2002","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00051-3_BIB21","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/18.370149","article-title":"Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm","volume":"41","author":"Louchard","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB22","doi-asserted-by":"crossref","unstructured":"H. Prodinger, Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs, Lecture Notes in Computer Science, Vol. 1776, 2000, pp. 473\u2013482.","DOI":"10.1007\/10719839_47"},{"key":"10.1016\/S0304-3975(03)00051-3_BIB23","series-title":"Real and Complex Analysis","author":"Rudin","year":"1966"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:52:29Z","timestamp":1553395949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0304397503000513"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00051-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}