{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:33:14Z","timestamp":1725744794057},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402722"},{"type":"electronic","value":"9783642402739"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40273-9_10","type":"book-chapter","created":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T21:20:34Z","timestamp":1376083234000},"page":"133-149","source":"Crossref","is-referenced-by-count":3,"title":["A History of Distribution-Sensitive Data Structures"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"John","family":"Howat","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. Knuth","year":"1971","unstructured":"Knuth, D.: Optimum binary search trees. Acta Informatica\u00a01, 14\u201325 (1971)","journal-title":"Acta Informatica"},{"key":"10_CR2","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 Inf.\u00a05, 287\u2013295 (1975)","journal-title":"Acta Inf."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/0206017","volume":"6","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput.\u00a06(2), 235\u2013239 (1977)","journal-title":"SIAM J. Comput."},{"key":"10_CR4","unstructured":"Bayer, P.: Improved bounds on the cost of optimal and balanced binary search trees. Master\u2019s thesis, MIT (1975)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Fredman, M.L.: Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In: STOC, pp. 240\u2013244 (1975)","DOI":"10.1145\/800116.803774"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell Systems Technical Journal\u00a027, 379\u2013423, 623\u2013565 (1948)","journal-title":"Bell Systems Technical Journal"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-004-1136-8","volume":"42","author":"J. Iacono","year":"2005","unstructured":"Iacono, J.: Key-independent optimality. Algorithmica\u00a042(1), 3\u201310 (2005)","journal-title":"Algorithmica"},{"issue":"3","key":"10_CR8","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":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44985-X_5","volume-title":"Algorithm Theory - SWAT 2000","author":"J. Iacono","year":"2000","unstructured":"Iacono, J.: Improved upper bounds for pairing heaps. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 32\u201345. Springer, Heidelberg (2000)"},{"key":"10_CR11","unstructured":"Bose, P., Dou\u00efeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106\u20131114 (2008)"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-004-1139-5","volume":"42","author":"J. Iacono","year":"2005","unstructured":"Iacono, J., Langerman, S.: Queaps. Algorithmica\u00a042(1), 49\u201356 (2005)","journal-title":"Algorithmica"},{"key":"10_CR13","unstructured":"Iacono, J.: Distribution Sensitive Data Structures. PhD thesis, Rutgers, The State University of New Jersey (2001)"},{"issue":"2","key":"10_CR14","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":"10_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM Journal on Computing\u00a030(1), 44\u201385 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539797326988","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R., Mishra, B., Schmidt, J., Siegel, A.: On the dynamic finger conjecture for splay trees. Part I: Splay Sorting logn-Block Sequences. SIAM Journal on Computing\u00a030(1), 1\u201343 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R. Tarjan","year":"1985","unstructured":"Tarjan, R.: Sequential access in splay trees takes linear time. Combinatorica\u00a05, 367\u2013378 (1985)","journal-title":"Combinatorica"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/s00453-011-9542-1","volume":"63","author":"P. Bose","year":"2012","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Howat, J.: Layered working-set trees. Algorithmica\u00a063(1), 476\u2013489 (2012)","journal-title":"Algorithmica"},{"key":"10_CR19","unstructured":"Derryberry, J.C.: Adapative Binary Search Trees. PhD thesis, Carnegie Mellon University (2009)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-03367-4_18","volume-title":"Algorithms and Data Structures","author":"J.C. Derryberry","year":"2009","unstructured":"Derryberry, J.C., Sleator, D.D.: Skip-splay: Toward achieving the unified bound in the BST model. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 194\u2013205. Springer, Heidelberg (2009)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-13731-0_5","volume-title":"Algorithm Theory - SWAT 2010","author":"P. Bose","year":"2010","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Fagerberg, R.: An o(log log n)-competitive binary search tree with optimal worst-case access times. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 38\u201349. Springer, Heidelberg (2010)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., P\u01cetra\u015fcu, M.: Dynamic optimality\u2014almost. SIAM Journal on Computing\u00a037(1), 240\u2013251 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Wang, C.C., Derryberry, J., Sleator, D.D.: O(loglogn)-competitive dynamic binary search trees. In: SODA 2006: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 374\u2013383 (2006)","DOI":"10.1145\/1109557.1109600"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Andersson, A.A., Thorup, M.: Dynamic ordered sets with exponential search trees. Journal of the ACM\u00a054(3) (2007)","DOI":"10.1145\/1236457.1236460"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0022-0000(03)00013-8","volume":"67","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Lagogiannis, G., Makris, C., Tsakalidis, A., Tsichlas, K.: Optimal finger search trees in the pointer machine. Journal of Computer and System Sciences\u00a067(2), 381\u2013418 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(94)00115-4","volume":"52","author":"P.F. Dietz","year":"1994","unstructured":"Dietz, P.F., Raman, R.: A constant update time finger search tree. Information Processing Letters\u00a052(3), 147\u2013154 (1994)","journal-title":"Information Processing Letters"},{"issue":"6","key":"10_CR27","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"key":"10_CR28","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)"},{"key":"10_CR29","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, 545\u2013568 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"4\/5","key":"10_CR30","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica\u00a016(4\/5), 464\u2013497 (1996)","journal-title":"Algorithmica"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00453-004-1138-6","volume":"42","author":"A. Bagchi","year":"2005","unstructured":"Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica\u00a042, 31\u201348 (2005)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR32","first-page":"295","volume":"15","author":"D.B. Johnson","year":"1981","unstructured":"Johnson, D.B.: A priority queue in which initialization and queue operations take O(loglogD) time. Theory of Computing Systems\u00a015(1), 295\u2013309 (1981)","journal-title":"Theory of Computing Systems"},{"issue":"6","key":"10_CR33","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1142\/S0129054106004510","volume":"17","author":"A. Elmasry","year":"2006","unstructured":"Elmasry, A.: A priority queue with the working-set property. International Journal of Foundations of Computer Science\u00a017(6), 1455\u20131465 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"10_CR34","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0218004","volume":"18","author":"R. Wilber","year":"1989","unstructured":"Wilber, R.: Lower bounds for accessing binary search trees with rotations. SIAM Journal on Computing\u00a018(1), 56\u201367 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10_CR35","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"},{"key":"10_CR36","unstructured":"Belazzougui, D., Kaporis, A., Spirakis, P.: Random input helps searching predecessors. arXiv:1104.4353 (2011)"},{"issue":"1","key":"10_CR37","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.comgeo.2004.01.005","volume":"28","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Proximate point searching. Computational Geometry: Theory and Applications\u00a028(1), 29\u201340 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"10_CR38","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1137\/S0097539704446724","volume":"37","author":"S. Arya","year":"2007","unstructured":"Arya, S., Malamatos, T., Mount, D.M., Wong, K.C.: Optimal expected-case planar point location. SIAM Journal on Computing\u00a037(2), 584\u2013610 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR39","unstructured":"Colette, S., Dujmovi\u0107, V., Iacono, J., Langerman, S., Morin, P.: Distribution-sensitive point location in convex subdivisions. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 912\u2013921 (2008)"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Iacono, J.: A static optimality transformation with applications to planar point location. arXiv:1104.5597 (2011)","DOI":"10.1145\/1998196.1998200"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Iacono, J., Langerman, S.: Proximate planar point location. In: SoCG 2003: Proceedings of the 19th Annual ACM Symposium on Computational Geometry, pp. 220\u2013226 (2003)","DOI":"10.1145\/777792.777826"},{"key":"10_CR42","unstructured":"Derryberry, J., Sheehy, D., Woo, M., Sleator, D.D.: Achieving spatial adaptivity while finding approximate nearest neighbors. In: CCCG 2008: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, pp. 163\u2013166 (2008)"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Howat, J., Morin, P.: Biased range trees. In: SODA 2009: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 486\u2013495 (2009)","DOI":"10.1137\/1.9781611973068.54"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Afshani, P., Barbay, J., Chan, T.M.: Instance-optimal geometric algorithms. In: FOCS 2009: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 129\u2013138 (2009)","DOI":"10.1109\/FOCS.2009.34"},{"key":"10_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-25011-8_17","volume-title":"Combinatorial Algorithms","author":"A. Elmasry","year":"2011","unstructured":"Elmasry, A., Farzan, A., Iacono, J.: A unifying property for distribution-sensitive priority queues. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 209\u2013222. Springer, Heidelberg (2011)"},{"key":"10_CR46","first-page":"1259","volume":"3","author":"G. Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii, G., Landis, E.: An algorithm for the organization of information. Soviet Math. Doklady\u00a03, 1259\u20131263 (1962)","journal-title":"Soviet Math. Doklady"},{"issue":"2","key":"10_CR47","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 \u0398(N). Information Processing Letters\u00a017(2), 81\u201384 (1983)","journal-title":"Information Processing Letters"},{"issue":"1","key":"10_CR48","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"}],"container-title":["Lecture Notes in Computer Science","Space-Efficient Data Structures, Streams, and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40273-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:34:04Z","timestamp":1558006444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40273-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402722","9783642402739"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40273-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}