{"id":"https://openalex.org/W1986241425","doi":"https://doi.org/10.1007/bf01941687","title":"Parallel construction of binary trees with near optimal weighted path length","display_name":"Parallel construction of binary trees with near optimal weighted path length","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W1986241425","doi":"https://doi.org/10.1007/bf01941687","mag":"1986241425"},"language":"en","primary_location":{"id":"doi:10.1007/bf01941687","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01941687","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5069172477","display_name":"David Kirkpatrick","orcid":"https://orcid.org/0000-0002-3276-2734"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"D. G. Kirkpatrick","raw_affiliation_strings":["Department of Computer Science, The University of British Columbia, V6T 1Z4, Vancouver, British Columbia, Canada","Department of Computer Science, The University of British Columbia, Vancouver, Canada V6T 1Z4"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of British Columbia, V6T 1Z4, Vancouver, British Columbia, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, The University of British Columbia, Vancouver, Canada V6T 1Z4","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Przytycka","raw_affiliation_strings":["Odense University, Odense, Denmark","Odense University, Odense, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Odense University, Odense, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University, Odense, Denmark#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069172477"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10469302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"172","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7139614820480347},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7007030248641968},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.673744261264801},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6295108199119568},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.588881254196167},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5832937359809875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5801659822463989},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5258921980857849},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5227137804031372},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.511604368686676},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.49945878982543945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4831356704235077},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46247899532318115},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4461463987827301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32824885845184326},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18831729888916016},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09999319911003113}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7139614820480347},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7007030248641968},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.673744261264801},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6295108199119568},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.588881254196167},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5832937359809875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5801659822463989},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5258921980857849},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5227137804031372},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.511604368686676},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.49945878982543945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4831356704235077},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46247899532318115},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4461463987827301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32824885845184326},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18831729888916016},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09999319911003113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01941687","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01941687","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W41435888","https://openalex.org/W135218539","https://openalex.org/W1978583881","https://openalex.org/W1985361644","https://openalex.org/W2018691674","https://openalex.org/W2022143201","https://openalex.org/W2048972466","https://openalex.org/W2060108852","https://openalex.org/W2063794498","https://openalex.org/W2069489095","https://openalex.org/W2089062581","https://openalex.org/W2116078914","https://openalex.org/W2134008688","https://openalex.org/W2475478067"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2107381954","https://openalex.org/W4244673516","https://openalex.org/W2501849745","https://openalex.org/W2026697457","https://openalex.org/W3169685561","https://openalex.org/W2117536196","https://openalex.org/W2382364329","https://openalex.org/W3022865202","https://openalex.org/W2371680642"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}