{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:31Z","timestamp":1750694671564,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181891","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"145-154","source":"Crossref","is-referenced-by-count":3,"title":["Implicit B-trees: New results for the dictionary problem"],"prefix":"10.1109","author":[{"given":"G.","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.I.","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"245","article-title":"Should tables be sorted?","volume":"31","author":"yao","year":"1984","journal-title":"J Assoc Comput Mach"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1049\/cp.2010.0478"},{"journal-title":"Managing Gigabytes Compressing and Indexing Documents and Images","year":"1999","author":"witten","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00173-9"},{"key":"14","first-page":"233","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees and multisets","author":"raman","year":"2002","journal-title":"ACM-SIAM SODA"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90037-9"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90018-7"},{"key":"1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"adel'son-vel'skii","year":"1962","journal-title":"Soviet Mathematics Doklady"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90043-7"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322364"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365103"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90022-W"},{"key":"4","article-title":"Compression from the database perspective","author":"chen","year":"0","journal-title":"DIMACS Working Group Meeting on Data Compression in Networks and Applications 2002"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0213020"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181891.pdf?arnumber=1181891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T20:31:54Z","timestamp":1489437114000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181891","relation":{},"subject":[]}}