{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:44:23Z","timestamp":1794336263188,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291183","type":"print"},{"value":"9783540319511","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_29","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:46:24Z","timestamp":1128588384000},"page":"305-316","source":"Crossref","is-referenced-by-count":5,"title":["Cache-Oblivious Comparison-Based Algorithms on Multisets"],"prefix":"10.1007","author":[{"given":"Arash","family":"Farzan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Ferragina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianni","family":"Franceschini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-18088-5_40","volume-title":"ICALP Proceedings","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Vitter, J.S.: The I\/O complexity of sorting and related problems. In: ICALP 1987. LNCS, vol.\u00a0267, pp. 467\u2013478. Springer, Heidelberg (1987)"},{"key":"29_CR2","first-page":"285","volume-title":"FOCS Proceedings","author":"M. Frigo","year":"1999","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: FOCS Proceedings, pp. 285\u2013297. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"2","key":"29_CR3","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. Commun. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0205001","volume":"5","author":"I. Munro","year":"1976","unstructured":"Munro, I., Spira, P.: Sorting and searching in multisets. SIAM Journal on Computing\u00a05, 1\u20138 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR5","volume-title":"Proceedings of WADS","author":"L. Arge","year":"1993","unstructured":"Arge, L., Knudsen, M., Larsen, K.: A general lower bound on the I\/O-complexity of comparison-based algorithms. In: Proceedings of WADS. Springer, Heidelberg (1993)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-45465-9_37","volume-title":"Automata, Languages and Programming","author":"F. Brodal","year":"2002","unstructured":"Brodal, F.: Cache oblivious distribution sweeping. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 426. Springer, Heidelberg (2002)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Lecture Notes from the EEF Summer School on Massive Data Sets","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets, BRICS, University of Aarhus, Denmark. LNCS. Springer, Heidelberg (2002)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/SFCS.2000.892128","volume-title":"Annual Symposium on Foundations of Computer Science 2000","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: IEEE (eds.) Annual Symposium on Foundations of Computer Science 2000, pp. 399\u2013409. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming\u00a02, 143\u2013152 (1982)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:26Z","timestamp":1619493206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11561071_29","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11561071","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}