{"id":"https://openalex.org/W2040934527","doi":"https://doi.org/10.1142/s1793830910000838","title":"THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP","display_name":"THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2040934527","doi":"https://doi.org/10.1142/s1793830910000838","mag":"2040934527"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000838","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000838","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5041655022","display_name":"Amr Elmasry","orcid":"https://orcid.org/0000-0002-6549-908X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"AMR ELMASRY","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041655022"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":1.8368,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87312327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"02","issue":"04","first_page":"493","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9308059215545654},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7606555223464966},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.7366056442260742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5460644960403442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5445724725723267},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5214238166809082},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4482840299606323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44580990076065063},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4316518306732178},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.39870044589042664},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3311358094215393},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2856859564781189},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11108383536338806},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11022770404815674}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9308059215545654},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7606555223464966},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.7366056442260742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5460644960403442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5445724725723267},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5214238166809082},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4482840299606323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44580990076065063},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4316518306732178},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.39870044589042664},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3311358094215393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2856859564781189},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11108383536338806},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11022770404815674}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830910000838","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000838","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1545905594","https://openalex.org/W1970691969","https://openalex.org/W1989031126","https://openalex.org/W1996864203","https://openalex.org/W2006820476","https://openalex.org/W2023135239","https://openalex.org/W2063301486","https://openalex.org/W2084224084","https://openalex.org/W2130055503","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2184537587","https://openalex.org/W1578255156","https://openalex.org/W4293570236","https://openalex.org/W1969400057","https://openalex.org/W2163169902","https://openalex.org/W4246145339","https://openalex.org/W2552085130","https://openalex.org/W121517553","https://openalex.org/W160821205","https://openalex.org/W2098037505"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,70,75],"priority":[3],"queue":[4],"that":[5],"achieves":[6],"the":[7],"same":[8],"amortized":[9,26,34],"bounds":[10],"as":[11],"Fibonacci":[12],"heaps.":[13,52],"Namely,":[14],"find-min":[15],"requires":[16,30],"O(1)":[17,25],"worst-case":[18],"time,":[19,27],"insert,":[20],"meld":[21],"and":[22,28,40],"decrease-key":[23,71],"require":[24],"delete-min":[29],"O(":[31],"log":[32],"n)":[33],"time.":[35],"Our":[36],"structure":[37],"is":[38,59],"simple":[39],"promises":[41],"an":[42],"efficient":[43],"practical":[44],"behavior":[45],"when":[46],"compared":[47],"to":[48,60],"other":[49],"known":[50],"Fibonacci-like":[51],"The":[53],"main":[54],"idea":[55],"behind":[56],"our":[57],"construction":[58],"propagate":[61],"rank":[62],"updates":[63],"instead":[64],"of":[65],"performing":[66],"cascaded":[67],"cuts":[68],"following":[69],"operation,":[72],"allowing":[73],"for":[74],"relaxed":[76],"structure.":[77]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}