{"id":"https://openalex.org/W1978757752","doi":"https://doi.org/10.1137/s0097539796313490","title":"Buckets, Heaps, Lists, and Monotone Priority Queues","display_name":"Buckets, Heaps, Lists, and Monotone Priority Queues","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1978757752","doi":"https://doi.org/10.1137/s0097539796313490","mag":"1978757752"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796313490","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796313490","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/A5045036830","display_name":"Boris V. Cherkassky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boris V. Cherkassky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051546943","display_name":"Craig Silverstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Craig Silverstein","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":6.7872,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.96903492,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"4","first_page":"1326","last_page":"1346"},"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.9990000128746033,"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.9990000128746033,"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.9975000023841858,"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/T10142","display_name":"Formal Methods in Verification","score":0.9962000250816345,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8412132263183594},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.8301117420196533},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7990087866783142},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.7064102292060852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6740351915359497},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5847010612487793},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48477619886398315},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45945224165916443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.434509813785553},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4337952435016632},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3832911550998688},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34031176567077637},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13137692213058472},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13059154152870178}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8412132263183594},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.8301117420196533},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7990087866783142},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7064102292060852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6740351915359497},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5847010612487793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48477619886398315},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45945224165916443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.434509813785553},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4337952435016632},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3832911550998688},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34031176567077637},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13137692213058472},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13059154152870178}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539796313490","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796313490","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.48.1742","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cs-students.stanford.edu/~csilvers/papers/hotq-soda.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.8244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.8244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.star-lab.com/goldberg/pub/neci-tr-96-070.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":12,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W2010601538","https://openalex.org/W2067661972","https://openalex.org/W2069916913","https://openalex.org/W2083669067","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2090747326","https://openalex.org/W2160365857","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W4235389253"],"related_works":["https://openalex.org/W1909000919","https://openalex.org/W2182210592","https://openalex.org/W1558482185","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W2087629135","https://openalex.org/W1490490684","https://openalex.org/W1578255156","https://openalex.org/W2010802092"],"abstract_inverted_index":{"We":[0,35,51],"introduce":[1],"the":[2,11,37,64],"heap-on-top":[3],"(hot)":[4],"priority":[5],"queue":[6],"data":[7,14,24,39,92],"structure":[8,15,25,32,40],"that":[9,70],"combines":[10],"multilevel":[12,90],"bucket":[13,91],"of":[16,57,66,73],"Denardo":[17],"and":[18,79],"Fox":[19],"with":[20],"a":[21,54],"heap.":[22],"Our":[23,60],"has":[26],"superior":[27],"operation":[28],"bounds":[29],"than":[30,83],"either":[31],"taken":[33],"alone.":[34],"use":[36],"new":[38],"to":[41],"obtain":[42],"an":[43],"improved":[44],"bound":[45],"for":[46],"Dijkstra's":[47,67],"shortest":[48],"path":[49],"algorithm.":[50],"also":[52],"discuss":[53],"practical":[55],"implementation":[56,72],"hot":[58,74],"queues.":[59],"experimental":[61],"results":[62],"in":[63],"context":[65],"algorithm":[68],"show":[69],"this":[71],"queues":[75],"performs":[76],"very":[77],"well":[78],"is":[80],"more":[81],"robust":[82],"implementations":[84],"based":[85],"only":[86],"on":[87],"heap":[88],"or":[89],"structures.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}