{"id":"https://openalex.org/W2129066216","doi":"https://doi.org/10.1109/sfcs.1976.26","title":"Self-organizing binary search trees","display_name":"Self-organizing binary search trees","publication_year":1976,"publication_date":"1976-10-01","ids":{"openalex":"https://openalex.org/W2129066216","doi":"https://doi.org/10.1109/sfcs.1976.26","mag":"2129066216"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1976.26","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1976.26","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"17th Annual Symposium on Foundations of Computer Science (sfcs 1976)","raw_type":"proceedings-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/A5052923734","display_name":"Brian Allen","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]},{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Brian Allen","raw_affiliation_strings":["Department of Computer Science, University of Waterloo, Waterloo, ONT, Canada","Department of Computer Science, Yale University, 10 Hillhouse, New Haven, CT and University of Waterloo, Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Computer Science, Yale University, 10 Hillhouse, New Haven, CT and University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483","https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061696421","display_name":"Ian Munro","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ian Munro","raw_affiliation_strings":["Department of Computer Science, University of Waterloo, Waterloo, ONT, Canada","Dept, of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Dept, of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052923734"],"corresponding_institution_ids":["https://openalex.org/I151746483","https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":1.0192,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76598837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"iii","issue":null,"first_page":"166","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9861999750137329,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9848999977111816,"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/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7944790124893188},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7437431812286377},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6959300637245178},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6949139833450317},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6387239098548889},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5936952829360962},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5414353609085083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5285812020301819},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5225207805633545},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5150668025016785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5037786364555359},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49898552894592285},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.4966936707496643},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.49457141757011414},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4757906198501587},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4306217432022095},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4235674738883972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4007090628147125},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.34097686409950256},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2332257628440857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17915788292884827}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7944790124893188},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7437431812286377},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6959300637245178},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6949139833450317},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6387239098548889},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5936952829360962},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5414353609085083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5285812020301819},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5225207805633545},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5150668025016785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5037786364555359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49898552894592285},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.4966936707496643},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49457141757011414},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4757906198501587},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4306217432022095},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4235674738883972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4007090628147125},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34097686409950256},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2332257628440857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17915788292884827},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"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.1109/sfcs.1976.26","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1976.26","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"17th Annual Symposium on Foundations of Computer Science (sfcs 1976)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2016153661","https://openalex.org/W2092885083","https://openalex.org/W2752061190"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2364382882","https://openalex.org/W2361906991","https://openalex.org/W2112680985","https://openalex.org/W2082860502","https://openalex.org/W1979520615","https://openalex.org/W2910653847"],"abstract_inverted_index":{"We":[0,82],"consider":[1,84],"heuristics":[2],"which":[3,90],"attempt":[4],"to":[5,29,34,66,77],"maintain":[6],"a":[7,12,41,57],"binary":[8,50],"search":[9,38,51],"tree":[10,95],"in":[11,89,93],"near":[13],"optimal":[14,48],"form,":[15],"assuming":[16],"that":[17,45],"elements":[18,91],"are":[19],"requested":[20],"with":[21],"fixed,":[22],"but":[23],"unknown,":[24],"independent":[25],"probabilities.":[26],"A":[27],"\"move":[28,76],"root\"":[30,78],"heuristic":[31,79],"is":[32,63,80],"shown":[33,64],"yield":[35],"an":[36,47],"expected":[37],"time":[39],"within":[40],"constant":[42],"factor":[43],"of":[44,46,72,74,100],"static":[49],"tree.":[52],"On":[53],"the":[54,75,85,94],"other":[55],"hand,":[56],"closely":[58],"related":[59],"\"simple":[60],"exchange\"":[61],"technique":[62],"not":[65,92],"have":[67,97],"this":[68],"property.":[69],"The":[70],"rate":[71],"convergence":[73],"discussed.":[81],"also":[83],"more":[86],"general":[87],"case":[88],"may":[96],"non-zero":[98],"probability":[99],"being":[101],"requested.":[102]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}