{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T10:44:12Z","timestamp":1693392252498},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":7259,"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":[[1993,9]]},"DOI":"10.1016\/0012-365x(93)90572-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"149-159","source":"Crossref","is-referenced-by-count":47,"title":["How to select a loser"],"prefix":"10.1016","volume":"120","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90572-B_BIB1","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(93)90572-B_BIB2","series-title":"Handbook of Theoretical Computer Science (Algorithms and Complexity)","article-title":"Average-Case Analysis of Algorithms and Data Structures","author":"Flajolet","year":"1990"},{"key":"10.1016\/0012-365X(93)90572-B_BIB3","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0012-365X(93)90572-B_BIB4","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(93)90572-B_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIT.1985.1057013","article-title":"Q-ary Collision Resolution Algorithms in Random-Access Systems with Free or Blocked Channel Access","volume":"31","author":"Mathys","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90572-B_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/0608021","article-title":"Solution of a linear recurrence equation arising in the analysis of some algorithms","volume":"8","author":"Szpankowski","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(93)90572-B_BIB7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(88)90137-8","article-title":"The evaluation of an alternative sum with applications to the analysis of some data structures","volume":"28","author":"Szpankowski","year":"1988","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390572B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390572B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:49Z","timestamp":1555134949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390572B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0012365X9390572B"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90572-b","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}