{"id":"https://openalex.org/W2074513192","doi":"https://doi.org/10.1145/100348.100469","title":"Dynamically balancing a binary tree (abstract)","display_name":"Dynamically balancing a binary tree (abstract)","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2074513192","doi":"https://doi.org/10.1145/100348.100469","mag":"2074513192"},"language":"en","primary_location":{"id":"doi:10.1145/100348.100469","doi":"https://doi.org/10.1145/100348.100469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/100348.100469","pdf_url":null,"source":{"id":"https://openalex.org/S7407087687","display_name":"ACM Annual Conference on Computer Science (CSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90","raw_type":"proceedings-article"},"volume":null,"type":"conference-abstract","is_traditional":false,"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/A5074374712","display_name":"Andrew T. Cable","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130186095","display_name":"Sacred Heart University","ror":"https://ror.org/0085j8z36","country_code":"US","type":"education","lineage":["https://openalex.org/I130186095"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew T. Cable","raw_affiliation_strings":["Sacred Heart University, Fairfield, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sacred Heart University, Fairfield, CT","institution_ids":["https://openalex.org/I130186095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072010927","display_name":"Domenick J. Pinto","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130186095","display_name":"Sacred Heart University","ror":"https://ror.org/0085j8z36","country_code":"US","type":"education","lineage":["https://openalex.org/I130186095"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Domenick J. Pinto","raw_affiliation_strings":["Sacred Heart University, Fairfield, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sacred Heart University, Fairfield, CT","institution_ids":["https://openalex.org/I130186095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130186095"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"438","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.0012000000569969416,"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"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-trees","display_name":"binary trees","score":0.8560000061988831},{"id":"https://openalex.org/keywords/tree-balancing","display_name":"tree balancing","score":0.6970000267028809},{"id":"https://openalex.org/keywords/dynamic-rebalancing","display_name":"dynamic rebalancing","score":0.9509999752044678},{"id":"https://openalex.org/keywords/binary-search-trees","display_name":"binary search trees","score":0.6909999847412109},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.5770000219345093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7788716554641724},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7676772475242615},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.7456037402153015},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7118011713027954},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.70703125},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.6621061563491821},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.649631142616272},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6424868106842041},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.6168961524963379},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5600090026855469},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5441069006919861},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5147309303283691},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.48246103525161743},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.46235474944114685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44461682438850403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4189288020133972},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4162251055240631},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41520726680755615},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3519759774208069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14587774872779846},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.14401111006736755},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07731369137763977},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.05260249972343445},{"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.1145/100348.100469","doi":"https://doi.org/10.1145/100348.100469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/100348.100469","pdf_url":null,"source":{"id":"https://openalex.org/S7407087687","display_name":"ACM Annual Conference on Computer Science (CSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2057600669","https://openalex.org/W2064739871","https://openalex.org/W2377396807","https://openalex.org/W2262709502","https://openalex.org/W2897931881","https://openalex.org/W4233465592","https://openalex.org/W2065505971","https://openalex.org/W2015447554","https://openalex.org/W1968269736","https://openalex.org/W2158947202"],"abstract_inverted_index":{"A":[0],"binary":[1],"tree":[2,16,45,50],"is":[3,12,17],"an":[4,37],"excellent":[5],"structure":[6],"for":[7],"storing":[8],"sorted":[9],"data.":[10],"Searching":[11],"optimum":[13],"if":[14],"the":[15,25,49],"balanced.":[18],"The":[19],"following":[20],"algorithm":[21,32],"was":[22],"developed":[23],"with":[24],"help":[26],"of":[27,40],"some":[28],"background":[29],"information.":[30],"This":[31],"has":[33],"proven":[34],"to":[35],"be":[36],"effective":[38],"method":[39],"inserting":[41],"data":[42],"into":[43],"a":[44],"while":[46],"dynamically":[47],"rebalancing":[48],"when":[51],"necessary.":[52]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}