{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T02:33:54Z","timestamp":1781577234034,"version":"3.54.5"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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":[[1998,2]]},"DOI":"10.1016\/s0012-365x(97)00111-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:38Z","timestamp":1027604198000},"page":"123-142","source":"Crossref","is-referenced-by-count":2,"title":["An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms"],"prefix":"10.1016","volume":"180","author":[{"given":"Pilar","family":"de la Torre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David T.","family":"Kao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00111-8_bib1","article-title":"Analysis of Tries","author":"de la Torre","year":"1987","journal-title":"Ph.D. Thesis, CS-TR-1890, Department of Computer Science, University of Maryland"},{"key":"10.1016\/S0012-365X(97)00111-8_bib2","article-title":"Analysis of tries that store prefixing keys","author":"de la Torre","year":"1987"},{"issue":"2","key":"10.1016\/S0012-365X(97)00111-8_bib3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1006\/jagm.1996.0822","article-title":"A uniform approach to the analysis of trie structures that store prefixing keys","volume":"22","author":"de la Torre","year":"1997","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0012-365X(97)00111-8_bib4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02279819","article-title":"A note on the average depth of tries","volume":"28","author":"Devroye","year":"1982","journal-title":"Computing"},{"key":"10.1016\/S0012-365X(97)00111-8_bib5","series-title":"Proc. 1983 Internat. FCT Conf.","first-page":"141","article-title":"Methods in the analysis of algorithms: evaluation of a recursive partitioning process","volume":"158","author":"Flajolet","year":"1983"},{"key":"10.1016\/S0012-365X(97)00111-8_bib6","first-page":"145","article-title":"Algebraic methods for trie statistics","volume":"25","author":"Flajolet","year":"1985","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"10.1016\/S0012-365X(97)00111-8_bib7","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\/S0012-365X(97)00111-8_bib8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(77)90034-2","article-title":"On the analysis of algorithms for trees","volume":"4","author":"Fran\u00e7on","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"10.1016\/S0012-365X(97)00111-8_bib9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/S0012-365X(97)00111-8_bib10","series-title":"Handbook of Algorithms and Data Structures: In Pascal and C","author":"Gonnet","year":"1991"},{"key":"10.1016\/S0012-365X(97)00111-8_bib11","article-title":"Including prefixes in doubly-chained tries","author":"Knott","year":"1986"},{"key":"10.1016\/S0012-365X(97)00111-8_bib12","series-title":"The Art of Computer Programming, vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0012-365X(97)00111-8_bib13","article-title":"Une Structure Compacte pour Indexer un Fichier Totalment Ordonn\u00e9: \u00e9valuation et mise en ouvre","author":"Plateau","year":"1983","journal-title":"Ph.D. Thesis, University of Paris XI, Orsay"},{"issue":"2","key":"10.1016\/S0012-365X(97)00111-8_bib14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0020-0190(81)90033-8","article-title":"On the average height of trees in digital search and dynamic hashing","volume":"13","author":"Regnier","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(97)00111-8_bib15","article-title":"Set Representation and Set Intersection","author":"Trabb Pardo","year":"1978","journal-title":"Ph.D. Thesis STAN-CS-78-681, Department of Computer Science, Stanford University"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:23Z","timestamp":1556117483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0012365X97001118"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00111-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}