{"id":"https://openalex.org/W55345283","doi":null,"title":"Relaxed weak queues: An alternative to run-relaxed heaps","display_name":"Relaxed weak queues: An alternative to run-relaxed heaps","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W55345283","mag":"55345283"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9af7ff50-05bf-11de-b05e-000ea68e967b","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/9af7ff50-05bf-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 2005 ' Relaxed weak queues: An alternative to run-relaxed heaps ' Department of Computer Science, University of Copenhagen . < http://cphstl.dk/Report/Relaxed-weak-queues/relaxed-weak-queues.pdf >","raw_type":"workingPaper"},"parent_works":[],"lineage":["https://openalex.org/W55345283"],"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.9326000213623047,"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.9326000213623047,"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.029999999329447746,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.007300000172108412,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/priority-queues","display_name":"priority queues","score":0.8830000162124634},{"id":"https://openalex.org/keywords/decrease-key-operation","display_name":"decrease-key operation","score":0.8820000290870667},{"id":"https://openalex.org/keywords/pointer-based-data-structures","display_name":"pointer-based data structures","score":0.5149999856948853},{"id":"https://openalex.org/keywords/binary-trees","display_name":"binary trees","score":0.5210000276565552},{"id":"https://openalex.org/keywords/spatial-efficiency","display_name":"space efficiency","score":0.39800000190734863},{"id":"https://openalex.org/keywords/pointer-machine","display_name":"pointer machine","score":0.39899998903274536},{"id":"https://openalex.org/keywords/random-access-machines","display_name":"random access machines","score":0.9739999771118164}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8780077695846558},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6999697089195251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6629223823547363},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6032673716545105},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5525510311126709},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5250782370567322},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4417160451412201},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.41147109866142273},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3851993978023529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3792136013507843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3699303865432739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3489416837692261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3421526253223419},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23139843344688416},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0813138484954834}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9af7ff50-05bf-11de-b05e-000ea68e967b","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/9af7ff50-05bf-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 2005 ' Relaxed weak queues: An alternative to run-relaxed heaps ' Department of Computer Science, University of Copenhagen . < http://cphstl.dk/Report/Relaxed-weak-queues/relaxed-weak-queues.pdf >","raw_type":"workingPaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.9256","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9256","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/Relaxed-weak-queues/relaxed-weak-queues.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.7082","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.7082","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/Relaxed-weak-queues/relaxed-weak-queues.ps","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":18,"referenced_works":["https://openalex.org/W10701630","https://openalex.org/W100509257","https://openalex.org/W301824129","https://openalex.org/W1513400187","https://openalex.org/W1522056280","https://openalex.org/W1921060284","https://openalex.org/W1970691969","https://openalex.org/W1981856985","https://openalex.org/W1993449345","https://openalex.org/W2016179297","https://openalex.org/W2037658490","https://openalex.org/W2041230269","https://openalex.org/W2042509780","https://openalex.org/W2063301486","https://openalex.org/W2084224084","https://openalex.org/W2121354236","https://openalex.org/W2136598300","https://openalex.org/W3198470706"],"related_works":["https://openalex.org/W7098955059","https://openalex.org/W106186607","https://openalex.org/W2182140966","https://openalex.org/W1968564979","https://openalex.org/W1509813836","https://openalex.org/W7098481859","https://openalex.org/W2063301486","https://openalex.org/W2761610858","https://openalex.org/W7098104458"],"abstract_inverted_index":{"Abstract.":[0],"A":[1,71],"simplification":[2],"of":[3,48,78,111,152,165,181],"a":[4,8,61,68,76,108,112,118,182],"run-relaxed":[5],"heap,":[6,115],"called":[7,31],"relaxed":[9,72,183],"weak":[10,73,87,114,154,184],"queue,":[11],"is":[12,75,117,122],"presented.":[13],"This":[14],"new":[15],"priority-queue":[16],"implementation":[17],"supports":[18],"all":[19],"operations":[20],"as":[21,23,64,66,188,190],"efficiently":[22],"the":[24,46,53,170,174,177],"original:":[25],"find-min,":[26],"insert,":[27],"and":[28,37,156,199,207],"decrease":[29],"(also":[30],"decrease-key)":[32],"in":[33,39,92],"O(1)":[34],"worst-case":[35,42],"time,":[36,43],"delete":[38],"O(lg":[40,162,193],"n)":[41,163,194],"n":[44,82,97],"denoting":[45],"number":[47],"elements":[49,175],"stored":[50],"prior":[51],"to":[52,124,130,135,149],"operation.":[54],"These":[55],"time":[56],"bounds":[57],"are":[58,91],"valid":[59],"on":[60,67],"pointer":[62],"machine":[63],"well":[65],"random-access":[69],"machine.":[70],"queue":[74,185],"collection":[77],"at":[79,94],"most":[80,95],"\u230alg":[81,96],"\u230b":[83,98],"+":[84,99,192],"1":[85,100],"perfect":[86,113,153],"heaps,":[88],"where":[89],"there":[90],"total":[93,178],"nodes":[101,159],"that":[102],"may":[103],"violate":[104],"weak-heap":[105],"order.":[106],"In":[107],"pointer-based":[109],"representation":[110],"which":[116],"binary":[119],"tree,":[120],"it":[121],"enough":[123],"use":[125],"two":[126],"pointers":[127],"per":[128],"node":[129,138],"record":[131],"parent-child":[132],"relationships.":[133],"Due":[134],"decrease,":[136],"each":[137],"must":[139],"store":[140],"one":[141],"additional":[142],"pointer.":[143],"The":[144],"auxiliary":[145],"data":[146],"structures":[147],"maintained":[148],"keep":[150],"track":[151],"heaps":[155],"potential":[157],"violation":[158],"only":[160],"require":[161],"words":[164],"storage.":[166],"That":[167],"is,":[168],"excluding":[169],"space":[171,179],"used":[172],"by":[173],"themselves,":[176],"usage":[180],"can":[186],"be":[187],"low":[189],"3n":[191],"words.":[195],"ACM":[196],"CCS":[197],"Categories":[198],"Subject":[200],"Descriptors.":[201],"E.1":[202],"[Data":[203,210],"Structures]:":[204],"Lists,":[205],"stacks,":[206],"queues;":[208],"E.2":[209],"Storage":[211],"Representations]:":[212],"Linked":[213],"representations;":[214]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W55345283","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
