{"id":"https://openalex.org/W1802147424","doi":"https://doi.org/10.1007/3-540-46691-6_6","title":"The Complexity of Rebalancing a Binary Search Tree","display_name":"The Complexity of Rebalancing a Binary Search Tree","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1802147424","doi":"https://doi.org/10.1007/3-540-46691-6_6","mag":"1802147424"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46691-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46691-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["BRICS, Department of Computer Science, Aarhus University, \u00c5rhus C, Denmark","Aarhus University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, Aarhus University, \u00c5rhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021765002"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7776197791099548},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.752581775188446},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6885009407997131},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6617653369903564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6375206112861633},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5807071328163147},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5793755054473877},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5705984234809875},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5464479327201843},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5387391448020935},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.5366166830062866},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5116379857063293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.463136225938797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4525347352027893},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4487350583076477},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4458146095275879},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44225844740867615},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42897146940231323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3938295841217041},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.35288333892822266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35127195715904236},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.33449113368988037},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.1710985004901886},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16746798157691956},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08420580625534058},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.05941992998123169}],"concepts":[{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7776197791099548},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.752581775188446},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6885009407997131},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6617653369903564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6375206112861633},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5807071328163147},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5793755054473877},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5705984234809875},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5464479327201843},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5387391448020935},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.5366166830062866},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5116379857063293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.463136225938797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4525347352027893},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4487350583076477},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4458146095275879},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44225844740867615},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42897146940231323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3938295841217041},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.35288333892822266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35127195715904236},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33449113368988037},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.1710985004901886},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16746798157691956},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08420580625534058},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.05941992998123169},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/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.1007/3-540-46691-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46691-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1514315450","https://openalex.org/W1522921684","https://openalex.org/W1543430906","https://openalex.org/W1543525280","https://openalex.org/W1561607996","https://openalex.org/W1600795850","https://openalex.org/W1971131533","https://openalex.org/W1987927249","https://openalex.org/W1992641315","https://openalex.org/W2017602223","https://openalex.org/W2018097735","https://openalex.org/W2021615496","https://openalex.org/W2026166434"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W2364382882","https://openalex.org/W2146997899","https://openalex.org/W2130055503","https://openalex.org/W2004985727","https://openalex.org/W2082860502","https://openalex.org/W2501849745","https://openalex.org/W1992432548","https://openalex.org/W1488483150","https://openalex.org/W1802147424"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}