{"id":"https://openalex.org/W2063354603","doi":"https://doi.org/10.1137/s0097539703428324","title":"An Optimal Cache\u2010Oblivious Priority Queue and Its Application to Graph Algorithms","display_name":"An Optimal Cache\u2010Oblivious Priority Queue and Its Application to Graph Algorithms","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2063354603","doi":"https://doi.org/10.1137/s0097539703428324","mag":"2063354603"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703428324","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703428324","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5084056010","display_name":"Lars Arge","orcid":null},"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":false,"raw_author_name":"Lars Arge","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068761590","display_name":"Michael A. Bender","orcid":"https://orcid.org/0000-0001-7639-530X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael A. Bender","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071058959","display_name":"Bryan Holland\u2010Minkley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bryan Holland\u2010Minkley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108095454","display_name":"J. Ian Munro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Ian Munro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6562,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93280701,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"6","first_page":"1672","last_page":"1695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7729207277297974},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6731904149055481},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6652865409851074},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5939361453056335},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.583153486251831},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.45724889636039734},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44283345341682434},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4122750163078308},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3930864930152893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3732697069644928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3550630807876587},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1217898428440094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7729207277297974},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6731904149055481},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6652865409851074},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5939361453056335},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.583153486251831},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.45724889636039734},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44283345341682434},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4122750163078308},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3930864930152893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3732697069644928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3550630807876587},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1217898428440094}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539703428324","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703428324","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.7064","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.7064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://db.uwaterloo.ca/~eddemain/papers/BufferTrees_SICOMP/paper.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.3392","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.3392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/%7Ebender/newpub/ArgeBeDe05-sicomp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.2204","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.2204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.au.dk/~large/ioS06/ABDHM.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W64329647","https://openalex.org/W358088974","https://openalex.org/W1510397712","https://openalex.org/W1513982482","https://openalex.org/W1526390868","https://openalex.org/W1526545853","https://openalex.org/W1539221976","https://openalex.org/W1556590257","https://openalex.org/W1562662555","https://openalex.org/W1577072106","https://openalex.org/W1592580490","https://openalex.org/W1600795850","https://openalex.org/W1801456964","https://openalex.org/W1965929361","https://openalex.org/W1979012070","https://openalex.org/W1979219950","https://openalex.org/W1981707203","https://openalex.org/W1986843945","https://openalex.org/W1995040285","https://openalex.org/W2002560134","https://openalex.org/W2006706309","https://openalex.org/W2007768252","https://openalex.org/W2011717090","https://openalex.org/W2012322590","https://openalex.org/W2014866763","https://openalex.org/W2017799838","https://openalex.org/W2017927472","https://openalex.org/W2022117185","https://openalex.org/W2034413563","https://openalex.org/W2034924661","https://openalex.org/W2038142281","https://openalex.org/W2039757598","https://openalex.org/W2041645394","https://openalex.org/W2046441184","https://openalex.org/W2057839002","https://openalex.org/W2058557216","https://openalex.org/W2067661972","https://openalex.org/W2069446854","https://openalex.org/W2077180154","https://openalex.org/W2083576929","https://openalex.org/W2088116875","https://openalex.org/W2090103608","https://openalex.org/W2091782827","https://openalex.org/W2095875205","https://openalex.org/W2097224604","https://openalex.org/W2098130516","https://openalex.org/W2105156747","https://openalex.org/W2117827789","https://openalex.org/W2122403525","https://openalex.org/W2124920620","https://openalex.org/W2132108235","https://openalex.org/W2133914707","https://openalex.org/W2136354771","https://openalex.org/W2138145917","https://openalex.org/W2141883265","https://openalex.org/W2142495779","https://openalex.org/W2161694911","https://openalex.org/W2171038510","https://openalex.org/W2177751887","https://openalex.org/W2185118258","https://openalex.org/W2776089907","https://openalex.org/W2901608006"],"related_works":["https://openalex.org/W2546991807","https://openalex.org/W2274935188","https://openalex.org/W2037904580","https://openalex.org/W2730690135","https://openalex.org/W2109265242","https://openalex.org/W2046128376","https://openalex.org/W2147122795","https://openalex.org/W4312770956","https://openalex.org/W2167303720","https://openalex.org/W57688818"],"abstract_inverted_index":{"We":[0],"develop":[1,107],"an":[2],"optimal":[3],"cache\u2010oblivious":[4,43,103,109],"priority":[5,70,104],"queue":[6,71,105],"data":[7,44,72],"structure,":[8,45],"supporting":[9],"insertion,":[10],"deletion,":[11],"and":[12,22,27,47,82,100],"delete\u2010min":[13],"operations":[14],"in":[15,52,90],"$O(\\frac{1}{B}\\log_{M/B}\\frac{N}{B})$":[16],"amortized":[17],"memory":[18,26,39,68,97],"transfers,":[19],"where":[20],"M":[21,46,81],"B":[23,48],"are":[24,49,86],"the":[25,53,56,93],"block":[28],"transfer":[29],"sizes":[30],"of":[31,36,55,92],"any":[32],"two":[33],"consecutive":[34],"levels":[35],"a":[37,42,87],"multilevel":[38],"hierarchy.":[40],"In":[41],"not":[50],"used":[51],"description":[54],"structure.":[57],"Our":[58],"structure":[59],"is":[60],"as":[61,63],"efficient":[62],"several":[64,108],"previously":[65],"developed":[66],"external":[67,96],"(cache\u2010aware)":[69],"structures,":[73],"which":[74],"all":[75],"rely":[76],"crucially":[77],"on":[78],"knowledge":[79],"about":[80],"B.":[83],"Priority":[84],"queues":[85],"critical":[88],"component":[89],"many":[91],"best":[94],"known":[95],"graph":[98,110],"algorithms,":[99],"using":[101],"our":[102],"we":[106],"algorithms.":[111]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}