{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T01:17:05Z","timestamp":1697159825309},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1137\/s0097539799356812","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T15:12:06Z","timestamp":1055344326000},"page":"923-964","source":"Crossref","is-referenced-by-count":11,"title":["Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme"],"prefix":"10.1137","volume":"30","author":[{"given":"Charles","family":"Knessl","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"351","reference":[{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00318784"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3069-2"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030209"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005709"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0215054"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030309"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00002-E"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1109\/18.165463"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00298-W"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00167-9"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790189368"},{"key":"R18","first-page":"43","volume":"3","author":"Knessl Charles","year":"1999","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90114-3"},{"key":"R22","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","volume":"21","author":"Louchard G.","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1109\/18.370149"},{"key":"R24","volume-title":"Evolution of random search trees","author":"Mahmoud Hosam","year":"1992"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993000"},{"key":"R27","first-page":"355","volume":"3","author":"R\u00e9nyi A.","year":"1961","journal-title":"Mathematica (Cluj)"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90137-8"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90050-C"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759045"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539799356812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T21:52:35Z","timestamp":1497563555000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/S0097539799356812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S0097539799356812"],"URL":"https:\/\/doi.org\/10.1137\/s0097539799356812","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}