{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T22:24:06Z","timestamp":1764714246992},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0012-365x(95)00141-i","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"253-270","source":"Crossref","is-referenced-by-count":38,"title":["Combinatorics of geometrically distributed random variables: Left-to-right maxima"],"prefix":"10.1016","volume":"153","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00141-I_BIB1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02915448","article-title":"Applications of the theory of records in the study of random trees","volume":"26","author":"Devroye","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0012-365X(95)00141-I_BIB2","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1214\/aoap\/1177005651","article-title":"A limit theory for random skip lists","volume":"2","author":"Devroye","year":"1992","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/0012-365X(95)00141-I_BIB3","first-page":"239","article-title":"Probabilistic languages and random allocations","volume":"Vol. 317","author":"Flajolet","year":"1988"},{"key":"10.1016\/0012-365X(95)00141-I_BIB4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","article-title":"Probabilistic counting algorithms for data base applications","volume":"31","author":"Flajolet","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(95)00141-I_BIB5","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0215054","article-title":"Digital search trees revisited","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00141-I_BIB6","series-title":"Handbook of Theoretical Computer Science","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","volume":"Vol. A","author":"Flajolet","year":"1990"},{"key":"10.1016\/0012-365X(95)00141-I_BIB7","series-title":"Fundamentals of the Average Case Analysis of Particular Algorithms","author":"Kemp","year":"1982"},{"key":"10.1016\/0012-365X(95)00141-I_BIB8","first-page":"117","article-title":"On the analysis of probabilistic counting","volume":"Vol. 1452","author":"Kirschenhofer","year":"1990"},{"key":"10.1016\/0012-365X(95)00141-I_BIB9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02243826","article-title":"A result in order statistics related to probabilistic counting","volume":"51","author":"Kirschenhofer","year":"1993","journal-title":"Computing"},{"key":"10.1016\/0012-365X(95)00141-I_BIB10","first-page":"211","article-title":"How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems, ICALP92","volume":"Vol. 623","author":"Kirschenhofer","year":"1992"},{"key":"10.1016\/0012-365X(95)00141-I_BIB11","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0012-365X(95)00141-I_BIB12","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(95)00141-I_BIB13","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/0012-365X(95)00141-I_BIB14","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/BF01994884","article-title":"Average search and update costs in skip lists","volume":"32","author":"Papadakis","year":"1992","journal-title":"BIT"},{"key":"10.1016\/0012-365X(95)00141-I_BIB15","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","article-title":"Skip lists: a probabilistic alternative to balanced trees","volume":"33","author":"Pugh","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0012-365X(95)00141-I_BIB16","series-title":"Probability Theory and Computer Science","first-page":"125","article-title":"Mathematical analysis of combinatorial algorithms","author":"Sedgewick","year":"1983"},{"key":"10.1016\/0012-365X(95)00141-I_BIB17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02241658","article-title":"Yet another application of a binomial recurrence: order statistics","volume":"43","author":"Szpankowski","year":"1990","journal-title":"Computing"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500141I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500141I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:01Z","timestamp":1556130241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500141I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0012365X9500141I"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00141-i","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}