{"id":"https://openalex.org/W1958605991","doi":"https://doi.org/10.1145/2689412","title":"Rank-Balanced Trees","display_name":"Rank-Balanced Trees","publication_year":2015,"publication_date":"2015-06-02","ids":{"openalex":"https://openalex.org/W1958605991","doi":"https://doi.org/10.1145/2689412","mag":"1958605991"},"language":"en","primary_location":{"id":"doi:10.1145/2689412","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2689412","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, PA, United States","Carnegie Mellon University, PA, United States#TAB#"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, PA, United States","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, PA, United States#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103920769","display_name":"Siddhartha Sen","orcid":null},"institutions":[{"id":"https://openalex.org/I4401726785","display_name":"Microsoft Research New York City (United States)","ror":"https://ror.org/056zprp28","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4401726785"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha Sen","raw_affiliation_strings":["Microsoft Research, New York, NY, United States","Microsoft Research, New York, NY, United States#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, New York, NY, United States","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4401726785"]},{"raw_affiliation_string":"Microsoft Research, New York, NY, United States#TAB#","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4401726785"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University and Intertrust Technologies, Princeton, NJ, United States"],"affiliations":[{"raw_affiliation_string":"Princeton University and Intertrust Technologies, Princeton, NJ, United States","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.3453,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85992599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9927999973297119,"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/amortized-analysis","display_name":"Amortized analysis","score":0.7420873045921326},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7250349521636963},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7091935873031616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6751110553741455},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6652878522872925},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6450238227844238},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6217755079269409},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5089120864868164},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5073792338371277},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.4924386441707611},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.4899296164512634},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.4663616418838501},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42150020599365234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36618417501449585},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.2962653934955597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28661927580833435},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2802792191505432},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2598172128200531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2184179127216339},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.09624618291854858}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7420873045921326},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7250349521636963},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7091935873031616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6751110553741455},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6652878522872925},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6450238227844238},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6217755079269409},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5089120864868164},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5073792338371277},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.4924386441707611},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4899296164512634},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.4663616418838501},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42150020599365234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36618417501449585},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.2962653934955597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28661927580833435},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2802792191505432},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2598172128200531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2184179127216339},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.09624618291854858},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2689412","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2689412","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W41435888","https://openalex.org/W172574161","https://openalex.org/W1489861152","https://openalex.org/W1504640095","https://openalex.org/W1542185767","https://openalex.org/W1549335217","https://openalex.org/W1972027649","https://openalex.org/W1987927249","https://openalex.org/W2006820476","https://openalex.org/W2011933350","https://openalex.org/W2017602223","https://openalex.org/W2020060774","https://openalex.org/W2021573024","https://openalex.org/W2021615496","https://openalex.org/W2026166434","https://openalex.org/W2027795789","https://openalex.org/W2033584818","https://openalex.org/W2050529741","https://openalex.org/W2055947636","https://openalex.org/W2071733808","https://openalex.org/W2077180154","https://openalex.org/W2142753649","https://openalex.org/W2161420356","https://openalex.org/W2753176400","https://openalex.org/W2901608006","https://openalex.org/W2902976706","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2130055503","https://openalex.org/W2364382882","https://openalex.org/W2022598760","https://openalex.org/W2038309235","https://openalex.org/W2072157347","https://openalex.org/W2004985727","https://openalex.org/W2026697457","https://openalex.org/W1488483150","https://openalex.org/W1536590737","https://openalex.org/W1958605991"],"abstract_inverted_index":{"Since":[0],"the":[1,39,52,61,104,132,168,217,221,224,243],"invention":[2],"of":[3,10,42,63,88,100,144,147,155,163,170,179,216,223],"AVL":[4,81,93,106,165],"trees":[5,13,44,146,184,206],"in":[6,21,72,140,191,204,212,229,233,235],"1962,":[7],"many":[8],"kinds":[9,87,143],"binary":[11,73,102],"search":[12],"have":[14],"been":[15,47],"proposed.":[16],"Notable":[17],"are":[18,56,150],"red-black":[19,83,181],"trees,":[20,82,84,94],"which":[22,148,226,236],"bottom-up":[23],"rebalancing":[24,116,190,207,218],"after":[25,117],"an":[26,118,164],"insertion":[27,119],"or":[28,120,134],"deletion":[29,121,138],"takes":[30,122],"O(1)":[31,35,123,192],"amortized":[32,124,193],"time":[33,125,239],"and":[34,65,85,126,173,232],"rotations":[36,136,237],"worst-case.":[37],"But":[38],"design":[40],"space":[41],"balanced":[43,89,101,145],"has":[45],"not":[46],"fully":[48],"explored.":[49],"We":[50,58],"continue":[51],"exploration.":[53],"Our":[54],"contributions":[55],"three:":[57],"systematically":[59],"study":[60],"use":[62,197],"ranks":[64],"rank":[66,78],"differences":[67,79],"to":[68,201],"define":[69],"height-based":[70],"balance":[71],"trees.":[74,90],"Different":[75],"invariants":[76],"on":[77,242],"yield":[80],"other":[86,142],"By":[91],"relaxing":[92],"we":[95,113,149,196],"obtain":[96],"a":[97,156,180],"new":[98],"kind":[99],"tree,":[103,225],"weak":[105],"tree":[107,158,166],"(wavl":[108],"tree)":[109],",":[110],"whose":[111],"properties":[112],"develop.":[114],"Bottom-up":[115],"at":[127,220],"most":[128,215],"two":[129],"rotations,":[130],"improving":[131],"three":[133],"more":[135],"per":[137],"needed":[139],"all":[141],"aware.":[151],"The":[152],"height":[153],"bound":[154],"wavl":[157,205],"degrades":[159],"gracefully":[160],"from":[161],"that":[162,178,203,240],"as":[167],"number":[169],"deletions":[171],"increases":[172],"is":[174,219,227],"never":[175],"worse":[176],"than":[177],"tree.":[182],"Wavl":[183],"also":[185],"support":[186],"top-down,":[187],"fixed":[188],"look-ahead":[189],"time.":[194],"Finally,":[195],"exponential":[198],"potential":[199],"functions":[200],"prove":[202],"steps":[208],"occur":[209],"exponentially":[210],"infrequently":[211],"rank.":[213],"Thus,":[214],"bottom":[222],"crucial":[228],"concurrent":[230],"applications":[231],"those":[234],"take":[238],"depends":[241],"subtree":[244],"size.":[245]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}