{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:28:10Z","timestamp":1745947690072,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238201","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"271-282","source":"Crossref","is-referenced-by-count":11,"title":["The cost of cache-oblivious searching"],"prefix":"10.1109","author":[{"given":"M.A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.S.","family":"Brodal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Simai He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Haodung Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Iacono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Lopez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"39","article-title":"Cache oblivious search trees via binary trees of small height","author":"brodal","year":"2002","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithm (SODA '06)"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"},{"key":"17","first-page":"426","article-title":"Cache oblivious distribution sweeping","author":"brodal","year":"2002","journal-title":"Proc 29th International Colloquium on Automata Languages and Programming (ICALP) Volume 2380 of LNCS"},{"key":"36","first-page":"75","article-title":"Preserving order in a forest in less than logarithmic time","author":"van emde boas","year":"1975","journal-title":"Proc 40th Annu Symp Found Comput Sci (FOCS)"},{"key":"18","first-page":"219","article-title":"Funnel heap - A cache oblivious priority queue","author":"brodal","year":"2002","journal-title":"Proc 13th Ann International Symp on Algorithms and Computation (ISAAC) Volume 2518 of LNCS"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602225"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.014"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1969.1162042"},{"key":"16","first-page":"297","article-title":"An analysis of dag-consistent distributed shared-memory algorithms","author":"blumofe","year":"1996","journal-title":"Proc of the 8th Ann ACM Symp on Parallel Algorithms and Architectures (SPAA)"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185207"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_18"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892128"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90031-X"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_16"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_18"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"article-title":"Cache-oblivious algorithms and data structures","year":"2002","author":"demaine","key":"20"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185208"},{"key":"22","first-page":"326","article-title":"I\/O complexity: The red-blue pebble game","author":"hong","year":"1981","journal-title":"Proc Ann ACM Symp Theory of Computing (STOC)"},{"key":"23","volume":"1","author":"knuth","year":"1997","journal-title":"The Art of Computer Programming Fundamental Algorithms"},{"key":"24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-36574-5_9","article-title":"Cache oblivious algorithms","author":"kumar","year":"2003","journal-title":"Algorithms for Memory Hierarchies LNCS 2625"},{"article-title":"I\/O efficient construction of Voronoi diagrams","year":"2002","author":"kumar","key":"25"},{"key":"26","first-page":"78","article-title":"A comparison of cache aware and cache oblivious static search trees using program instrumentation","author":"ladner","year":"2002","journal-title":"Algorithm Design to Robust and Efficient Software Volume 2547 of LNCS"},{"key":"27","first-page":"613","article-title":"Cache performance analysis of traversals and random accesses","author":"ladner","year":"1999","journal-title":"Proc 5th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0985"},{"article-title":"Cache oblivious algorithms","year":"1999","author":"prokop","key":"29"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.31"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28428"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814599"},{"key":"1","first-page":"237","article-title":"On cache-oblivious multidimensional range searching","author":"agarwal","year":"2003","journal-title":"Proc 19th ACM Symp on Comp Geom (SOCG)"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44688-5_6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548514"},{"article-title":"Efficient tree layout in a multilevel memory hierarchy","year":"2002","author":"alstrup","key":"6"},{"key":"32","first-page":"270","article-title":"Extending the Hong-Kong model to memory hierachies","author":"savage","year":"1995","journal-title":"Proc of the 1st Ann International Conference on Computing and Combinatorics Volume 959 of Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185206"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/2.268881"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509950"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0071-1"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238201.pdf?arnumber=1238201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:05:25Z","timestamp":1497585925000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238201\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238201","relation":{},"subject":[]}}