{"id":"https://openalex.org/W2026166434","doi":"https://doi.org/10.1137/0202005","title":"Binary Search Trees of Bounded Balance","display_name":"Binary Search Trees of Bounded Balance","publication_year":1973,"publication_date":"1973-03-01","ids":{"openalex":"https://openalex.org/W2026166434","doi":"https://doi.org/10.1137/0202005","mag":"2026166434"},"language":"en","primary_location":{"id":"doi:10.1137/0202005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202005","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/A5112628541","display_name":"J. Nievergelt","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. Nievergelt","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073186573","display_name":"Edward M. Reingold","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. M. Reingold","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112628541"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.2546,"has_fulltext":false,"cited_by_count":261,"citation_normalized_percentile":{"value":0.96740342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"33","last_page":"43"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9865000247955322,"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/T11567","display_name":"semigroups and automata theory","score":0.984000027179718,"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/ternary-search-tree","display_name":"Ternary search tree","score":0.8712538480758667},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.866997241973877},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7876794338226318},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7609916925430298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5574157238006592},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5387324690818787},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5259014964103699},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5095110535621643},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.4925254285335541},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.48107409477233887},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.47085991501808167},{"id":"https://openalex.org/keywords/balance","display_name":"Balance (ability)","score":0.46421340107917786},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4389655590057373},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4247659146785736},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4173593819141388},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41548609733581543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3725261688232422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3402830958366394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2927964925765991},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.15850961208343506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12988734245300293},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.10024434328079224},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.09981369972229004},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06842270493507385}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.8712538480758667},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.866997241973877},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7876794338226318},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7609916925430298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5574157238006592},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5387324690818787},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5259014964103699},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5095110535621643},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.4925254285335541},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.48107409477233887},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.47085991501808167},{"id":"https://openalex.org/C168031717","wikidata":"https://www.wikidata.org/wiki/Q1530280","display_name":"Balance (ability)","level":2,"score":0.46421340107917786},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4389655590057373},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4247659146785736},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4173593819141388},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41548609733581543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3725261688232422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3402830958366394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2927964925765991},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.15850961208343506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12988734245300293},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.10024434328079224},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.09981369972229004},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06842270493507385},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0202005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202005","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":[{"id":"https://metadata.un.org/sdg/10","score":0.4399999976158142,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W193706516","https://openalex.org/W1982765710","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2097327103","https://openalex.org/W2486717996"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W2364382882","https://openalex.org/W2072924299","https://openalex.org/W2146997899","https://openalex.org/W2112680985","https://openalex.org/W2914983903","https://openalex.org/W2149064492","https://openalex.org/W1575721190","https://openalex.org/W1984738873","https://openalex.org/W1495479358"],"abstract_inverted_index":{"A":[0],"new":[1],"class":[2],"of":[3,9,27,43,50],"binary":[4,51],"search":[5,31,52,69],"trees,":[6],"called":[7],"trees":[8,15,53],"bounded":[10,44],"balance,":[11],"is":[12,33],"introduced.":[13],"These":[14],"are":[16],"easy":[17],"to":[18],"maintain":[19],"in":[20,38,54],"their":[21],"form":[22],"despite":[23],"insertions":[24],"and":[25,29,71],"deletions":[26],"nodes,":[28],"the":[30,65],"time":[32,70],"only":[34],"moderately":[35],"longer":[36],"than":[37],"completely":[39],"balanced":[40],"trees.":[41],"Trees":[42],"balance":[45],"differ":[46],"from":[47],"other":[48],"classes":[49],"that":[55],"they":[56],"contain":[57],"a":[58],"parameter":[59],"which":[60],"can":[61,74],"be":[62,75],"varied":[63],"so":[64],"compromise":[66],"between":[67],"short":[68],"infrequent":[72],"restructuring":[73],"chosen":[76],"arbitrarily.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}