{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:56Z","timestamp":1699834016332},"reference-count":4,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9034,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1982,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A function for generating nearly balanced binary search trees from sets of non\u2010random keys is described. This function can be used in hashing organization where collisions are resolved by construction of binary trees. In particular it can be used as the secondary function in the relatively new technique of dynamic hashing.<\/jats:p>","DOI":"10.1002\/spe.4380120206","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T02:35:57Z","timestamp":1163817357000},"page":"163-168","source":"Crossref","is-referenced-by-count":0,"title":["A function for generating nearly balanced binary search trees from sets of non\u2010random keys"],"prefix":"10.1002","volume":"12","author":[{"given":"R. A.","family":"Frost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01931695"},{"key":"e_1_2_1_3_2","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold E. M.","year":"1977"},{"key":"e_1_2_1_4_2","volume-title":"Computer Science Technical Report","author":"Frost R. A.","year":"1981"},{"key":"e_1_2_1_5_2","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1969"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380120206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380120206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:28:16Z","timestamp":1699799296000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380120206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,2]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,2]]}},"alternative-id":["10.1002\/spe.4380120206"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380120206","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,2]]}}}