{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:19Z","timestamp":1725487279504},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_27","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"316-331","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Cache-Oblivious Implicit Dictionaries"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious b-trees. In Proc. 41st Symposium on Foundations of Computer Science, pages 399\u2013409, 2000.","DOI":"10.1109\/SFCS.2000.892128"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45465-9_18","volume":"2380","author":"M. A. Bender","year":"2002","unstructured":"Michael A. Bender, Richard Cole, and Rajeev Raman. Exponential structures for efficient cache-oblivious algorithms. Lecture Notes in Computer Science, 2380:195\u2013207, 2002.","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR3","unstructured":"Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual Symposium On Discrete Mathematics, pages 29\u201338, 2002."},{"key":"27_CR4","unstructured":"Gerth St\u00f8lting Brodal, Rolf Fagerberg, and Riko Jacob. Cache-oblivious search trees via trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39\u201348, 2002."},{"issue":"5","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1137\/S0097539795294165","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627\u20131640, 1999.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1145\/146585.146591","volume":"39","author":"A. Fiat","year":"1992","unstructured":"Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel. Nonoblivious hashing. Journal of the ACM, 39(4):764\u2013782, October 1992.","journal-title":"Journal of the ACM"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R. W. Floyd","year":"1964","unstructured":"Robert W. Floyd. Algorithm 245 (TREESORT). Communications of the ACM, 7:701, 1964.","journal-title":"Communications of the ACM"},{"key":"27_CR8","unstructured":"Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n log log n). In Proc. 14th Annual Symposium on Discrete Algorithms, 2003."},{"key":"27_CR9","unstructured":"Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: New results for the dictionary problem. In IEEE Symposium on Foundations of Computer Science (FOCS), 2002."},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G. N. Frederickson","year":"1983","unstructured":"Greg N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80\u201394, 1983.","journal-title":"Journal of the ACM"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"Michael L. Fredman, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538\u2013544, 1984.","journal-title":"J. ACM"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symposium on Foundations of Computer Science, pages 285\u2013297, 1999.","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"27_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-10843-2_34","volume-title":"Proc. Intern. Colloquium on Automata, Languages and Programming","author":"A. Itai","year":"1981","unstructured":"Alon Itai, Alan G. Konheim, and Michael Rodeh. A sparse table implementation of priority queues. Proc. Intern. Colloquium on Automata, Languages and Programming, LNCS 115, pages 417\u2013431, 1981."},{"key":"27_CR14","volume-title":"The Art of Computer Programming III: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth. The Art of Computer Programming III: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973."},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. I. Munro","year":"1986","unstructured":"J. Ian Munro. An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences, 33(1):66\u201374, 1986.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J. I. Munro","year":"1980","unstructured":"J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236\u2013250, 1980.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/S0097539700369909","volume":"31","author":"R. Pagh","year":"2002","unstructured":"Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353\u2013363, 2002.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR18","volume-title":"Cache-oblivious algorithms","author":"H. Prokop","year":"1999","unstructured":"H. Prokop. Cache-oblivious algorithms. Master\u2019s thesis. MIT, Cambridge, MA, 1999."},{"key":"27_CR19","unstructured":"Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In ACM-SIAM Symposium on Discrete Algorithms, pages 233\u2013242, 2002."},{"key":"27_CR20","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. Williams","year":"1964","unstructured":"J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347\u2013348, 1964.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T10:49:01Z","timestamp":1629370141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}