{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:05Z","timestamp":1759638725381},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1016\/0020-0190(81)90033-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"64-66","source":"Crossref","is-referenced-by-count":28,"title":["On the average height of trees in digital search and dynamic hashing"],"prefix":"10.1016","volume":"13","author":[{"given":"Mireille","family":"Regnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90033-8_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing \u2014 A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0190(81)90033-8_BIB2","first-page":"207","article-title":"Exploring binary trees and other simple trees","author":"Flajolet","year":"1980","journal-title":"21st IEEE FOCS Symposium"},{"key":"10.1016\/0020-0190(81)90033-8_BIB3","unstructured":"G. Gonnet, Expected length of the longest probe sequence in hashing, J. ACM (to appear)."},{"key":"10.1016\/0020-0190(81)90033-8_BIB4","unstructured":"D. Knuth, The Art of Computer Programming, Vol. 3, section 6.2 (Addison-Wesley, Reading, MA)."},{"key":"10.1016\/0020-0190(81)90033-8_BIB5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0020-0190(81)90033-8_BIB6","article-title":"Hachage virtuel","volume":"VI","author":"Litwin","year":"1979","journal-title":"Th\u00e8se de Doctorat d'Etat"},{"key":"10.1016\/0020-0190(81)90033-8_BIB7","first-page":"151","article-title":"The height of binary search trees","volume":"11","author":"Robson","year":"1979","journal-title":"Austral. Comput. J."},{"issue":"2","key":"10.1016\/0020-0190(81)90033-8_BIB8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0020-0190(80)90008-3","article-title":"A note on the analysis of extensible hashing","volume":"11","author":"Yao","year":"1980","journal-title":"Information Processing Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900338?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081900338?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:53:07Z","timestamp":1555073587000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081900338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["0020019081900338"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90033-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}