{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:49:45Z","timestamp":1775515785581,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0304-3975(94)00298-w","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"161-197","source":"Crossref","is-referenced-by-count":62,"title":["Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees"],"prefix":"10.1016","volume":"144","author":[{"given":"Philippe","family":"Jacquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00298-W_BIB1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BF00318784","article-title":"A diffusion limit for a class of random-growing binary trees","volume":"79","author":"Aldous","year":"1988","journal-title":"Probab. Theory Reelated Fields"},{"key":"10.1016\/0304-3975(94)00298-W_BIB2","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1968"},{"key":"10.1016\/0304-3975(94)00298-W_BIB3","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/0304-3975(94)00298-W_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.3240030309","article-title":"Generalized digital trees and their difference-differential equations","volume":"3","author":"Flajolet","year":"1992","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0304-3975(94)00298-W_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\/0304-3975(94)00298-W_BIB6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(93)90364-Y","article-title":"General combinatorial schemas: Gaussian limit distributions and exponential tails","volume":"114","author":"Flajolet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)00298-W_BIB7","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1109\/18.165463","article-title":"The Lempel-Ziv algorithm and message complexity","volume":"38","author":"Gilbert","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB8","article-title":"Contribution de l'Analyse d'Algorithmes a l'Evaluation de Protocoles de Communication","author":"Jacquet","year":"1989","journal-title":"Th\u00e8se Universit\u00e9 de Paris Sud-Orsay"},{"key":"10.1016\/0304-3975(94)00298-W_BIB9","series-title":"Proc. 26th STOC","first-page":"780","article-title":"A functional equation arising in the analysis of algorithms","author":"Jacquet","year":"1994"},{"key":"10.1016\/0304-3975(94)00298-W_BIB10","doi-asserted-by":"crossref","DOI":"10.1137\/S0097539790189368","article-title":"Digital search trees again revisited: the internal path length perspective","volume":"23","author":"Kirschenhofer","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00298-W_BIB11","series-title":"The Art of Computer Programming. Sorting and Searching","author":"Knuth","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(94)00298-W_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","article-title":"Exact and asymptotic distributions in digital and binary search trees","volume":"21","author":"Louchard","year":"1987","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/0304-3975(94)00298-W_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/18.370149","article-title":"Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorith","volume":"41","author":"Louchard","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB15","series-title":"Evolution of Random Search Tree","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0304-3975(94)00298-W_BIB16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/18.108250","article-title":"Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm","volume":"38","author":"Plotnik","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0406016","article-title":"A limiting distribution for the detph in PATRICIA Tries","volume":"6","author":"Rais","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(94)00298-W_BIB18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/18.42197","article-title":"New results on the size of tries","volume":"35","author":"Regnier","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB19","series-title":"Theory of Complex Functions","author":"Remmert","year":"1991"},{"key":"10.1016\/0304-3975(94)00298-W_BIB20","article-title":"Beitr\u00e4ge zur Analyse von Datenstrukturen zur Digitalen Suche","author":"Schachinger","year":"1993","journal-title":"Dissertation Technische Universit\u00e4t Wien"},{"key":"10.1016\/0304-3975(94)00298-W_BIB21","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/18.212281","article-title":"Universal redundancy rates do not exist","volume":"39","author":"Shields","year":"1993","journal-title":"IEEE Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(91)90050-C","article-title":"A characterization of digital search trees from the successful search viewpoint","volume":"85","author":"Szpankowski","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00298-W_BIB23","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/0222070","article-title":"A generalized suffix tree and its (un)expected asymptotic behaviors","volume":"22","author":"Szpankowski","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00298-W_BIB24","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/18.259648","article-title":"Asymptotic properties of data compression and suffix trees","volume":"39","author":"Szpankowski","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB25","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/TIT.1978.1055911","article-title":"Coding theorem for individual sequences","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/0304-3975(94)00298-W_BIB26","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00298-W_BIB27","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400298W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400298W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T22:54:04Z","timestamp":1556319244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400298W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["030439759400298W"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00298-w","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}