{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:03:31Z","timestamp":1648983811316},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established. Experiments oonducted by us show that the supernode structures proposed by us use less space than do the corresponding one-element-per-node versions and also take less time for the standard dictionary operations: search, insert and delete. <\/jats:p>","DOI":"10.1142\/s0129054103001844","type":"journal-article","created":{"date-parts":[[2003,7,24]],"date-time":"2003-07-24T07:23:50Z","timestamp":1059031430000},"page":"465-490","source":"Crossref","is-referenced-by-count":5,"title":["Supernode Binary Search Trees"],"prefix":"10.1142","volume":"14","author":[{"given":"Haejae","family":"Jung","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, Fl. 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, Fl. 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham R.","year":"1990"},{"key":"rf2","volume-title":"Fundamentals of Data Structures in C++","author":"Horowitz E.","year":"1995"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5686"},{"key":"rf5","volume-title":"The Art of Computer Programming, Volume 3, Sorting and Searching","author":"Knuth D.","year":"1998"},{"key":"rf6","volume-title":"Data Structures, Algorithms, and Applications in Java","author":"Sahni S.","year":"2000"},{"key":"rf7","volume-title":"Algorithms in C++","author":"Sedgewick R.","year":"1992"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:26Z","timestamp":1565123906000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0129054103001844"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001844","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}