{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:37:20Z","timestamp":1725521840948},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_20","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"219-228","source":"Crossref","is-referenced-by-count":15,"title":["Funnel Heap-A Cache Oblivious Priority Queue"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"9","key":"20_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter. The input\/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116\u20131127, Sept. 1988.","journal-title":"Communications of the ACM"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 9th Annual European Symposium on Algorithms (ESA)","author":"L. Arge","year":"2001","unstructured":"L. Arge. External memory data structures. In Proc. 9th Annual European Symposium on Algorithms (ESA), volume 2161 of LNCS, pages 1\u201329. Springer, 2001."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proc. 34th Ann. ACM Symp. on Theory of Computing, pages 268\u2013276. ACM Press, 2002.","DOI":"10.1145\/509907.509950"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M. Bender, R. Cole, E. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms (ESA), 2002. To appear.","DOI":"10.1007\/3-540-45749-6_16"},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45465-9_18","volume-title":"Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP)","author":"M. Bender","year":"2002","unstructured":"M. Bender, R. Cole, and R. Raman. Exponential structures for cache-oblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 195\u2013207. Springer, 2002."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"M. Bender, E. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms (ESA), 2002. To appear.","DOI":"10.1007\/3-540-45749-6_18"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Ann. Symp. on Foundations of Computer Science, pages 399\u2013409. IEEE Computer Society Press, 2000.","DOI":"10.1109\/SFCS.2000.892128"},{"key":"20_CR9","unstructured":"M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29\u201339, 2002."},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-45465-9_37","volume-title":"Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP)","author":"G. S. Brodal","year":"2002","unstructured":"G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 426\u2013438. Springer, 2002."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 39\u201348, 2002.","DOI":"10.7146\/brics.v8i36.21696"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/174644.174645","volume":"41","author":"M. J. Fischer","year":"1994","unstructured":"M. J. Fischer and M. S. Paterson. Fishspear: A priority queue algorithm. Journal of the ACM, 41(1):3\u201330, 1994.","journal-title":"Journal of the ACM"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285\u2013297. IEEE Computer Society Press, 1999.","DOI":"10.1109\/SFFCS.1999.814600"},{"issue":"2","key":"20_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J. S. Vitter","year":"2001","unstructured":"J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209\u2013271, June 2001.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:29:04Z","timestamp":1557930544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}