{"id":"https://openalex.org/W1988325634","doi":"https://doi.org/10.1137/0206045","title":"A New Algorithm for Minimum Cost Binary Trees","display_name":"A New Algorithm for Minimum Cost Binary Trees","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W1988325634","doi":"https://doi.org/10.1137/0206045","mag":"1988325634"},"language":"en","primary_location":{"id":"doi:10.1137/0206045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5003707399","display_name":"Adriano M. Garsia","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Adriano M. Garsia","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000630520","display_name":"Michelle L. Wachs","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michelle L. Wachs","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003707399"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0141,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.94814059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"4","first_page":"622","last_page":"642"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9855999946594238,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9843000173568726,"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/binary-search-tree","display_name":"Binary search tree","score":0.6529287695884705},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.63618004322052},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5954369306564331},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5770771503448486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5462632775306702},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5206220149993896},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5206058025360107},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.45526033639907837},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4304257929325104},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.41432783007621765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33082157373428345},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2535417675971985}],"concepts":[{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6529287695884705},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.63618004322052},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5954369306564331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5770771503448486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5462632775306702},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5206220149993896},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5206058025360107},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.45526033639907837},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4304257929325104},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.41432783007621765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33082157373428345},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2535417675971985},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206045","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":6,"referenced_works":["https://openalex.org/W2063794498","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2118382442","https://openalex.org/W2126711987","https://openalex.org/W2989713547"],"related_works":["https://openalex.org/W2077383771","https://openalex.org/W2149064492","https://openalex.org/W1973074590","https://openalex.org/W2123024824","https://openalex.org/W1984738873","https://openalex.org/W4232709447","https://openalex.org/W1510719821","https://openalex.org/W2072924299","https://openalex.org/W1979520615","https://openalex.org/W2521769517"],"abstract_inverted_index":{"A":[0],"new":[1],"algorithm":[2,17,73],"for":[3,46],"constructing":[4],"minimum":[5,61],"cost":[6,62],"binary":[7,63],"trees":[8],"in":[9,74],"$O(n":[10],"\\log":[11],"n)$":[12],"time":[13,69],"is":[14,18,29,36],"presented.":[15],"The":[16],"similar":[19],"to":[20],"the":[21,44,47,58],"well-known":[22],"Hu-Tucker":[23,48],"algorithm.":[24,49],"Our":[25,50],"proof":[26,45,51],"of":[27,60,71],"validity":[28],"based":[30],"on":[31],"finite":[32],"variational":[33],"methods":[34],"and":[35,40],"therefore":[37],"quite":[38],"different":[39],"somewhat":[41],"simpler":[42],"than":[43],"also":[52],"yields":[53],"some":[54],"additional":[55],"information":[56],"about":[57],"structure":[59],"trees.":[64],"This":[65],"permits":[66],"a":[67,75],"linear":[68],"implementation":[70],"our":[72],"special":[76],"case.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}