{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:22Z","timestamp":1725790942724},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_65","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"755-764","source":"Crossref","is-referenced-by-count":0,"title":["Biased Predecessor Search"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Howat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"65_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1236457.1236460","volume":"54","author":"A. Andersson","year":"2007","unstructured":"Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. Journal of the ACM\u00a054(3), Article 13 (2007)","journal-title":"Journal of the ACM"},{"issue":"2","key":"65_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. B\u0103doiu","year":"2007","unstructured":"B\u0103doiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science\u00a0382(2), 86\u201396 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"65_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"},{"key":"65_CR4","unstructured":"Belazzougui, D., Kaporis, A.C., Spirakis, P.G.: Random input helps searching predecessors. arXiv:1104.4353 (2011)"},{"issue":"3","key":"65_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S.W. Bent","year":"1985","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM Journal on Computing\u00a014(3), 545\u2013568 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"65_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-03367-4_10","volume-title":"Algorithms and Data Structures","author":"P. Bose","year":"2009","unstructured":"Bose, P., Howat, J., Morin, P.: A distribution-sensitive dictionary with low space overhead. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 110\u2013118. Springer, Heidelberg (2009)"},{"key":"65_CR7","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Howat, J., Morin, P.: Fast local searches and updates in bounded universes. In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp. 261\u2013264 (2010)"},{"issue":"4","key":"65_CR8","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/s00453-002-0935-z","volume":"33","author":"G.S. Brodal","year":"2002","unstructured":"Brodal, G.S., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Optimal solutions for the temporal precedence problem. Algorithmica\u00a033(4), 494\u2013510 (2002)","journal-title":"Algorithmica"},{"issue":"1","key":"65_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01786986","volume":"15","author":"D.B. Johnson","year":"1981","unstructured":"Johnson, D.B.: A priority queue in which initialization and queue operations take O(log\n                  log\n                  D) time. Theory of Computing Systems\u00a015(1), 295\u2013309 (1981)","journal-title":"Theory of Computing Systems"},{"key":"65_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-39658-1_31","volume-title":"Algorithms - ESA 2003","author":"A.C. Kaporis","year":"2003","unstructured":"Kaporis, A.C., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K., Zaroliagis, C.: Improved bounds for finger search on a RAM. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 325\u2013336. Springer, Heidelberg (2003)"},{"issue":"1","key":"65_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Informatica\u00a01(1), 14\u201325 (1971)","journal-title":"Acta Informatica"},{"issue":"4","key":"65_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K. Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees. Acta Informatica\u00a05(4), 287\u2013295 (1975)","journal-title":"Acta Informatica"},{"issue":"4","key":"65_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","volume":"35","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Bounded ordered dictionaries in O (log\n                  log\n                  N) time and O(n) space. Information Processing Letters\u00a035(4), 183\u2013189 (1990)","journal-title":"Information Processing Letters"},{"key":"65_CR14","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 232\u2013240 (2006)","DOI":"10.1145\/1132516.1132551"},{"issue":"3","key":"65_CR15","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"issue":"3","key":"65_CR16","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. Information Processing Letters\u00a06(3), 80\u201382 (1977)","journal-title":"Information Processing Letters"},{"issue":"2","key":"65_CR17","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 \u03b8(N). Information Processing Letters\u00a017(2), 81\u201384 (1983)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T21:50:37Z","timestamp":1539381037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}