{"id":"https://openalex.org/W3528745","doi":null,"title":"Cache-Oblivious Algorithms and Data Structures","display_name":"Cache-Oblivious Algorithms and Data Structures","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W3528745","mag":"3528745"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.3942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.3942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/MassiveData02/notes/demaine.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703","observed_orcids":["https://orcid.org/0000-0003-3803-5703","https://orcid.org/0000-0002-9062-4241"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0003-3803-5703","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083684609"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.3764,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.95354523,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8759999871253967,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8759999871253967,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.052000001072883606,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.021400000900030136,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cache-oblivious-algorithms","display_name":"cache-oblivious algorithms","score":0.9980000257492065},{"id":"https://openalex.org/keywords/cache-oblivious-data-structures","display_name":"cache-oblivious data structures","score":0.9980000257492065},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.6980000138282776},{"id":"https://openalex.org/keywords/secondary-storage","display_name":"external memory","score":0.8259999752044678}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8444278240203857},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7565689086914062},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.6863550543785095},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6121588945388794},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5892739295959473},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5409721732139587},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4808860123157501},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.4651623070240021},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.41886985301971436},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.41372695565223694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4095500707626343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37024229764938354},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.3942","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.3942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/MassiveData02/notes/demaine.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.615.898","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.615.898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://cs.uwaterloo.ca/~imunro/cs840/DemaineCache.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.1230","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.1230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwaterloo.ca/~imunro/cs840/DemaineCOSurvey.pdf","raw_type":"text"},{"id":"mag:3528745","doi":null,"is_oa":false,"landing_page_url":"http://ce.sharif.edu/courses/91-92/1/ce787-1/resources/root/cache%20oblivious%20algorithms%20and%20data%20structures.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1497812785","https://openalex.org/W1555915743","https://openalex.org/W1568228897","https://openalex.org/W1577072106","https://openalex.org/W1591568670","https://openalex.org/W1592580490","https://openalex.org/W1768637848","https://openalex.org/W1972501001","https://openalex.org/W1996578733","https://openalex.org/W1996641400","https://openalex.org/W2007768252","https://openalex.org/W2022117185","https://openalex.org/W2038142281","https://openalex.org/W2038687478","https://openalex.org/W2041645394","https://openalex.org/W2046441184","https://openalex.org/W2052196304","https://openalex.org/W2074286662","https://openalex.org/W2083576929","https://openalex.org/W2090747326","https://openalex.org/W2091782827","https://openalex.org/W2102467006","https://openalex.org/W2105156747","https://openalex.org/W2130055503","https://openalex.org/W2138145917","https://openalex.org/W2152506638","https://openalex.org/W2336485197","https://openalex.org/W2582697902","https://openalex.org/W2604476026"],"related_works":["https://openalex.org/W6903776985","https://openalex.org/W2475955799","https://openalex.org/W1145103903","https://openalex.org/W2039787998","https://openalex.org/W2185118258","https://openalex.org/W7098717437","https://openalex.org/W7098889399","https://openalex.org/W7098334347","https://openalex.org/W4233002504","https://openalex.org/W123924977"],"abstract_inverted_index":{"A":[0],"recent":[1,71],"direction":[2],"in":[3,27],"the":[4,15,43,47,98,113,117,123,130],"design":[5],"of":[6,17,42,49,73,97,109,115,126],"cache-efficient":[7],"and":[8,11,25,79,101],"diskefficient":[9],"algorithms":[10,30,78],"data":[12,80,131],"structures":[13,81,93],"is":[14,57],"notion":[16],"cache":[18],"obliviousness,":[19],"introduced":[20],"by":[21],"Frigo,":[22],"Leiserson,":[23],"Prokop,":[24],"Ramachandran":[26],"1999.":[28],"Cache-oblivious":[29],"perform":[31,83],"well":[32,85,89],"on":[33,59],"a":[34,50,53,70],"multilevel":[35],"memory":[36,61],"hierarchy":[37],"without":[38],"knowing":[39,46],"any":[40],"parameters":[41],"hierarchy,":[44],"only":[45],"existence":[48],"hierarchy.":[51],"Equivalently,":[52],"single":[54],"cache-oblivious":[55,77],"algorithm":[56],"efficient":[58],"all":[60],"hierarchies":[62],"simultaneously.":[63],"While":[64],"such":[65],"results":[66,111,128],"might":[67],"seem":[68],"impossible,":[69],"body":[72],"work":[74],"has":[75],"developed":[76],"that":[82],"as":[84,88,90],"or":[86],"nearly":[87],"standard":[91],"external-memory":[92],"which":[94,133],"require":[95],"knowledge":[96],"cache/memory":[99],"size":[100],"block":[102],"transfer":[103],"size.":[104],"Here":[105],"we":[106],"describe":[107],"several":[108],"these":[110,127],"with":[112],"intent":[114],"elucidating":[116],"techniques":[118],"behind":[119],"their":[120],"design.":[121],"Perhaps":[122],"most":[124],"exciting":[125],"are":[129],"structures,":[132],"form":[134],"general":[135],"building":[136],"blocks":[137],"immediately":[138]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}