{"id":"https://openalex.org/W1593562291","doi":"https://doi.org/10.5555/1496770.1496822","title":"Pairing heaps with O(log log n) decrease cost","display_name":"Pairing heaps with O(log log n) decrease cost","publication_year":2009,"publication_date":"2009-01-04","ids":{"openalex":"https://openalex.org/W1593562291","doi":"https://doi.org/10.5555/1496770.1496822","mag":"1593562291"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.7048","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.7048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/soda/2009/SODA09_052_elmasrya.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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","observed_orcids":["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#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","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":2.5792,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87866109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"471","last_page":"476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8916000127792358,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8916000127792358,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.07859999686479568,"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/T12288","display_name":"Optimization and Search Problems","score":0.00989999994635582,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairing-heaps","display_name":"pairing heaps","score":0.9990000128746033},{"id":"https://openalex.org/keywords/decrease-key-operation","display_name":"decrease-key operation","score":0.8659999966621399},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"amortized analysis","score":0.6650000214576721},{"id":"https://openalex.org/keywords/heap-data-structures","display_name":"heap data structures","score":0.7179999947547913},{"id":"https://openalex.org/keywords/time-complexity-bounds","display_name":"time complexity bounds","score":0.3610000014305115}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.8110069036483765},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6682344675064087},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6185011863708496},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.585098385810852},{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.571298360824585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5485641360282898},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4773683249950409},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3605095148086548},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3467700481414795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3287021815776825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20340541005134583},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0998697578907013},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09984654188156128},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C54101563","wikidata":"https://www.wikidata.org/wiki/Q124131","display_name":"Superconductivity","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.7048","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.7048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siam.org/proceedings/soda/2009/SODA09_052_elmasrya.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.502.6706","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.502.6706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://domino.mpi-inf.mpg.de/intranet/ag1/ag1publ.nsf/d6dd8219a4a2a18cc12569e30040d655/55cec128573a3e0cc12575600061de33/$file/paper.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:518315","doi":null,"is_oa":false,"landing_page_url":"http://edoc.mpg.de/518315","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics (SIAM), 471-476 (2009)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1324161","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-18AE-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th ACM-SIAM Symposium on Discrete Algorithms","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1593562291","doi":"https://doi.org/10.5555/1496770.1496822","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1324161","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1508221111","https://openalex.org/W1563256508","https://openalex.org/W1869518224","https://openalex.org/W1987927249","https://openalex.org/W1989031126","https://openalex.org/W2019235922","https://openalex.org/W2023135239","https://openalex.org/W2065503744","https://openalex.org/W2130055503","https://openalex.org/W2138048993"],"related_works":["https://openalex.org/W2769587183","https://openalex.org/W1546171422","https://openalex.org/W4405705692","https://openalex.org/W2744207019","https://openalex.org/W7171512217","https://openalex.org/W7098868966","https://openalex.org/W237347036","https://openalex.org/W2952083758","https://openalex.org/W1989031126","https://openalex.org/W1959440417"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,25],"variation":[3],"of":[4,27],"the":[5,10,15,18,50,54],"pairing":[6],"heaps":[7],"for":[8,13,24,36,41,45,58],"which":[9],"time":[11],"bounds":[12,51],"all":[14],"\\noperations":[16],"match":[17],"lower":[19],"bound":[20],"proved":[21],"by":[22],"Fredman":[23],"family":[26],"similar":[28],"\\nself-adjusting":[29],"heaps.\\nNamely,":[30],"our":[31],"heap":[32],"structure":[33],"requires":[34],"$O(1)$":[35],"insert":[37],"and":[38,43,47],"find-min,":[39],"\\n$O(\\\\log{n})$":[40],"delete-min,":[42],"$O(\\\\log\\\\log{n})$":[44],"decrease-key":[46],"meld":[48],"\\n(all":[49],"are":[52],"in":[53],"amortized":[55],"sense":[56],"except":[57],"find-min).":[59]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}