{"id":"https://openalex.org/W7157320204","doi":"https://doi.org/10.48550/arxiv.2604.24134","title":"Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines","display_name":"Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines","publication_year":2026,"publication_date":"2026-04-27","ids":{"openalex":"https://openalex.org/W7157320204","doi":"https://doi.org/10.48550/arxiv.2604.24134"},"language":"fr","primary_location":{"id":"pmh:oai:dipot.ulb.ac.be:2013/409814","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/409814","pdf_url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/409814/3/2604.24134v2.pdf","source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv.org, abs/2604.24134","raw_type":"info:eu-repo/semantics/article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/409814/3/2604.24134v2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009550388","display_name":"Ivor van der Hoog","orcid":"https://orcid.org/0009-0006-2624-0231"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Hoog, Ivor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088852372","display_name":"John Iacono","orcid":"https://orcid.org/0000-0001-8885-8172"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iacono, John","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004695759","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021826063","display_name":"Daniel Rutschmann","orcid":"https://orcid.org/0009-0005-6838-2628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rutschmann, Daniel","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":true,"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/T10126","display_name":"Logic, programming, and type systems","score":0.5590000152587891,"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/T10126","display_name":"Logic, programming, and type systems","score":0.5590000152587891,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.1062999963760376,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.09390000253915787,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.9009000062942505},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6437000036239624},{"id":"https://openalex.org/keywords/pointer-analysis","display_name":"Pointer analysis","score":0.5325999855995178},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.48350000381469727},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.415800005197525},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4140999913215637},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.40369999408721924}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9009000062942505},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6437000036239624},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.5325999855995178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4902999997138977},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.48350000381469727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45089998841285706},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.415800005197525},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4140999913215637},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797000050544739},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3393999934196472},{"id":"https://openalex.org/C2781323245","wikidata":"https://www.wikidata.org/wiki/Q1363761","display_name":"Hang","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30799999833106995},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2858000099658966},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.27950000762939453},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25859999656677246},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:dipot.ulb.ac.be:2013/409814","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/409814","pdf_url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/409814/3/2604.24134v2.pdf","source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv.org, abs/2604.24134","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2604.24134","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.24134","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:dipot.ulb.ac.be:2013/409814","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/409814","pdf_url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/409814/3/2604.24134v2.pdf","source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv.org, abs/2604.24134","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7157320204.pdf","grobid_xml":"https://content.openalex.org/works/W7157320204.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,44,166],"heap":[1,46,49,80,92],"is":[2,47,64,94,171],"a":[3,9,28,48,112,135,182],"dynamic":[4],"data":[5],"structure":[6],"that":[7,50,75,120,138,154,172],"stores":[8],"set":[10,91,99,118,152],"of":[11,23,67,73,89,105,142,168,208],"labeled":[12],"values":[13],"under":[14],"the":[15,20,24,33,39,52,65,68,71,79,85,97,103,106,143,196,206,211],"following":[16],"operations:":[17],"pop":[18],"returns":[19],"minimum":[21],"value":[22,30,40],"heap,":[25,34],"Push($x_i$)":[26],"pushes":[27],"new":[29],"$x_i$":[31,41,82],"onto":[32,78],"and":[35,108,123,146,161],"DecreaseKey($i$,":[36],"$v$)":[37],"decreases":[38],"to":[42,95,195],"$v$.":[43],"working-set":[45],"supports":[51],"$x_i":[53],"\\gets$":[54],"pop$()$":[55],"operation":[56],"in":[57,84,125,157,163,210],"$O(\\log":[58],"\u0393(x_i)":[59],")$":[60],"time":[61,160,199],"where":[62,203],"$\u0393(x_i)$":[63],"size":[66],"\\emph{working":[69],"set}:":[70],"number":[72,207],"elements":[74],"were":[76],"pushed":[77],"while":[81,101],"was":[83],"heap.":[86],"The":[87],"goal":[88],"working":[90,98,117,151],"design":[93],"maintain":[96],"property":[100],"minimizing":[102],"overhead":[104,193],"Push":[107,122,156],"DecreaseKey":[109,124,162],"operations.":[110],"On":[111],"word":[113],"RAM,":[114],"there":[115],"exist":[116],"heaps":[119,153],"support":[121,150,155],"amortized":[126,158],"constant":[127,159],"time.":[128,165],"In":[129],"this":[130,169],"paper,":[131],"we":[132],"show":[133],"via":[134],"simple":[136],"construction":[137],"pointer":[139,183],"machines,":[140],"one":[141],"most":[144],"general":[145],"least-assuming":[147],"computational":[148],"models,":[149],"inverse-Ackermann":[164],"by-product":[167],"analysis":[170],"Dijkstra's":[173],"shortest":[174],"path":[175],"algorithm":[176],"can":[177],"be":[178],"near-universally":[179],"optimal":[180,197],"on":[181],"machine":[184],"--":[185],"incurring":[186],"only":[187],"an":[188],"additive":[189],"$O(m":[190],"\\,":[191],"\u03b1(m))$":[192],"compared":[194],"running":[198],"for":[200],"distance":[201],"ordering,":[202],"$m$":[204],"denotes":[205],"edges":[209],"graph.":[212]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-29T00:00:00"}