{"id":"https://openalex.org/W1536590737","doi":"https://doi.org/10.1007/3-540-60692-0_59","title":"Path balance heuristic for self-adjusting binary search trees","display_name":"Path balance heuristic for self-adjusting binary search trees","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1536590737","doi":"https://doi.org/10.1007/3-540-60692-0_59","mag":"1536590737"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60692-0_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60692-0_59","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":"book-chapter","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/A5110321433","display_name":"R. Balasubramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R. Balasubramanian","raw_affiliation_strings":["The Institute of Mathematical Sciences, C. I. T. Campus, 600 113, Madras"],"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, C. I. T. Campus, 600 113, Madras","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073311967","display_name":"Venkatesh Raman","orcid":"https://orcid.org/0000-0001-8123-0980"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Venkatesh Raman","raw_affiliation_strings":["The Institute of Mathematical Sciences, C. I. T. Campus, 600 113, Madras"],"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, C. I. T. Campus, 600 113, Madras","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110321433"],"corresponding_institution_ids":["https://openalex.org/I59611059"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4659,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.60217597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"338","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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.8610125780105591},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.8063699007034302},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.8049633502960205},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6975224018096924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6767513155937195},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6269228458404541},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5516291856765747},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5510627627372742},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5506120920181274},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5338121056556702},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5180187821388245},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49651437997817993},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.4846521019935608},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4655739963054657},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40298670530319214},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.39794138073921204},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3762168288230896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3514077961444855},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3343784213066101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26209455728530884},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.2521079182624817},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20488804578781128},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1234292984008789},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11562293767929077},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08087065815925598}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.8610125780105591},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.8063699007034302},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.8049633502960205},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6975224018096924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6767513155937195},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6269228458404541},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5516291856765747},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5510627627372742},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5506120920181274},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5338121056556702},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5180187821388245},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49651437997817993},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.4846521019935608},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4655739963054657},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40298670530319214},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.39794138073921204},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3762168288230896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3514077961444855},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3343784213066101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26209455728530884},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.2521079182624817},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20488804578781128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1234292984008789},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11562293767929077},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08087065815925598},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-60692-0_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60692-0_59","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":12,"referenced_works":["https://openalex.org/W1516506843","https://openalex.org/W1974784305","https://openalex.org/W1987927249","https://openalex.org/W2006820476","https://openalex.org/W2044931094","https://openalex.org/W2068628972","https://openalex.org/W2070091651","https://openalex.org/W2078589215","https://openalex.org/W2130055503","https://openalex.org/W2752885492","https://openalex.org/W3027900649","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2364382882","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W270522628","https://openalex.org/W2146997899","https://openalex.org/W2038309235","https://openalex.org/W2061004850","https://openalex.org/W2004985727","https://openalex.org/W2077383771","https://openalex.org/W2112680985"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}