{"id":"https://openalex.org/W2016179297","doi":"https://doi.org/10.5555/313852.313883","title":"Worst-case efficient priority queues","display_name":"Worst-case efficient priority queues","alternate_titles":[],"publication_year":1996,"publication_date":"1996-01-28","ids":{"openalex":"https://openalex.org/W2016179297","doi":"https://doi.org/10.5555/313852.313883","mag":"2016179297"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:publications/726c11fc-2563-4233-9a4f-83bf4a909aae","doi":null,"is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/726c11fc-2563-4233-9a4f-83bf4a909aae","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brodal, G S 1996, Worst-case efficient priority queues. in Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, pp. 52-58, 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1996, Atlanta, GE, United States, 28/01/1669.","raw_type":"info:eu-repo/semantics/conferenceObject"},"parent_works":[],"lineage":["https://openalex.org/W2016179297"],"child_works_count":0,"type":"conference-paper","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X","observed_orcids":["https://orcid.org/0000-0001-9054-915X"]},"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":true,"contributor_roles":[],"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Computer Science Department, Aarhus University, Ny Munkegade, DK-8000 \u00c2rhus, C, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, Ny Munkegade, DK-8000 \u00c2rhus, C, Denmark#TAB#","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039943336"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":5.0381,"has_fulltext":false,"cited_by_count":110,"citation_normalized_percentile":{"value":0.98823529,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"58"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8672000169754028,"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.8672000169754028,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07320000231266022,"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/T12288","display_name":"Optimization and Search Problems","score":0.010599999688565731,"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/priority-queues","display_name":"priority queues","score":0.9940000176429749},{"id":"https://openalex.org/keywords/worst-case-time-complexity","display_name":"worst-case time complexity","score":0.7639999985694885},{"id":"https://openalex.org/keywords/decrease-key-operation","display_name":"decrease-key operation","score":0.875},{"id":"https://openalex.org/keywords/vector-spaces","display_name":"vector spaces","score":0.574999988079071},{"id":"https://openalex.org/keywords/data-structure-implementation","display_name":"data structure implementation","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6999500393867493},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6677564382553101},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.47375020384788513},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3581831455230713},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3356765806674957}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pure.atira.dk:publications/726c11fc-2563-4233-9a4f-83bf4a909aae","doi":null,"is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/726c11fc-2563-4233-9a4f-83bf4a909aae","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brodal, G S 1996, Worst-case efficient priority queues. in Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, pp. 52-58, 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1996, Atlanta, GE, United States, 28/01/1669.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2016179297","doi":"https://doi.org/10.5555/313852.313883","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda96.html#Brodal96","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.8133","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.aau.dk/~gerth/Papers/soda96.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1970691969","https://openalex.org/W1987927249","https://openalex.org/W2006820476","https://openalex.org/W2037007500","https://openalex.org/W2043869213","https://openalex.org/W2051283794","https://openalex.org/W2151272762","https://openalex.org/W2163169902","https://openalex.org/W2912714641","https://openalex.org/W3005886874","https://openalex.org/W3198160809","https://openalex.org/W3198470706"],"related_works":["https://openalex.org/W2502477570","https://openalex.org/W98516888","https://openalex.org/W7098356602","https://openalex.org/W10701630","https://openalex.org/W1558090694","https://openalex.org/W322928041","https://openalex.org/W2949890489","https://openalex.org/W1594544869","https://openalex.org/W1609699128","https://openalex.org/W1970691969"],"abstract_inverted_index":{"An":[0],"implementation":[1],"of":[2,55],"priority":[3,57,78,88,97,107,117,127,133,147],"queues":[4,58,118],"is":[5,35,41,156,160],"presented":[6,40],"that":[7],"supports":[8],"the":[9,42,53,63,74,92,131],"operations":[10,68,80],"MakeQueue,":[11],"FindMin,":[12],"Insert,":[13],"Meld":[14],"and":[15,22,24,84,121,129,154],"DecreaseKey":[16],"in":[17,26,62,96,146,162],"worst":[18,27,46,64],"case":[19,28,47,65],"time":[20,29],"O(1)":[21],"DeleteMin":[23],"Delete":[25],"O(log":[30],"n).":[31],"The":[32,37,67],"space":[33],"requirement":[34],"linear.":[36],"data":[38],"structure":[39],"first":[43],"achieving":[44],"this":[45],"performance.":[48],"1":[49,111,120],"Introduction":[50],"We":[51],"consider":[52],"problem":[54],"implementing":[56],"which":[59],"are":[60,73],"efficient":[61],"sense.":[66],"we":[69],"want":[70],"to":[71,124],"support":[72],"following":[75],"commonly":[76],"needed":[77],"queue":[79,98,108,128,148],"[11].":[81],"MakeQueue":[82],"creates":[83],"returns":[85,91,130],"an":[86,103],"empty":[87],"queue.":[89,134],"FindMin(Q)":[90],"minimum":[93],"element":[94,104,141],"contained":[95],"Q.":[99,109,163],"Insert(Q;":[100],"e)":[101],"inserts":[102],"e":[105,137,142,144,151,153,159],"into":[106],"Meld(Q":[110],";":[112],"Q":[113,119,122,149],"2":[114,123],")":[115,139],"melds":[116],"a":[125],"new":[126],"resulting":[132],"DecreaseKey(Q;":[135],"e;":[136],"0":[138,145,152],"replaces":[140],"by":[143],"provided":[150],"it":[155],"known":[157],"where":[158],"stored":[161],"DeleteMin(Q)":[164],"deletes":[165],"and...":[166]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2016179297","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
