{"id":"https://openalex.org/W1514315450","doi":"https://doi.org/10.1007/3-540-61422-2_151","title":"Binary search trees: How low can you go?","display_name":"Binary search trees: How low can you go?","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1514315450","doi":"https://doi.org/10.1007/3-540-61422-2_151","mag":"1514315450"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61422-2_151","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_151","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/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, DK-5230, Odense M, Denmark","Odense University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, DK-5230, Odense M, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5021765002"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"428","last_page":"439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.837178111076355},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7240695953369141},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7182488441467285},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6385665535926819},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6190779805183411},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6127222776412964},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.5598627924919128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5133158564567566},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.49391990900039673},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4813162088394165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3879147171974182},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37832877039909363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.336436003446579},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.28539353609085083},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11259683966636658},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.09898170828819275},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.09592369198799133},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08254668116569519}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.837178111076355},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7240695953369141},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7182488441467285},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6385665535926819},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6190779805183411},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6127222776412964},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.5598627924919128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5133158564567566},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.49391990900039673},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4813162088394165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3879147171974182},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37832877039909363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336436003446579},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28539353609085083},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11259683966636658},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.09898170828819275},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.09592369198799133},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08254668116569519},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":2,"locations":[{"id":"doi:10.1007/3-540-61422-2_151","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_151","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:CiteSeerX.psu:10.1.1.51.3458","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.3458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.imada.ou.dk/pub/papers/pp-1996/13.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W134753291","https://openalex.org/W1518873433","https://openalex.org/W1522921684","https://openalex.org/W1543430906","https://openalex.org/W1543525280","https://openalex.org/W1543575092","https://openalex.org/W1561607996","https://openalex.org/W1577072106","https://openalex.org/W1624393875","https://openalex.org/W1971131533","https://openalex.org/W1993762176","https://openalex.org/W2018097735","https://openalex.org/W2021615496","https://openalex.org/W2026511056","https://openalex.org/W2134458085","https://openalex.org/W2275586583","https://openalex.org/W6605182955","https://openalex.org/W6605508220","https://openalex.org/W6694427524"],"related_works":["https://openalex.org/W2130055503","https://openalex.org/W2093708041","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2371680642","https://openalex.org/W2135212710","https://openalex.org/W2086158775","https://openalex.org/W2010914215","https://openalex.org/W1958605991","https://openalex.org/W2034114460"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}