{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:07:04Z","timestamp":1766178424980,"version":"3.41.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_22","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Tim","family":"Kaler","sequence":"additional","affiliation":[]},{"given":"Quanquan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Sidford","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Yedidia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1240233.1240236","volume":"3","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Retroactive data structures. ACM Transactions on Algorithms 3, 13 (2007). Originally in SODA 2003","journal-title":"ACM Transactions on Algorithms"},{"key":"22_CR2","first-page":"28","volume":"5","author":"Y Giora","year":"2009","unstructured":"Giora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Transactions on Algorithms (TALG) 5, 28 (2009)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"22_CR3","unstructured":"Bentley, J.L.: Solutions to klees rectangle problems. Technical report, Carnegie Mellon University (1977)"},{"key":"22_CR4","unstructured":"Galperin, I., Rivest, R.L.: Scapegoat trees. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete algorithms, pp. 165\u2013174. Society for Industrial and Applied Mathematics (1993)"},{"key":"22_CR5","doi-asserted-by":"publisher","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. Journal of the ACM (JACM) 32, 652\u2013686 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious b-trees. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 399\u2013409. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892128"},{"key":"22_CR7","unstructured":"Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 560\u2013569. IEEE (1996)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"GN Frederickson","year":"1982","unstructured":"Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in $$X+Y$$ and matrices with sorted columns. Journal of Computer and System Sciences 24, 197\u2013208 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Rauh, A., Arce, G.: A fast weighted median algorithm based on quickselect. In: 2010 17th IEEE International Conference on Image Processing (ICIP), pp. 105\u2013108 (2010)","DOI":"10.1109\/ICIP.2010.5651855"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T18:50:19Z","timestamp":1748544619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}