{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:04:17Z","timestamp":1743005057137,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_17","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"209-222","source":"Crossref","is-referenced-by-count":2,"title":["A Unifying Property for Distribution-Sensitive Priority Queues"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]},{"given":"Arash","family":"Farzan","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. Bdoiu","year":"2007","unstructured":"Bdoiu, 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"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36136-7_20","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2002","unstructured":"Brodal, G.S., Fagerberg, R.: Funnel Heap - a Cache Oblivious Priority Queue. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 219\u2013228. Springer, Heidelberg (2002)"},{"key":"17_CR3","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: Finger Searching. SIAM Journal on Computing\u00a030, 44\u201385 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0314(3), 459\u2013466 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"17_CR5","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 Foundation of Computer Science\u00a017(6), 1455\u20131466 (2006)","journal-title":"International Journal of Foundation of Computer Science"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M.L. Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The Pairing Heap: a New Form of Self-adjusting Heap. Algorithmica\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"key":"17_CR7","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. Lacono","year":"2000","unstructured":"Lacono, 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":"17_CR8","unstructured":"Iacono, J.: Distribution-sensitive Data Structures. Ph.D. thesis, Rutgers, The state University of New Jersey, New Brunswick, New Jersey (2001)"},{"issue":"1","key":"17_CR9","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"},{"issue":"3","key":"17_CR10","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":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Sequential Access in Splay Trees Takes Linear Time. Combinatorica\u00a05(4), 367\u2013378 (1985)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:46:43Z","timestamp":1555379203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}