{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T05:44:20Z","timestamp":1693115060010},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":9177,"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":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90023-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"143-154","source":"Crossref","is-referenced-by-count":12,"title":["Further results on digital search trees"],"prefix":"10.1016","volume":"58","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90023-0_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\/0304-3975(88)90023-0_BIB2","first-page":"108","article-title":"Zur Auswertung gewisser numerischer Reihen mit Hilfe modularer Funktionen","volume":"1262","author":"Kirschenhofer","year":"1987"},{"key":"10.1016\/0304-3975(88)90023-0_BIB3","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(88)90023-0_BIB4","author":"N\u00f6rlund","year":"1954","journal-title":"Vorlesungen \u00fcber Differenzenrechnung"},{"key":"10.1016\/0304-3975(88)90023-0_BIB5","first-page":"399","article-title":"Analysis of a recurrence equation arising in stack-type algorithms for collision detecting channels","author":"Szpankowski","year":"1985","journal-title":"Proc. Internat. Symp. on Computer Networking & Performance Evaluation, Tokyo"},{"key":"10.1016\/0304-3975(88)90023-0_BIB6","doi-asserted-by":"crossref","unstructured":"W. Szpankowski, Some results of v-ary asymmetric tries, J. Algorithms, in press.","DOI":"10.1016\/0196-6774(88)90039-9"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:57Z","timestamp":1555113237000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0304397588900230"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90023-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}