{"id":"https://openalex.org/W7158194568","doi":"https://doi.org/10.48550/arxiv.2604.25681","title":"SimdQuickHeap: The QuickHeap Reconsidered","display_name":"SimdQuickHeap: The QuickHeap Reconsidered","publication_year":2026,"publication_date":"2026-04-28","ids":{"openalex":"https://openalex.org/W7158194568","doi":"https://doi.org/10.48550/arxiv.2604.25681"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.25681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.25681","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089072215","display_name":"Johannes Breitling","orcid":"https://orcid.org/0000-0001-8003-5382"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Breitling, Johannes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079994235","display_name":"Ragnar Groot Koerkamp","orcid":"https://orcid.org/0000-0002-2091-1237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koerkamp, Ragnar Groot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061238962","display_name":"Marvin Williams","orcid":"https://orcid.org/0000-0002-1990-0899"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Williams, Marvin","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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7401000261306763,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7401000261306763,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.06080000102519989,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.051500000059604645,"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/data-structure","display_name":"Data structure","score":0.5996999740600586},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5659999847412109},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5454999804496765},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.4848000109195709},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.47999998927116394},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4372999966144562},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.4223000109195709},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.40869998931884766}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7324000000953674},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5996999740600586},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5659999847412109},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5601999759674072},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4848000109195709},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.47999998927116394},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.40869998931884766},{"id":"https://openalex.org/C2777998813","wikidata":"https://www.wikidata.org/wiki/Q16869124","display_name":"Append","level":2,"score":0.4027999937534332},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40070000290870667},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35190001130104065},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.34950000047683716},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.31299999356269836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3084999918937683},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2793000042438507},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.25681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.25681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Priority":[0],"queues":[1],"are":[2],"data":[3,77,87],"structures":[4],"that":[5,62],"maintain":[6],"a":[7,57,162],"dynamic":[8],"collection":[9],"of":[10,59,89,117,123,159,216],"elements":[11,16,101,133],"and":[12,17,26,44,67,119,176,204,210,218,229],"allow":[13],"inserting":[14],"new":[15],"removing":[18],"the":[19,32,55,60,74,76,86,90,121,127,157,168,187,196,200,235,239],"smallest":[20],"element.":[21],"The":[22,135],"most":[23],"widely":[24],"known":[25],"used":[27],"priority":[28],"queue":[29],"is":[30,39,45,156,170,189,237],"likely":[31],"implicit":[33],"binary":[34],"heap,":[35,203],"even":[36],"though":[37],"it":[38],"has":[40,137],"frequent":[41],"cache":[42],"misses":[43],"hard":[46],"to":[47,82,93,125,129,147,191],"optimize":[48],"using":[49],"e.g.":[50],"SIMD":[51,112,163],"instructions.":[52],"We":[53,84],"introduce":[54],"SimdQuickHeap,":[56],"variant":[58],"QuickHeap":[61,92],"was":[63],"introduced":[64],"by":[65,73],"Navarro":[66],"Paredes":[68],"in":[69,98,106,151,161],"2010.":[70],"As":[71],"suggested":[72],"name,":[75],"structure":[78],"bears":[79],"some":[80],"similarity":[81],"QuickSort.":[83],"modify":[85],"layout":[88],"original":[91],"have":[94],"all":[95],"\\emph{pivots}":[96],"adjacent":[97],"memory,":[99],"with":[100,224],"between":[102],"consecutive":[103],"pivots":[104,124],"stored":[105],"dedicated":[107],"\\emph{buckets}.":[108],"This":[109],"allows":[110],"efficient":[111],"implementations":[113],"for":[114],"both":[115],"partitioning":[116],"buckets":[118],"scanning":[120],"list":[122],"find":[126],"bucket":[128],"append":[130],"newly":[131],"inserted":[132],"to.":[134],"SimdQuickHeap":[136,188,236],"amortized":[138,171],"expected":[139],"complexity":[140],"$O(\\log":[141],"n)$":[142,150],"per":[143,174,182,214],"operation,":[144],"which":[145],"improves":[146],"$O(\\frac":[148,172,177],"1W\\log":[149],"non-degenerate":[152],"cases,":[153],"where":[154],"$W$":[155],"number":[158],"words":[160],"register.":[164],"In":[165,184],"this":[166],"case,":[167],"I/O-complexity":[169],"1B)$":[173],"push":[175,217],"1B":[178],"\\log_2":[179],"\\frac":[180],"nM)$":[181],"pop.":[183],"synthetic":[185],"benchmarks,":[186],"up":[190],"twice":[192],"as":[193,195],"fast":[194],"next-best":[197],"competitor,":[198],"including":[199],"non-comparison":[201],"radix":[202],"needs":[205],"around":[206],"$1.5\\log_2":[207],"n$":[208,212],"comparisons":[209],"$\\log_2":[211],"nanoseconds":[213],"pair":[215],"pop":[219],"operations.":[220],"On":[221],"graph":[222],"benchmarks":[223],"Dijkstra's":[225],"shortest":[226],"path":[227],"algorithm":[228],"Jarnik-Prim's":[230],"minimum":[231],"spanning":[232],"tree":[233],"algorithm,":[234],"consistently":[238],"fastest.":[240]},"counts_by_year":[],"updated_date":"2026-07-01T08:55:40.977307","created_date":"2026-04-30T00:00:00"}