{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:35:16Z","timestamp":1743035716983,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_26","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"278-289","source":"Crossref","is-referenced-by-count":0,"title":["Minimal Indices for Successor Search"],"prefix":"10.1007","author":[{"given":"Sarel","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshik","family":"Hershcovitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Cohen, S., Fiat, A., Hershcovitch, M., Kaplan, H.: Minimal Indices for Successor Search [Full Vestion], in arXiv.org."},{"issue":"1-2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(98)00172-8","volume":"215","author":"A. Andersson","year":"1999","unstructured":"Andersson, A., Miltersen, P.B., Thorup, M.: Fusion trees can be implemented with AC(0) instructions only. Theor. Comput. Sci.\u00a0215(1-2), 337\u2013344 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/jcss.2002.1822","volume":"65","author":"P. Beame","year":"2002","unstructured":"Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences\u00a065(1), 38\u201372 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"26_CR4","first-page":"3","volume":"16","author":"D. Belazzougui","year":"2011","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Theory and practice of monotone minimal perfect hashing. J. Exp. Algorithmics 16, 3.2 (2011)","journal-title":"J. Exp. Algorithmics"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with o(1) accesses. In: SODA, pp. 785\u2013794 (2009)","DOI":"10.1137\/1.9781611973068.86"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-15775-2_37","volume-title":"Algorithms \u2013 ESA 2010","author":"D. Belazzougui","year":"2010","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Fast prefix search in little space, with applications. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 427\u2013438. Springer, Heidelberg (2010)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-63307-3_80","volume-title":"Algorithms and Data Structures","author":"A. Brodnik","year":"1997","unstructured":"Brodnik, A., Miltersen, P.B., Munro, J.I.: Trans-dichotomous algorithms without multiplication - some upper and lower bounds. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 426\u2013439. Springer, Heidelberg (1997)"},{"key":"26_CR8","unstructured":"Drepper, U.: What every programmer should know about memory (2007), \n                  \n                    http:\/\/lwn.net\/Articles\/250967\/"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: a new data structure for string search in external memory and its applications. J. ACM\u00a046, 236\u2013280 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences\u00a047(3), 424\u2013436 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR11","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. In: FOCS, pp. 719\u2013725 (1990)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-61440-0_149","volume-title":"Automata, Languages and Programming","author":"P.B. Miltersen","year":"1996","unstructured":"Miltersen, P.B.: Lower bounds for static dictionaries on rams with bit operations but no multiplication. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 442\u2013453. Springer, Heidelberg (1996)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 345\u2013356. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-45061-0_29"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: STOC, pp. 232\u2013240 (2006)","DOI":"10.1145\/1132516.1132551"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N. Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Commun. ACM\u00a054(3), 76\u201384 (2011)","journal-title":"Commun. ACM"},{"key":"26_CR16","unstructured":"Thorup, M.: On AC0 implementations of fusion trees and atomic heaps. In: SODA, pp. 699\u2013707 (2003)"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett.\u00a06(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"26_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space t(n). Information Processing Letters\u00a017(2), 81\u201384 (1983)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:27:05Z","timestamp":1578511625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_26"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}