{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/learning-augmented-priority-queues","title":"Learning-Augmented Priority Queues","arxiv_id":"2406.04793","date":"2024-06-07","proceeding":null,"authors":["Ziyad Benomar","Christian Coester"],"abstract":"Priority queues are one of the most fundamental and widely used data structures in computer science. Their primary objective is to efficiently support the insertion of new elements with assigned priorities and the extraction of the highest priority element. In this study, we investigate the design of priority queues within the learning-augmented framework, where algorithms use potentially inaccurate predictions to enhance their worst-case performance. We examine three prediction models spanning different use cases, and show how the predictions can be leveraged to enhance the performance of priority queue operations. Moreover, we demonstrate the optimality of our solution and discuss some possible applications.","url_abs":"https://arxiv.org/abs/2406.04793v2","url_pdf":"https://arxiv.org/pdf/2406.04793v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-augmented-priority-queues","repo_url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2406.04793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04793"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues","reach":null}],"summary":{"ran_fixture":1,"unverified":3},"by_repo_kind":{"official":{"samples":4,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"6561acbaf4ae58c1","entry":"bHeapSort","repo":"Ziyad-Benomar/Learning-augmented-priority-queues","repo_kind":"official","path":"heaps.py","file_url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues/blob/HEAD/heaps.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6561acbaf4ae58c1"}},{"code_sha256_prefix":"7bdbdd95d0ebba40","entry":"createPQ","repo":"Ziyad-Benomar/Learning-augmented-priority-queues","repo_kind":"official","path":"dijkstra.py","file_url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues/blob/HEAD/dijkstra.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7bdbdd95d0ebba40"}},{"code_sha256_prefix":"09ce8be017bb474b","entry":"dijkstraPQ","repo":"Ziyad-Benomar/Learning-augmented-priority-queues","repo_kind":"official","path":"dijkstra.py","file_url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues/blob/HEAD/dijkstra.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"09ce8be017bb474b"}},{"code_sha256_prefix":"9e7bb40df8bf92e9","entry":"getRanks","repo":"Ziyad-Benomar/Learning-augmented-priority-queues","repo_kind":"official","path":"dijkstra.py","file_url":"https://github.com/Ziyad-Benomar/Learning-augmented-priority-queues/blob/HEAD/dijkstra.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9e7bb40df8bf92e9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}