{"id":"https://openalex.org/W2093693833","doi":"https://doi.org/10.1137/0212028","title":"Construction of Optimal $\\alpha $-$\\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval","display_name":"Construction of Optimal $\\alpha $-$\\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval","publication_year":1983,"publication_date":"1983-08-01","ids":{"openalex":"https://openalex.org/W2093693833","doi":"https://doi.org/10.1137/0212028","mag":"2093693833"},"language":"en","primary_location":{"id":"doi:10.1137/0212028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212028","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/A5059466621","display_name":"David M. Choy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David M. Choy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111988132","display_name":"C. K. Wong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. K. Wong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.17246436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"12","issue":"3","first_page":"426","last_page":"446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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.9736999869346619,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.97079998254776,"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/prefix","display_name":"Prefix","score":0.736195981502533},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.7257152795791626},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.6774985790252686},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.6199805736541748},{"id":"https://openalex.org/keywords/alpha","display_name":"Alpha (finance)","score":0.5487518906593323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5460079908370972},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5416581630706787},{"id":"https://openalex.org/keywords/beta","display_name":"BETA (programming language)","score":0.5025951862335205},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4672906994819641},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4566135108470917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43115633726119995},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.42028844356536865},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37515413761138916},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.36495834589004517},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3497365713119507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3344056010246277},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.24568119645118713},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24217167496681213},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.22652453184127808},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13321611285209656},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11306190490722656},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10989782214164734},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.10078790783882141},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08226412534713745}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.736195981502533},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.7257152795791626},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.6774985790252686},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6199805736541748},{"id":"https://openalex.org/C64943373","wikidata":"https://www.wikidata.org/wiki/Q2651003","display_name":"Alpha (finance)","level":4,"score":0.5487518906593323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5460079908370972},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5416581630706787},{"id":"https://openalex.org/C2776174256","wikidata":"https://www.wikidata.org/wiki/Q830842","display_name":"BETA (programming language)","level":2,"score":0.5025951862335205},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4672906994819641},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4566135108470917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43115633726119995},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.42028844356536865},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37515413761138916},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.36495834589004517},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3497365713119507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3344056010246277},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.24568119645118713},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24217167496681213},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.22652453184127808},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13321611285209656},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11306190490722656},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10989782214164734},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.10078790783882141},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08226412534713745},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C49453240","wikidata":"https://www.wikidata.org/wiki/Q1592163","display_name":"Construct validity","level":3,"score":0.0},{"id":"https://openalex.org/C171606756","wikidata":"https://www.wikidata.org/wiki/Q506132","display_name":"Psychometrics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0212028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212028","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":8,"referenced_works":["https://openalex.org/W1980657447","https://openalex.org/W2032661515","https://openalex.org/W2078835214","https://openalex.org/W2088519218","https://openalex.org/W2094396702","https://openalex.org/W2102824199","https://openalex.org/W2126590220","https://openalex.org/W4252040602"],"related_works":["https://openalex.org/W4376140277","https://openalex.org/W2077383771","https://openalex.org/W2091985989","https://openalex.org/W270522628","https://openalex.org/W1997112896","https://openalex.org/W4367055576","https://openalex.org/W1971148082","https://openalex.org/W2146997899","https://openalex.org/W2144672948","https://openalex.org/W2003946312"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4,58],"a":[5],"special":[6],"class":[7],"of":[8,48,69,71],"trees":[9,15,20,38],"called":[10],"$\\alpha":[11],"$-$\\beta":[12],"$":[13],"leaf":[14],"with":[16],"degree":[17],"r.":[18],"These":[19],"arise":[21],"in":[22,45],"information":[23],"retrieval":[24],"problems":[25],"as":[26,28],"well":[27],"prefix":[29],"coding":[30],"problems.":[31,60],"An":[32],"efficient":[33],"method":[34,42],"for":[35],"constructing":[36],"optimal":[37],"is":[39,43,64],"presented.":[40],"The":[41,61],"combinatorial":[44],"nature":[46],"instead":[47],"the":[49,67,72],"integer":[50],"programming":[51],"approach":[52],"followed":[53],"by":[54],"other":[55],"authors":[56],"to":[57,66],"similar":[59],"construction":[62],"time":[63],"linear":[65],"number":[68],"leaves":[70],"tree.":[73]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}