{"id":"https://openalex.org/W1509813836","doi":"https://doi.org/10.1007/978-3-642-13193-6_36","title":"Policy-Based Benchmarking of Weak Heaps and Their Relatives,","display_name":"Policy-Based Benchmarking of Weak Heaps and Their Relatives,","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1509813836","doi":"https://doi.org/10.1007/978-3-642-13193-6_36","mag":"1509813836"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13193-6_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13193-6_36","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/A5016728290","display_name":"Asger Bruun","orcid":null},"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":true,"raw_author_name":"Asger Bruun","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen East, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen East, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","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":false,"raw_author_name":"Stefan Edelkamp","raw_affiliation_strings":["TZI, Universit\u00e4t\u00a0Bremen, Am\u00a0Fallturm\u00a01, 28357, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"TZI, Universit\u00e4t\u00a0Bremen, Am\u00a0Fallturm\u00a01, 28357, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","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, Universitetsparken 1, 2100, Copenhagen East, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen East, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101678085","display_name":"Jens Rasmussen","orcid":"https://orcid.org/0000-0001-9423-725X"},"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":"Jens Rasmussen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen East, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen East, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016728290"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.5645,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88813633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"424","last_page":"435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.9427253007888794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7190725803375244},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6602160334587097},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5114670991897583},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5053932666778564},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4378291368484497},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4348528981208801},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3779401481151581},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3573664426803589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21708714962005615},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21192523837089539}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9427253007888794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7190725803375244},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6602160334587097},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5114670991897583},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5053932666778564},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4378291368484497},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4348528981208801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3779401481151581},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3573664426803589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21708714962005615},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21192523837089539},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-13193-6_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13193-6_36","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/17fbffc2-fc04-478d-bbb5-4612d685ab95","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/17fbffc2-fc04-478d-bbb5-4612d685ab95","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":"Bruun , A , Edelkamp , S , Katajainen , J & Rasmussen , J 2010 , Policy-based benchmarking of weak heaps and their relatives . in P Festa (ed.) , Experimental Algorithms : 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings . Springer , Lecture notes in computer science , vol. 6049 , pp. 424-435 , 9th International Symposium on Experimental Algorithms , Napoli , Italy , 20/05/2010 . https://doi.org/10.1007/978-3-642-13193-6_36","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W133771224","https://openalex.org/W1485262373","https://openalex.org/W1491178396","https://openalex.org/W1507039213","https://openalex.org/W1522056280","https://openalex.org/W1546693390","https://openalex.org/W1552130108","https://openalex.org/W1567903304","https://openalex.org/W1600795850","https://openalex.org/W1609699128","https://openalex.org/W1715359176","https://openalex.org/W1970691969","https://openalex.org/W1981856985","https://openalex.org/W1993449345","https://openalex.org/W2006820476","https://openalex.org/W2016179297","https://openalex.org/W2023135239","https://openalex.org/W2042509780","https://openalex.org/W2044433754","https://openalex.org/W2063301486","https://openalex.org/W2084224084","https://openalex.org/W2156153879","https://openalex.org/W2752853835","https://openalex.org/W2752908210","https://openalex.org/W3145128584","https://openalex.org/W3198160809","https://openalex.org/W3198470706","https://openalex.org/W4210777595","https://openalex.org/W4240200084","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W6669417358"],"related_works":["https://openalex.org/W1909000919","https://openalex.org/W2182210592","https://openalex.org/W1558482185","https://openalex.org/W2087629135","https://openalex.org/W2139241970","https://openalex.org/W4385965231","https://openalex.org/W1967362387","https://openalex.org/W2066113256","https://openalex.org/W2237203593","https://openalex.org/W1602134693"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}