{"id":"https://openalex.org/W1494901746","doi":"https://doi.org/10.1007/978-3-642-25011-8_16","title":"Two Constant-Factor-Optimal Realizations of Adaptive Heapsort","display_name":"Two Constant-Factor-Optimal Realizations of Adaptive Heapsort","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1494901746","doi":"https://doi.org/10.1007/978-3-642-25011-8_16","mag":"1494901746"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-25011-8_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25011-8_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5058729606","display_name":"Stefan Edelkamp","orcid":"https://orcid.org/0000-0001-8435-5025"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Edelkamp","raw_affiliation_strings":["TZI, Universit\u00e4t\u00a0Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"TZI, Universit\u00e4t\u00a0Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041655022","display_name":"Amr Elmasry","orcid":"https://orcid.org/0000-0002-6549-908X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Amr Elmasry","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037788421","display_name":"Jyrki Katajainen","orcid":"https://orcid.org/0000-0002-7714-5588"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jyrki Katajainen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058729606"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3728,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63643183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"195","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T12029","display_name":"DNA and Biological Computing","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.7585481405258179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6988431215286255},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6753787398338318},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6733823418617249},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6191636919975281},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5172053575515747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.487385094165802},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.44642189145088196},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.41272294521331787},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3900510370731354},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08518853783607483},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08026567101478577}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7585481405258179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6988431215286255},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6753787398338318},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6733823418617249},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6191636919975281},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5172053575515747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.487385094165802},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.44642189145088196},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.41272294521331787},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3900510370731354},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08518853783607483},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08026567101478577},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-25011-8_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25011-8_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7a382686-23f3-4718-9da5-6a4201e78c74","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/7a382686-23f3-4718-9da5-6a4201e78c74","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Edelkamp , S , Elmasry , A A A E & Katajainen , J 2011 , Two constant-factor-optimal realizations of adaptive heapsort . in C S Iliopoulos & W F Smyth (eds) , Combinatorial Algorithms : 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers . Springer , Lecture notes in computer science , vol. 7056 , pp. 195-208 , 22nd International Workshop on Combinatorial Algorithms , Victoria , Canada , 20/06/2011 . https://doi.org/10.1007/978-3-642-25011-8_16","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1490261606","https://openalex.org/W1492853005","https://openalex.org/W1500006865","https://openalex.org/W1522056280","https://openalex.org/W1583793915","https://openalex.org/W1589421353","https://openalex.org/W1600795850","https://openalex.org/W1605099433","https://openalex.org/W1966648469","https://openalex.org/W1970691969","https://openalex.org/W1970752613","https://openalex.org/W1979109797","https://openalex.org/W1993991039","https://openalex.org/W1998722644","https://openalex.org/W2016766106","https://openalex.org/W2020033095","https://openalex.org/W2037007500","https://openalex.org/W2042509780","https://openalex.org/W2045941082","https://openalex.org/W2067750518","https://openalex.org/W2103913570","https://openalex.org/W2109426391","https://openalex.org/W2126786846","https://openalex.org/W2131787158","https://openalex.org/W2143838916","https://openalex.org/W2912915653","https://openalex.org/W3198160809","https://openalex.org/W3198470706","https://openalex.org/W4235295823","https://openalex.org/W4240200084","https://openalex.org/W4250288049","https://openalex.org/W4251658412"],"related_works":["https://openalex.org/W1909000919","https://openalex.org/W2182210592","https://openalex.org/W1558482185","https://openalex.org/W2087629135","https://openalex.org/W2622138879","https://openalex.org/W4385965231","https://openalex.org/W4399541277","https://openalex.org/W2139241970","https://openalex.org/W1967362387","https://openalex.org/W2066113256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}