{"id":"https://openalex.org/W2089026470","doi":"https://doi.org/10.1137/s0097539795288246","title":"On RAM Priority Queues","display_name":"On RAM Priority Queues","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2089026470","doi":"https://doi.org/10.1137/s0097539795288246","mag":"2089026470"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795288246","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795288246","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/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.7743,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.98847858,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"30","issue":"1","first_page":"86","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9979000091552734,"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/priority-queue","display_name":"Priority queue","score":0.670485258102417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6291598081588745},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5149860978126526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.508569598197937},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5000574588775635},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4766075015068054},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4669058918952942},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.44585704803466797},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.411682665348053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.376672625541687},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.291675329208374}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.670485258102417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6291598081588745},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5149860978126526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.508569598197937},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5000574588775635},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4766075015068054},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4669058918952942},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.44585704803466797},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.411682665348053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.376672625541687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.291675329208374},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539795288246","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795288246","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.46.4176","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4176","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/users/mthorup/PAPERS/combo.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1977421134","https://openalex.org/W1984816083","https://openalex.org/W1985361644","https://openalex.org/W1992470151","https://openalex.org/W1997690368","https://openalex.org/W2009283111","https://openalex.org/W2018338704","https://openalex.org/W2052207834","https://openalex.org/W2065954102","https://openalex.org/W2069916913","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2087629135","https://openalex.org/W2089439745","https://openalex.org/W2090747326","https://openalex.org/W2152506638","https://openalex.org/W2160365857","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2337480916","https://openalex.org/W2485790164"],"related_works":["https://openalex.org/W2072233942","https://openalex.org/W2155295887","https://openalex.org/W4302376102","https://openalex.org/W1978228527","https://openalex.org/W2143503070","https://openalex.org/W162435663","https://openalex.org/W1968477205","https://openalex.org/W4383988178","https://openalex.org/W2915689316","https://openalex.org/W3031415405"],"abstract_inverted_index":{"Priority":[0],"queues":[1],"are":[2,13,24],"some":[3],"of":[4,33,98,113,119,127,240,251,276,301,381,389],"the":[5,31,46,95,101,109,120,125,147,162,185,219,236,248,255,259,281,297,302,309,341,357,368,382,387],"most":[6],"fundamental":[7],"data":[8],"structures.":[9],"For":[10,253],"example,":[11,254],"they":[12,23],"used":[14],"directly":[15],"for":[16,146,312,340],"task":[17],"scheduling":[18],"in":[19,48,80,87,100,195,226,305],"operating":[20],"systems.":[21],"Moreover,":[22],"essential":[25],"to":[26,68,247],"greedy":[27,228],"algorithms.":[28,229],"We":[29,56,230],"study":[30],"complexity":[32],"integer":[34],"priority":[35,76,135,172,211,214,243,323,405],"queue":[36,77,136,215,244,324,406],"operations":[37],"on":[38,124,153,168,233,265,347,386,399],"a":[39,74,154,205,234,241,266,318,348],"RAM":[40,75,283,306],"with":[41,156,161,268,325,350,407],"arbitrary":[42],"word":[43,186],"size,":[44],"modeling":[45],"possibilities":[47],"standard":[49],"imperative":[50],"programming":[51],"languages":[52],"such":[53],"as":[54,159,225,294],"C.":[55],"present":[57],"exponential":[58,106],"improvements":[59],"over":[60,108,223],"previous":[61,163],"bounds,":[62],"and":[63,83,85,115,170,188,210,353,378],"we":[64,316],"show":[65,231],"tight":[66],"relations":[67],"sorting.":[69,252,307],"Our":[70,201],"first":[71],"result":[72,203],"is":[73,94,104,184,204,216,221,245,271],"supporting":[78],"find-min":[79],"constant":[81,327,408],"time":[82,88,292,328],"insert":[84],"delete-min":[86],"O(log":[89,401],"log":[90,143,289,290,360,371,403],"n),":[91],"where":[92,182],"n":[93,351,372],"current":[96,282],"number":[97],"keys":[99],"queue.":[102,173],"This":[103,366],"an":[105,141,287,336],"improvement":[107],"$O(\\sqrt{\\log":[110,321],"n})$":[111],"bound":[112,166,375],"Fredman":[114,169,377],"Willard":[116,379],"[":[117],"Proceedings":[118],"22nd":[121],"ACM":[122],"Symposium":[123,385],"Theory":[126],"Computing,":[128],"Baltimore,":[129],"MD,":[130],"pp.":[131,396],"1--7].":[132],"Plugging":[133,330],"this":[134,285,331],"into":[137,332],"Dijkstra's":[138,333],"algorithm":[139,145,334,339,362],"gives":[140,286,335],"O(mlog":[142,359],"m)":[144,291,361,374],"single":[148,260,342],"source":[149,261,343],"shortest":[150,262,344],"path":[151,345],"problem":[152,264,346],"graph":[155,267,349],"m":[157,269,278,354],"edges,":[158,355],"compared":[160],"$O(m\\sqrt{\\log":[164],"m})$":[165],"based":[167,398],"Willard's":[171],"The":[174],"above":[175,358],"bounds":[176],"assume":[177],"$O(n":[178],"2^{{\\varepsilon}":[179],"w})$":[180],"space,":[181],"w":[183],"length":[187],"${\\varepsilon}>0$.":[189],"They":[190],"can,":[191],"however,":[192],"be":[193],"achieved":[194],"linear":[196],"space":[197],"using":[198],"randomized":[199,319],"hashing.":[200],"second":[202],"general":[206],"equivalence":[207,256,310],"between":[208],"sorting":[209,277],"queues.":[212],"A":[213],"monotone":[217,242,320],"if":[218,363],"minimum":[220],"nondecreasing":[222],"time,":[224],"many":[227],"that":[232,258,275],"RAM,":[235],"amortized":[237],"operation":[238],"cost":[239,250],"equivalent":[246],"per-key":[249],"implies":[257],"paths":[263],"edges":[270],"no":[272],"harder":[273],"than":[274],"keys.":[279],"With":[280],"sorting,":[284],"O(m":[288],"bound,":[293],"above,":[295],"but":[296],"relation":[298],"holds":[299],"regardless":[300],"future":[303],"developments":[304],"From":[308],"result,":[311],"any":[313],"fixed":[314],"${\\varepsilon}>0$,":[315],"derive":[317],"n}^{1+{\\varepsilon}})$":[322],"expected":[326],"decrease-key.":[329,409],"$O(n\\sqrt{\\log":[337],"n}^{1+{\\varepsilon}}+m)$":[338],"nodes":[352],"complementing":[356],"$m\\gg":[364],"n$.":[365],"improves":[367],"O(nlog":[369],"n/log":[370,402],"+":[373],"by":[376],"[Proceedings":[380],"31st":[383],"IEEE":[384],"Foundations":[388],"Computer":[390],"Science,":[391],"St.":[392],"Louis,":[393],"MO,":[394],"1990,":[395],"719--725],":[397],"their":[400],"n)":[404]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}