{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:25:07Z","timestamp":1743153907514,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":27,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_62","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"123-126","source":"Crossref","is-referenced-by-count":0,"title":["Cache-Oblivious Model"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Fagerberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1_62","first-page":"237","volume-title":"Proc. 19th ACM Symposium on Computational Geometry","author":"P.K. Agarwal","year":"2003","unstructured":"Agarwal, P.K., Arge, L., Danner, A., Holland\u2010Minkley, B.: Cache\u2010oblivious data structures for orthogonal range searching. In: Proc. 19th ACM Symposium on Computational Geometry, pp.\u00a0237\u2013245. ACM, New York (2003)"},{"issue":"9","key":"62_CR2_62","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"62_CR3_62","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-0005-6_9","volume-title":"Handbook of Massive Data Sets","author":"L. Arge","year":"2002","unstructured":"Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp.\u00a0313\u2013358. Kluwer Academic Publishers, Boston (2002)"},{"key":"62_CR4_62","first-page":"268","volume-title":"Proc. 34th Annual ACM Symposium on Theory of Computing","author":"L. Arge","year":"2002","unstructured":"Arge, L., Bender, M.A., Demaine, E.D., Holland\u2010Minkley, B., Munro, J.I.: Cache\u2010oblivious priority queue and graph algorithm applications. In: Proc. 34th Annual ACM Symposium on Theory of Computing, pp.\u00a0268\u2013276. ACM, New York (2002)"},{"key":"62_CR5_62","volume-title":"Handbook on Data Structures and Applications","author":"L. Arge","year":"2005","unstructured":"Arge, L., Brodal, G.S., Fagerberg, R.: Cache\u2010oblivious data structures. In: Mehta, D., Sahni, S. (eds.) Handbook on Data Structures and Applications. CRC Press, Boca Raton (2005)"},{"key":"62_CR6_62","first-page":"160","volume-title":"Proc. 21st Annual ACM Symposium on Computational Geometry","author":"L. Arge","year":"2005","unstructured":"Arge, L., Brodal, G.S., Fagerberg, R., Laustsen, M.: Cache\u2010oblivious planar orthogonal range searching and counting. In: Proc. 21st Annual ACM Symposium on Computational Geometry, pp.\u00a0160\u2013169. ACM, New York (2005)"},{"key":"62_CR7_62","first-page":"170","volume-title":"Symposium on Computational Geometry","author":"L. Arge","year":"2005","unstructured":"Arge, L., de Berg, M., Haverkort, H.J.: Cache\u2010oblivious R-trees. In: Symposium on Computational Geometry, pp.\u00a0170\u2013179. ACM, New York (2005)"},{"key":"62_CR8_62","first-page":"158","volume-title":"Symposium on Computational Geometry","author":"L. Arge","year":"2006","unstructured":"Arge, L., Zeh, N.: Simple and semi-dynamic structures for cache\u2010oblivious planar orthogonal range searching. In: Symposium on Computational Geometry, pp.\u00a0158\u2013166. ACM, New York (2006)"},{"key":"62_CR9_62","first-page":"139","volume-title":"Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461","author":"M. Bender","year":"2002","unstructured":"Bender, M., Cole, R., Demaine, E., Farach\u2010Colton, M.: Scanning and traversing: Maintaining data for traversals in a\u00a0memory hierarchy. In: Proc. 10th Annual European Symposium on Algorithms. LNCS, vol.\u00a02461, pp.\u00a0139\u2013151. Springer, Berlin (2002)"},{"key":"62_CR10_62","first-page":"195","volume-title":"Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 2380","author":"M. Bender","year":"2002","unstructured":"Bender, M., Cole, R., Raman, R.: Exponential structures for cache\u2010oblivious algorithms. In: Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol.\u00a02380, pp.\u00a0195\u2013207. Springer, Berlin (2002)"},{"key":"62_CR11_62","first-page":"165","volume-title":"Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461","author":"M. Bender","year":"2002","unstructured":"Bender, M., Demaine, E., Farach\u2010Colton, M.: Efficient tree layout in a\u00a0multilevel memory hierarchy. In: Proc. 10th Annual European Symposium on Algorithms. LNCS, vol.\u00a02461, pp.\u00a0165\u2013173. Springer, Berlin (2002). Full version at http:\/\/arxiv.org\/abs\/cs\/0211010"},{"key":"62_CR12_62","first-page":"271","volume-title":"Proc. 44th Annual IEEE Symposium on Foundations of Computer Science","author":"M.A. Bender","year":"2003","unstructured":"Bender, M.A., Brodal, G.S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J., L\u00f3pez-Ortiz, A.: The cost of cache\u2010oblivious searching. In: Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pp.\u00a0271\u2013282. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"62_CR13_62","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/SFCS.2000.892128","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Demaine, E.D., Farach\u2010Colton, M.: Cache\u2010oblivious B-trees. In: 41st Annual Symposium on Foundations of Computer Science, pp.\u00a0399\u2013409. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"62_CR14_62","first-page":"3","volume-title":"Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol. 3111","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S.: Cache\u2010oblivious algorithms and data structures. In: Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol.\u00a03111, pp.\u00a03\u201313. Springer, Berlin (2004)"},{"key":"62_CR15_62","first-page":"426","volume-title":"Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 2380","author":"G.S. Brodal","year":"2002","unstructured":"Brodal, G.S., Fagerberg, R.: Cache oblivious distribution sweeping. In: Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol.\u00a02380, pp.\u00a0426\u2013438. Springer, Berlin (2002)"},{"key":"62_CR16_62","first-page":"307","volume-title":"Proc. 35th Annual ACM Symposium on Theory of Computing","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Fagerberg, R.: On the limits of cache\u2010obliviousness. In: Proc. 35th Annual ACM Symposium on Theory of Computing, pp.\u00a0307\u2013315. ACM, New York (2003)"},{"key":"62_CR17_62","first-page":"480","volume-title":"Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol. 3111","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Fagerberg, R., Meyer, U., Zeh, N.: Cache\u2010oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol.\u00a03111, pp.\u00a0480\u2013492. Springer, Berlin (2004)"},{"key":"62_CR18_62","volume-title":"Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"R.A. Chowdhury","year":"2004","unstructured":"Chowdhury, R.A., Ramachandran, V.: Cache\u2010oblivious shortest paths in graphs using buffer heap. In: Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York (2004)"},{"key":"62_CR19_62","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/1109557.1109622","volume-title":"Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R.A. Chowdhury","year":"2006","unstructured":"Chowdhury, R.A., Ramachandran, V.: Cache\u2010oblivious dynamic programming. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0591\u2013600. ACM-SIAM, New York (2006)"},{"key":"62_CR20_62","unstructured":"Demaine, E.D.: Cache\u2010oblivious algorithms and data structures. In: Proc. EFF summer school on massive data sets, LNCS. Springer, Berlin. To appear. Online version at http:\/\/theory.csail.mit.edu\/edemaine\/papers\/BRICS2002\/"},{"key":"62_CR21_62","first-page":"305","volume-title":"Proc. 13th Annual European Symposium on Algorithms. LNCS, vol. 3669","author":"A. Farzan","year":"2005","unstructured":"Farzan, A., Ferragina, P., Franceschini, G., Munro, J.I.: Cache\u2010oblivious comparison-based algorithms on multisets. In: Proc. 13th Annual European Symposium on Algorithms. LNCS, vol.\u00a03669, pp.\u00a0305\u2013316. Springer, Berlin (2005)"},{"key":"62_CR22_62","first-page":"285","volume-title":"40th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Frigo","year":"1999","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache oblivious algorithms. In: 40th Annual IEEE Symposium on Foundations of Computer Science, pp.\u00a0285\u2013298. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"62_CR23_62","first-page":"563","volume-title":"Proc. 32nd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 3580","author":"H. Jampala","year":"2005","unstructured":"Jampala, H., Zeh, N.: Cache\u2010oblivious planar shortest paths. In: Proc. 32nd International Colloquium on Automata, Languages, and Programming. LNCS, vol.\u00a03580, pp.\u00a0563\u2013575. Springer, Berlin (2005)"},{"volume-title":"Algorithms for Memory Hierarchies. LNCS, vol. 2625","year":"2003","key":"62_CR24_62","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625. Springer, Berlin (2003)"},{"key":"62_CR25_62","unstructured":"Prokop, H.: Cache\u2010oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science (1999)"},{"issue":"2","key":"62_CR26_62","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: Dealing with MASSIVE data. ACM Comput. Surv. 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surv."},{"key":"62_CR27_62","volume-title":"Handbook on Data Structures and Applications","author":"J.S. Vitter","year":"2005","unstructured":"Vitter, J.S.: Geometric and spatial data structures in external memory. In: Mehta, D., Sahni, S. (eds.) Handbook on Data Structures and Applications. CRC Press, Boca Raton (2005)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:09:53Z","timestamp":1662170993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_62"}},"subtitle":["1999; Frigo, Leiserson, Prokop, Ramachandran"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_62","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}