{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T13:25:46Z","timestamp":1672579546543},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T00:00:00Z","timestamp":1459123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s00453-016-0146-7","type":"journal-article","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T12:14:15Z","timestamp":1459167255000},"page":"1097-1105","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Biased Predecessor Search"],"prefix":"10.1007","volume":"76","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","published-online":{"date-parts":[[2016,3,28]]},"reference":[{"key":"146_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM, 54(3):Article 13 (2007)","DOI":"10.1145\/1236457.1236460"},{"issue":"2","key":"146_CR2","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 382(2), 86\u201396 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"146_CR3","doi-asserted-by":"crossref","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. 65(1), 38\u201372 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"146_CR4","unstructured":"Belazzougui, D., Kaporis, A.C., Spirakis,P.G.: Random input helps searching predecessors. arXiv:1104.4353 (2011)"},{"issue":"3","key":"146_CR5","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"SW Bent","year":"1985","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM J. Comput. 14(3), 545\u2013568 (1985)","journal-title":"SIAM J. Comput."},{"key":"146_CR6","doi-asserted-by":"crossref","unstructured":"Bose, P., Howat, J., Morin, A.: Distribution-sensitive dictionary with low space overhead. In Proceedings of the 11th International Symposium on Algorithms and Data Structures (WADS 2009), LNCS 5664, pp. 110\u2013118 (2009)","DOI":"10.1007\/978-3-642-03367-4_10"},{"key":"146_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":"146_CR8","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/s00453-002-0935-z","volume":"33","author":"GS Brodal","year":"2002","unstructured":"Brodal, G.S., Markis, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Optimal solutions for the temporal precedence problem. Algorithmica 33(4), 494\u2013510 (2002)","journal-title":"Algorithmica"},{"issue":"1","key":"146_CR9","first-page":"295","volume":"15","author":"DB Johnson","year":"1981","unstructured":"Johnson, D.B.: A priority queue in which initialization and queue operations take $$O(\\log \\log D)$$ O ( log log D ) time. Theory Comput. Syst. 15(1), 295\u2013309 (1981)","journal-title":"Theory Comput. Syst."},{"key":"146_CR10","doi-asserted-by":"crossref","unstructured":"Kaporis, A., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K., Zaroliagis, C.: Improved bounds for finger search on a RAM. In ESA \u201903: Proceedings of the 11th Annual European Symposium on Algorithms, LNCS 2832, pp. 325\u2013336 (2003)","DOI":"10.1007\/978-3-540-39658-1_31"},{"issue":"1","key":"146_CR11","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Inf. 1(1), 14\u201325 (1971)","journal-title":"Acta Inf."},{"issue":"4","key":"146_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees. Acta Inf. 5(4), 287\u2013295 (1975)","journal-title":"Acta Inf."},{"issue":"4","key":"146_CR13","doi-asserted-by":"crossref","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 \\log N)$$ O ( log log N ) time and $$O(n)$$ O ( n ) space. Inf. Process. Lett. 35(4), 183\u2013189 (1990)","journal-title":"Inf. Process. Lett."},{"key":"146_CR14","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Time\u2013space trade-offs for predecessor search. In STOC \u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 232\u2013240 (2006)","DOI":"10.1145\/1132516.1132551"},{"issue":"3","key":"146_CR15","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"146_CR16","doi-asserted-by":"crossref","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. 6(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"146_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space $$\\varTheta (\\log \\log N)$$ \u0398 ( log log N ) . Inf. Process. Lett. 17(2), 81\u201384 (1983)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0146-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0146-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0146-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0146-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:24Z","timestamp":1559072844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0146-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,28]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0146-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,28]]}}}