{"id":"https://openalex.org/W2013021781","doi":"https://doi.org/10.1137/0203008","title":"Optimal Binary Search Trees with Restricted Maximal Depth","display_name":"Optimal Binary Search Trees with Restricted Maximal Depth","publication_year":1974,"publication_date":"1974-06-01","ids":{"openalex":"https://openalex.org/W2013021781","doi":"https://doi.org/10.1137/0203008","mag":"2013021781"},"language":"en","primary_location":{"id":"doi:10.1137/0203008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203008","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/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047995033"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9462,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.91290437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":"2","first_page":"101","last_page":"110"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9797000288963318,"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"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9790999889373779,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.8213590383529663},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7787678241729736},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.668548583984375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6140236258506775},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.588425874710083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5617159008979797},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5594285130500793},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5457295179367065},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5320063233375549},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.528642475605011},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5250446796417236},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5196189284324646},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4796714782714844},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4784943461418152},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47486281394958496},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4699421525001526},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4462847113609314},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44602692127227783},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.44322431087493896},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4231623709201813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35848313570022583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3123106062412262},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28560131788253784},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2217240333557129},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.1642201542854309},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1040995717048645},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0884854793548584},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.07687017321586609}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8213590383529663},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7787678241729736},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.668548583984375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6140236258506775},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.588425874710083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5617159008979797},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5594285130500793},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5457295179367065},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5320063233375549},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.528642475605011},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5250446796417236},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5196189284324646},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4796714782714844},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4784943461418152},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47486281394958496},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4699421525001526},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4462847113609314},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44602692127227783},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.44322431087493896},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4231623709201813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35848313570022583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3123106062412262},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28560131788253784},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2217240333557129},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.1642201542854309},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1040995717048645},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0884854793548584},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.07687017321586609},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0203008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203008","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2080702353","https://openalex.org/W2126590220","https://openalex.org/W2126711987","https://openalex.org/W2159381752","https://openalex.org/W2160178218"],"related_works":["https://openalex.org/W2364382882","https://openalex.org/W2146997899","https://openalex.org/W2026697457","https://openalex.org/W2501849745","https://openalex.org/W2004985727","https://openalex.org/W2061004850","https://openalex.org/W2004482118","https://openalex.org/W3169685561","https://openalex.org/W2914983903","https://openalex.org/W1984738873"],"abstract_inverted_index":{"An":[0],"algorithm":[1],"is":[2,35],"given":[3,27],"for":[4,14],"constructing":[5],"a":[6,26],"binary":[7],"tree":[8],"of":[9,32,63],"minimum":[10],"weighted":[11],"path":[12,23],"length":[13,24],"n":[15],"nonnegative":[16],"weights":[17],"under":[18,67],"the":[19,48,61],"constraint":[20,46],"that":[21],"no":[22],"exceed":[25],"bound":[28],"L.":[29],"The":[30],"number":[31],"operations":[33],"required":[34],"proportional":[36],"to":[37],"$Ln^2":[38],"$.":[39],"Such":[40],"problems,":[41],"which":[42],"impose":[43],"an":[44],"additional":[45],"on":[47],"usual":[49],"Huffman":[50],"tree,":[51],"arise":[52],"in":[53],"many":[54],"applications,":[55],"including":[56],"computer":[57],"file":[58],"searching":[59],"and":[60],"construction":[62],"optimal":[64],"prefix":[65],"codes":[66],"certain":[68],"practical":[69],"conditions.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}