{"id":"https://openalex.org/W2011616559","doi":"https://doi.org/10.1142/s0129053392000079","title":"LOWER BOUNDS TO THE EXTERNAL PATHLENGTH OF A LOPSIDED BINARY TREE","display_name":"LOWER BOUNDS TO THE EXTERNAL PATHLENGTH OF A LOPSIDED BINARY TREE","publication_year":1992,"publication_date":"1992-09-01","ids":{"openalex":"https://openalex.org/W2011616559","doi":"https://doi.org/10.1142/s0129053392000079","mag":"2011616559"},"language":"en","primary_location":{"id":"doi:10.1142/s0129053392000079","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053392000079","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed 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/A5108272215","display_name":"Ch. V. Sastry","orcid":null},"institutions":[{"id":"https://openalex.org/I16292982","display_name":"National Institute of Technology Rourkela","ror":"https://ror.org/011gmn932","country_code":"IN","type":"education","lineage":["https://openalex.org/I16292982"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"C. V. SASTRY","raw_affiliation_strings":["Department of Computer Science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India","institution_ids":["https://openalex.org/I16292982"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113332134","display_name":"Jatin Kumar Pradhan","orcid":null},"institutions":[{"id":"https://openalex.org/I16292982","display_name":"National Institute of Technology Rourkela","ror":"https://ror.org/011gmn932","country_code":"IN","type":"education","lineage":["https://openalex.org/I16292982"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"J. PRADHAN","raw_affiliation_strings":["Department of Computer Science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Engineering and Applications, Regional Engineering College, Rourkela, Orissa, India - 769008, India","institution_ids":["https://openalex.org/I16292982"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108272215"],"corresponding_institution_ids":["https://openalex.org/I16292982"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12329144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"03","first_page":"169","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9878000020980835,"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.9878000020980835,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9775000214576721,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9652000069618225,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5632878541946411},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.49985313415527344},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47669240832328796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40385496616363525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3653998374938965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3629630506038666},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13447225093841553}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5632878541946411},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.49985313415527344},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47669240832328796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40385496616363525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3653998374938965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3629630506038666},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13447225093841553}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129053392000079","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053392000079","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed 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":0,"referenced_works":[],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2902549273","https://openalex.org/W2981001626","https://openalex.org/W2357738827","https://openalex.org/W1966383678","https://openalex.org/W2486717996","https://openalex.org/W3107197685","https://openalex.org/W2790184291"],"abstract_inverted_index":{"Binary":[0],"search":[1,16],"trees":[2],"with":[3],"costs":[4],"\u03b1":[5],"and":[6,11,60],"\u03b2":[7],"on":[8],"the":[9,21,35,46,52,61,70,81,86,93],"left":[10],"right":[12],"edges":[13],"(lopsided":[14],"binary":[15,40,83],"trees)":[17],"are":[18],"important":[19],"in":[20,57],"construction":[22],"of":[23,38],"optimum":[24],"prefix":[25],"codes.":[26],"In":[27],"this":[28],"paper":[29],"we":[30],"derive":[31],"lower":[32,47,94],"bounds":[33],"for":[34],"external":[36],"pathlengths":[37],"lopsided":[39,82],"trees.":[41],"It":[42],"is":[43,49,64,73,89],"found":[44],"that":[45],"bound":[48],"tight":[50],"if":[51],"cost":[53,59,71,87],"difference":[54,56,72,88],"(the":[55],"maximum":[58],"minimum":[62],"cost)":[63],"small":[65],"but":[66],"quite":[67],"sharp":[68],"when":[69,85],"large.":[74],"We":[75],"suggest":[76],"alternative":[77],"ways":[78],"to":[79,91],"construct":[80],"tree":[84],"high":[90],"improve":[92],"bound.":[95]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}