{"id":"https://openalex.org/W2057600669","doi":"https://doi.org/10.1142/s012905419400013x","title":"DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING","display_name":"DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2057600669","doi":"https://doi.org/10.1142/s012905419400013x","mag":"2057600669"},"language":"en","primary_location":{"id":"doi:10.1142/s012905419400013x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905419400013x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5055606455","display_name":"Rudi Maelbrancke","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"RUDI MAELBR\u00c1NCKE","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109867643","display_name":"Henk Olivi\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"HENK OLIVI\u00c9","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"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":0,"citation_normalized_percentile":{"value":0.2427596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"05","issue":"03n04","first_page":"247","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7505788207054138},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6756901741027832},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.568227231502533},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.567678689956665},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5450239181518555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.544910192489624},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5409409403800964},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5181073546409607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5171922445297241},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.48405805230140686},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4616734981536865},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.46080920100212097},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4498459994792938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41813090443611145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35593098402023315},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3173231780529022},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.22428038716316223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17535677552223206}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7505788207054138},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6756901741027832},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.568227231502533},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.567678689956665},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5450239181518555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.544910192489624},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5409409403800964},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5181073546409607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5171922445297241},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.48405805230140686},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4616734981536865},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.46080920100212097},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4498459994792938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41813090443611145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35593098402023315},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3173231780529022},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.22428038716316223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17535677552223206},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905419400013x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905419400013x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/W2022598760","https://openalex.org/W2061004850","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W2364382882","https://openalex.org/W2004985727","https://openalex.org/W1510719821","https://openalex.org/W2072157347","https://openalex.org/W3022865202","https://openalex.org/W2038309235"],"abstract_inverted_index":{"A":[0],"simple":[1],"algorithm":[2,19,45],"is":[3,23,36,58],"given":[4],"to":[5,32,41,49,65],"rebalance":[6],"a":[7,15,71],"binary":[8],"search":[9],"tree":[10],"of":[11,28,53],"optimal":[12],"height":[13],"after":[14],"single":[16],"update.":[17,62],"The":[18],"uses":[20],"time":[21],"which":[22],"linear":[24],"in":[25],"the":[26],"number":[27],"nodes.":[29],"In":[30],"comparison":[31],"previous":[33,76],"algorithms":[34],"it":[35,57,69],"short":[37],"and":[38,56],"very":[39],"easy":[40],"implement.":[42],"Moreover,":[43],"this":[44],"can":[46],"be":[47],"used":[48],"implement":[50],"other":[51],"classes":[52],"balanced":[54,67],"trees":[55,68],"suitable":[59],"for":[60],"each":[61],"When":[63],"applied":[64],"perfectly":[66],"has":[70],"lower":[72],"average":[73],"cost":[74],"than":[75],"algorithms.":[77]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}