{"id":"https://openalex.org/W10701630","doi":null,"title":"A framework for speeding up priority-queue operations","display_name":"A framework for speeding up priority-queue operations","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W10701630","mag":"10701630"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7d5962d0-050c-11de-b05e-000ea68e967b","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/7d5962d0-050c-11de-b05e-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Elmasry , A , Jensen , C & Katajainen , J 2004 ' A framework for speeding up priority-queue operations ' Department of Computer Science, University of Copenhagen . < http://cphstl.dk/Report/Layered-heaps/cphstl-report-2004-3.pdf >","raw_type":"workingPaper"},"parent_works":[],"lineage":["https://openalex.org/W10701630"],"child_works_count":0,"type":"report","is_traditional":false,"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/A5041655022","display_name":"Amr Elmasry","orcid":"https://orcid.org/0000-0002-6549-908X","observed_orcids":["https://orcid.org/0000-0002-6549-908X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amr Elmasry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066695240","display_name":"Claus Jensen","orcid":"https://orcid.org/0000-0002-5563-1745","observed_orcids":["https://orcid.org/0000-0002-5563-1745"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claus Jensen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037788421","display_name":"Jyrki Katajainen","orcid":"https://orcid.org/0000-0002-7714-5588","observed_orcids":["https://orcid.org/0000-0002-7714-5588"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jyrki Katajainen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9077000021934509,"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.9077000021934509,"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.05810000002384186,"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.0066999997943639755,"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-cost","display_name":"worst-case cost","score":0.5170000195503235},{"id":"https://openalex.org/keywords/insertion","display_name":"insertion","score":0.6209999918937683},{"id":"https://openalex.org/keywords/deletion","display_name":"deletion","score":0.8190000057220459},{"id":"https://openalex.org/keywords/data-structure-performance","display_name":"data structure performance","score":0.3089999854564667}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.8397596478462219},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6624201536178589},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.60728520154953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5596184134483337},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5368507504463196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49019914865493774},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4861466586589813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4448530375957489},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4397600293159485},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4259743392467499},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41698187589645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3097030520439148},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07672137022018433},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7d5962d0-050c-11de-b05e-000ea68e967b","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/7d5962d0-050c-11de-b05e-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Elmasry , A , Jensen , C & Katajainen , J 2004 ' A framework for speeding up priority-queue operations ' Department of Computer Science, University of Copenhagen . < http://cphstl.dk/Report/Layered-heaps/cphstl-report-2004-3.pdf >","raw_type":"workingPaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.2144","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.2144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cphstl.dk/Report/Layered-heaps/cphstl-report-2004-3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W110068484","https://openalex.org/W141105777","https://openalex.org/W301824129","https://openalex.org/W1513400187","https://openalex.org/W1535027983","https://openalex.org/W1552059191","https://openalex.org/W1552130108","https://openalex.org/W1601395530","https://openalex.org/W1808899169","https://openalex.org/W1869518224","https://openalex.org/W1921060284","https://openalex.org/W1970691969","https://openalex.org/W1979109797","https://openalex.org/W1981856985","https://openalex.org/W1995675812","https://openalex.org/W2006820476","https://openalex.org/W2016179297","https://openalex.org/W2023135239","https://openalex.org/W2063301486","https://openalex.org/W2066823629","https://openalex.org/W2075430515","https://openalex.org/W2083694582","https://openalex.org/W2084224084","https://openalex.org/W2103913570","https://openalex.org/W2273959428","https://openalex.org/W2912915653","https://openalex.org/W3198470706"],"related_works":["https://openalex.org/W4246262162","https://openalex.org/W2016179297","https://openalex.org/W2143838916","https://openalex.org/W322928041","https://openalex.org/W1558482185","https://openalex.org/W2121354236","https://openalex.org/W7097582141","https://openalex.org/W1588226748","https://openalex.org/W1970691969","https://openalex.org/W4237034397"],"abstract_inverted_index":{"Abstract.":[0],"We":[1,100],"introduce":[2],"a":[3,20,103],"framework":[4],"for":[5,71],"reducing":[6],"the":[7,25,36,57,65,77,83,88,111,114,123,136],"number":[8,66,78],"of":[9,28,39,59,67,79,126,139],"element":[10,49,68,151],"comparisons":[11,50,69,152],"performed":[12],"in":[13,82,90,108],"priority-queue":[14],"operations.":[15],"In":[16],"particular,":[17],"we":[18],"give":[19,102],"priority":[21,104,120,133],"queue":[22,105,121],"which":[23],"guarantees":[24],"worst-case":[26,37,124,137],"cost":[27,38,125,138],"O(1)":[29,48,63,127],"per":[30,51,128,153],"minimum":[31,52,129,154],"finding":[32],"and":[33,35,54,92,132,135,156,165],"insertion,":[34,131],"O(log":[40,140,148],"n)":[41,141,150],"with":[42,142],"at":[43,143],"most":[44,144],"log":[45,93,145,149],"n":[46,61,75,94,146],"+":[47,62,147],"deletion":[53,155],"deletion,":[55],"improving":[56],"bound":[58],"2log":[60],"on":[64],"known":[70],"binomial":[72],"queues.":[73],"Here,":[74],"denotes":[76],"elements":[80],"stored":[81],"data":[84],"structure":[85],"prior":[86],"to":[87,110],"operation":[89],"question,":[91],"equals":[95],"max":[96],"{1,log":[97],"2":[98],"n}.":[99],"also":[101],"that":[106],"provides,":[107],"addition":[109],"above-mentioned":[112],"methods,":[113],"priority-decrease":[115],"(or":[116],"decrease-key)":[117],"method.":[118],"This":[119],"achieves":[122],"finding,":[130],"decrease;":[134],"deletion.":[157],"CR":[158],"Classification.":[159],"E.1":[160],"[Data":[161,168],"Structures]:":[162],"Lists,":[163],"stacks,":[164],"queues;":[166],"E.2":[167]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W10701630","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
