{"id":"https://openalex.org/W2574905206","doi":"https://doi.org/10.1090/dimacs/059/03","title":"Computational evaluation of hot queues","display_name":"Computational evaluation of hot queues","publication_year":2002,"publication_date":"2002-12-10","ids":{"openalex":"https://openalex.org/W2574905206","doi":"https://doi.org/10.1090/dimacs/059/03","mag":"2574905206"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/059/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/059/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew Goldberg","raw_affiliation_strings":[],"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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40163934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5731509327888489},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5448903441429138},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39206334948539734},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2712215483188629}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5731509327888489},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5448903441429138},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39206334948539734},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2712215483188629}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/059/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/059/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.9821","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.9821","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-97-104.ps","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"The":[0,36],"heap-on-top":[1],"(hot)":[2],"priority":[3,44,49,78,116],"queue":[4,50,56,74,117],"data":[5,120,139],"structure":[6,121],"[6]":[7],"improves":[8],"on":[9,54],"the":[10,55,61,72,89],"best":[11],"known":[12],"times":[13],"for":[14],"Dijkstra's":[15,39],"shortest":[16],"path":[17],"algorithm.":[18],"It":[19],"also":[20],"has":[21],"very":[22],"good":[23],"practical":[24],"performance":[25],"and":[26,109,128,133],"is":[27,41,80,118],"robust":[28],"over":[29],"a":[30,42,48,83,119,124],"wide":[31],"range":[32],"of":[33,38,76,91,126],"graph":[34,147],"types.":[35],"heart":[37],"algorithm":[40],"monotone":[43,77],"queue,":[45],"that":[46,71,122],"is,":[47],"where":[51],"no":[52],"element":[53],"ever":[57],"becomes":[58],"smaller":[59],"than":[60],"most":[62],"recently":[63],"extracted":[64],"element.":[65],"In":[66],"this":[67],"paper,":[68],"we":[69],"show":[70],"hot":[73],"implementation":[75],"queues":[79,136],"competitive":[81],"in":[82],"more":[84],"general":[85],"context.":[86],"Supported":[87],"by":[88],"Department":[90],"Defense,":[92],"with":[93,100,141],"partial":[94],"support":[95],"from":[96,103],"NSF":[97],"Award":[98],"CCR9357849,":[99],"matching":[101],"funds":[102],"IBM,":[104],"Schlumberger":[105],"Foundation,":[106,108],"Shell":[107],"Xerox":[110],"Corporation.":[111],"0":[112],"1":[113],"Introduction":[114],"A":[115],"maintains":[123],"set":[125],"elements":[127],"supports":[129],"operations":[130],"insert,":[131],"decrease-key,":[132],"extract-min.":[134],"Priority":[135],"are":[137],"fundamental":[138],"structures":[140],"many":[142],"applications.":[143],"Typical":[144],"applications":[145],"include":[146],"algorithms":[148],"(e.g.":[149],"...":[150]},"counts_by_year":[],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}