{"id":"https://openalex.org/W2016857845","doi":"https://doi.org/10.1137/0218004","title":"Lower Bounds for Accessing Binary Search Trees with Rotations","display_name":"Lower Bounds for Accessing Binary Search Trees with Rotations","publication_year":1989,"publication_date":"1989-02-01","ids":{"openalex":"https://openalex.org/W2016857845","doi":"https://doi.org/10.1137/0218004","mag":"2016857845"},"language":"en","primary_location":{"id":"doi:10.1137/0218004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5024045291","display_name":"Robert Wilber","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert Wilber","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024045291"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":2.0304,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.88305755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"18","issue":"1","first_page":"56","last_page":"67"},"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.9997000098228455,"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.9991999864578247,"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/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.8071521520614624},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.8006840944290161},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7486404180526733},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.7130541801452637},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6699230670928955},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6483078002929688},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6272629499435425},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.6057388782501221},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5779981017112732},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5637919902801514},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5608012080192566},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5209351778030396},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5165497064590454},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5028619170188904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4941299259662628},{"id":"https://openalex.org/keywords/random-permutation","display_name":"Random permutation","score":0.4897923469543457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48031800985336304},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.46406492590904236},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.44131699204444885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3852421045303345},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.33048027753829956},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20859679579734802},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.2028927206993103},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12249469757080078}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.8071521520614624},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.8006840944290161},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7486404180526733},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.7130541801452637},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6699230670928955},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6483078002929688},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6272629499435425},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6057388782501221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5779981017112732},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5637919902801514},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5608012080192566},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5209351778030396},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5165497064590454},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5028619170188904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4941299259662628},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.4897923469543457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48031800985336304},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.46406492590904236},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.44131699204444885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3852421045303345},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33048027753829956},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20859679579734802},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2028927206993103},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12249469757080078},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":6,"referenced_works":["https://openalex.org/W1972027649","https://openalex.org/W2021615496","https://openalex.org/W2026166434","https://openalex.org/W2078913074","https://openalex.org/W2095120546","https://openalex.org/W2130055503"],"related_works":["https://openalex.org/W2364382882","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2146997899","https://openalex.org/W2038309235","https://openalex.org/W2061004850","https://openalex.org/W2004482118","https://openalex.org/W2112680985","https://openalex.org/W1973074590","https://openalex.org/W2004985727"],"abstract_inverted_index":{"Two":[0],"methods":[1],"are":[2],"given":[3],"for":[4,95],"obtaining":[5],"lower":[6],"bounds":[7],"on":[8,32],"the":[9,33,36,45,51,61,79,90,96,99],"cost":[10,81],"of":[11,15,82],"accessing":[12,42,83],"a":[13,18,25],"sequence":[14,38],"nodes":[16],"in":[17,24,50,71,86],"symmetrically":[19],"ordered":[20],"binary":[21],"search":[22],"tree,":[23],"model":[26,88],"where":[27,98],"rotations":[28],"can":[29,57],"be":[30,48,58],"done":[31,49],"tree":[34,100],"and":[35],"entire":[37],"is":[39,75,89,94,101],"known":[40],"before":[41],"begins":[43],"(but":[44],"accesses":[46],"must":[47],"order":[52],"given).":[53],"For":[54],"example,":[55],"it":[56,93],"proven":[59],"that":[60,78],"bit-reversal":[62],"permutation":[63],"requires":[64],"$\\Theta":[65],"(n\\log":[66],"n)$":[67],"time":[68],"to":[69],"access":[70],"this":[72,87],"model.":[73],"It":[74],"also":[76],"shown":[77],"expected":[80],"random":[84],"sequences":[85],"same":[91],"as":[92],"case":[97],"static.":[102]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}