{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T21:04:18Z","timestamp":1710363858974},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,31]],"date-time":"2013-05-31T00:00:00Z","timestamp":1369958400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00236-013-0180-8","type":"journal-article","created":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T06:48:42Z","timestamp":1369896522000},"page":"289-295","source":"Crossref","is-referenced-by-count":3,"title":["On the hierarchy of distribution-sensitive properties for data structures"],"prefix":"10.1007","volume":"50","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Arash","family":"Farzan","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,31]]},"reference":[{"key":"180_CR1","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R.: Funnel heap\u2014a cache oblivious priority queue. In: Proceedings of the 13th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2518, pp. 219\u2013228. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36136-7_20"},{"issue":"2","key":"180_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M B\u01cedoiu","year":"2007","unstructured":"B\u01cedoiu, 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."},{"key":"180_CR3","doi-asserted-by":"crossref","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: finger searching. SIAM J. Comput. 30, 44\u201385 (2000)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"180_CR4","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.tcs.2004.01.019","volume":"314","author":"A Elmasry","year":"2004","unstructured":"Elmasry, A.: On the sequential access theorem and dequeue conjecture for splay trees. Theor. Comput. Sci. 314(3), 459\u2013466 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"180_CR5","doi-asserted-by":"crossref","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. Int. J. Found. Comput. Sci. 17(6), 1455\u20131466 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"180_CR6","doi-asserted-by":"crossref","unstructured":"Elmasry, A., Iacono, J., Farzan, A.: A unifying property for distribution-sensitive priority queues. In: Proceedings of the 22nd International Workshop on Combinatorial Algorithms. Lecture Notes in Computer Science, vol. 7056, pp. 209\u2013222. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25011-8_17"},{"issue":"1","key":"180_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/174644.174645","volume":"41","author":"MJ Fischer","year":"1994","unstructured":"Fischer, M.J., Paterson, M.: Fishspear: a priority queue algorithm. J. ACM 41(1), 3\u201330 (1994)","journal-title":"J. ACM"},{"key":"180_CR8","doi-asserted-by":"crossref","unstructured":"Iacono, J.: Improved upper bounds for pairing heaps. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 1851, pp. 32\u201345. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44985-X_5"},{"key":"180_CR9","unstructured":"Iacono, J.: Distribution-sensitive data structures. Ph.D. Thesis, Rutgers, The state University of New Jersey, New Brunswick (2001)"},{"issue":"1","key":"180_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00453-004-1139-5","volume":"42","author":"J Iacono","year":"2005","unstructured":"Iacono, J., Langerman, S.: Queaps. Algorithmica 42(1), 49\u201356 (2005)","journal-title":"Algorithmica"},{"key":"180_CR11","volume-title":"The Mathematical Theory of Communication","author":"C Shannon","year":"1949","unstructured":"Shannon, C., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Urbana (1949)"},{"issue":"3","key":"180_CR12","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"},{"key":"180_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511817106","volume-title":"The Cauchy\u2013Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities","author":"JM Steele","year":"2004","unstructured":"Steele, J.M.: The Cauchy\u2013Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press, New York (2004)"},{"issue":"4","key":"180_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Sequential access in splay trees takes linear time. Combinatorica 5(4), 367\u2013378 (1985)","journal-title":"Combinatorica"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0180-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0180-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0180-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T03:38:18Z","timestamp":1563075498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0180-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,31]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0180-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,31]]}}}