{"id":"https://openalex.org/W1592580490","doi":"https://doi.org/10.1007/3-540-36136-7_20","title":"Funnel Heap-A Cache Oblivious Priority Queue","display_name":"Funnel Heap-A Cache Oblivious Priority Queue","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1592580490","doi":"https://doi.org/10.1007/3-540-36136-7_20","mag":"1592580490"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-36136-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36136-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5111464926","display_name":"Gerth St\u00f8lting Brodai","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodai","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.9994999766349792,"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/T11478","display_name":"Caching and Content Delivery","score":0.998199999332428,"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8972265720367432},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7065197825431824},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.698482096195221},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6832157969474792},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5857274532318115},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.5313361883163452},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5201723575592041},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5170067548751831},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.42843329906463623},{"id":"https://openalex.org/keywords/page-cache","display_name":"Page cache","score":0.41523873805999756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.383746862411499},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.3687572479248047},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.33363741636276245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3258877396583557},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11197617650032043}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8972265720367432},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7065197825431824},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.698482096195221},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6832157969474792},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5857274532318115},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.5313361883163452},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5201723575592041},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5170067548751831},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.42843329906463623},{"id":"https://openalex.org/C36340418","wikidata":"https://www.wikidata.org/wiki/Q7124288","display_name":"Page cache","level":5,"score":0.41523873805999756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.383746862411499},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.3687572479248047},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.33363741636276245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3258877396583557},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11197617650032043}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-36136-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36136-7_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/cb03b080-983b-11da-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/cb03b080-983b-11da-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Fagerberg, R, Bose, P (ed.) & Morin, P (ed.) 2002, Funnel Heap - A Cache Oblivious Priority Queue. in P Bose & P Morin (eds), Algorithms and Computation : 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21\u201323, 2002 Proceedings. Springer, Lecture Notes in Computer Science, vol. 2518, pp. 219-228, International Symposium on Algorithms and Computation, Vancouver, BC, Canada, 21/09/2002. https://doi.org/10.1007/3-540-36136-7_20","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1539221976","https://openalex.org/W1857323784","https://openalex.org/W2017799838","https://openalex.org/W2022117185","https://openalex.org/W2038142281","https://openalex.org/W2046441184","https://openalex.org/W2052196304","https://openalex.org/W2083576929","https://openalex.org/W2087629135","https://openalex.org/W2095875205","https://openalex.org/W2097224604","https://openalex.org/W2098130516","https://openalex.org/W2102467006","https://openalex.org/W2105156747","https://openalex.org/W2138145917","https://openalex.org/W2498714246","https://openalex.org/W2901608006","https://openalex.org/W6674411357"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2535115842","https://openalex.org/W2121191383","https://openalex.org/W1584415117","https://openalex.org/W2116323004","https://openalex.org/W2020176098","https://openalex.org/W2734782074","https://openalex.org/W2546991807","https://openalex.org/W4252570104","https://openalex.org/W1505654810"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}
