{"id":"https://openalex.org/W1495479358","doi":"https://doi.org/10.1007/11841036_63","title":"Skewed Binary Search Trees","display_name":"Skewed Binary Search Trees","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1495479358","doi":"https://doi.org/10.1007/11841036_63","mag":"1495479358"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_63","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":"conference-paper","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus N, Denmark","BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus, Denmark#TAB#","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013884110","display_name":"Gabriel Moruz","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gabriel Moruz","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus N, Denmark","BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, \u00c5rhus, Denmark#TAB#","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4885,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.56052396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"708","last_page":"719"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.978600025177002,"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/T11478","display_name":"Caching and Content Delivery","score":0.9782999753952026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.8240524530410767},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.8089941740036011},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7647255659103394},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7208454012870789},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.7022547125816345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6746442317962646},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5887886881828308},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5777617692947388},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.546570360660553},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.5413740277290344},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4813478887081146},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.478687584400177},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4539801776409149},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4287651777267456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42420724034309387},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4162466526031494},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3110106587409973},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30867132544517517},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.27242812514305115},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.258780837059021},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10146200656890869}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.8240524530410767},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.8089941740036011},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7647255659103394},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7208454012870789},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.7022547125816345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6746442317962646},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5887886881828308},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5777617692947388},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.546570360660553},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.5413740277290344},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4813478887081146},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.478687584400177},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4539801776409149},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4287651777267456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42420724034309387},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4162466526031494},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3110106587409973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30867132544517517},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27242812514305115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.258780837059021},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10146200656890869},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11841036_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_63","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"},{"id":"pmh:oai:pure.atira.dk:publications/a82cb560-ce41-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/a82cb560-ce41-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S & Moruz, G 2006, Skewed Binary Search Trees. in Y Azar & T Erlebach (eds), Algorithms \u2013 ESA 2006 : 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings. Springer, Lecture Notes in Computer Science, vol. 4168, pp. 708-719, 14th Annual European Symposium on Algorithms. ESA 2006, Zurich, Switzerland, 11/09/2006. https://doi.org/10.1007/11841036_63","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W83289625","https://openalex.org/W89012702","https://openalex.org/W564800084","https://openalex.org/W1539580421","https://openalex.org/W1548333879","https://openalex.org/W1574082713","https://openalex.org/W1660264423","https://openalex.org/W1857323784","https://openalex.org/W2017799838","https://openalex.org/W2018665307","https://openalex.org/W2038142281","https://openalex.org/W2046441184","https://openalex.org/W2078335579","https://openalex.org/W2083576929","https://openalex.org/W2095875205","https://openalex.org/W2097224604","https://openalex.org/W2098130516","https://openalex.org/W2172457606","https://openalex.org/W2185118258","https://openalex.org/W2483610301","https://openalex.org/W2498714246","https://openalex.org/W2615963353","https://openalex.org/W2901608006","https://openalex.org/W2951723302"],"related_works":["https://openalex.org/W2364382882","https://openalex.org/W2501849745","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","https://openalex.org/W1973074590"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}