{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:19Z","timestamp":1725570439925},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_14","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"133-144","source":"Crossref","is-referenced-by-count":0,"title":["Unit-Time Predecessor Queries on Massive Data Sets"],"prefix":"10.1007","author":[{"given":"Andrej","family":"Brodnik","sequence":"first","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, A., Miltersen, P.B., Riis, S., Thorup, M.: Static dictionaries on AC 0 rams: Query time $\\Theta(\\sqrt{\\log n\/\\log \\log n})$ is necessary and sufficient. In: FOCS, pp. 441\u2013450 (1996)","DOI":"10.7146\/brics.v4i14.21678"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica\u00a01(3), 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"issue":"1","key":"14_CR4","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. J. Comput. Syst. Sci.\u00a065(1), 38\u201372 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Demaine, E.D., Fineman, J.T., Iacono, J., Langerman, S., Munro, J.I.: Cache-oblivious dynamic dictionaries with optimal update\/query tradeoff. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, January 17-19, pp. 1448\u20131456 (2010)","DOI":"10.1137\/1.9781611973075.117"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Brodnik, A., Carlsson, S., Fredman, M.L., Karlsson, J., Munro, J.I.: Worst case constant time priority queue. Journal of Systems and Software, 249\u2013259 (2005)","DOI":"10.1016\/j.jss.2004.09.002"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer a uf der Heide, F., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput.\u00a023, 738\u2013761 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00224-004-1195-x","volume":"38","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst.\u00a038(2), 229\u2013248 (2005)","journal-title":"Theory Comput. Syst."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Fredman, M.L., Saks, M.E.: The cell probe complexity of dynamic data structures. In: STOC, pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"key":"14_CR10","unstructured":"Leben, R., Mileti\u0107, M., \u0160pegel, M., Trost, A., Brodnik, A., Karlsson, J.: Design of a high performance memory module on pc100. In: Proceedings Electrotechnical and Computer Science Conference, Portoro\u017e, Slovenia, vol.\u00a0A, pp. 75\u201378 (1999)"},{"key":"14_CR11","unstructured":"Miltersen, P.B.: Cell probe complexity \u2014 a survey. In: Advances in Data Structures (1999)"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R. Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms\u00a051(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Seeger, B., Larson, P.-\u00c5.: Multi-disk b-trees. In: SIGMOD Conference, pp. 436\u2013445 (1991)","DOI":"10.1145\/115790.115862"},{"key":"14_CR14","unstructured":"Stallone, S.: First blood. United Artists (1982)"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"J.S. Vitter","year":"2006","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science\u00a02(4), 305\u2013474 (2006)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"2\/3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory i: Two-level memories. Algorithmica\u00a012(2\/3), 110\u2013147 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:20Z","timestamp":1559836160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}