{"id":"https://openalex.org/W122288055","doi":"https://doi.org/10.1007/978-3-642-03367-4_21","title":"Efficient Construction of Near-Optimal Binary and Multiway Search Trees","display_name":"Efficient Construction of Near-Optimal Binary and Multiway Search Trees","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W122288055","doi":"https://doi.org/10.1007/978-3-642-03367-4_21","mag":"122288055"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03367-4_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_21","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/A5013674788","display_name":"Prosenjit Bose","orcid":"https://orcid.org/0000-0002-8906-0573"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Prosenjit Bose","raw_affiliation_strings":["School of Computer Science, Carleton University, Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","School of Computer Science, Carleton University, Ontario, Canada K1S 5B6#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ontario, Canada K1S 5B6#TAB#","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024687341","display_name":"Karim Dou\u00efeb","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Karim Dou\u00efeb","raw_affiliation_strings":["School of Computer Science, Carleton University, Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","School of Computer Science, Carleton University, Ontario, Canada K1S 5B6#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Herzberg Building 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ontario, Canada K1S 5B6#TAB#","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013674788"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1578,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77617625,"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":"230","last_page":"241"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9983999729156494,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/binary-search-tree","display_name":"Binary search tree","score":0.7884659767150879},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.755768895149231},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6882716417312622},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6198400855064392},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.590879499912262},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.581599235534668},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5436676144599915},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.537794828414917},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.533148467540741},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.524077832698822},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49235475063323975},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.48414358496665955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4747629165649414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4109266400337219},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4089028835296631},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3774723410606384},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3644706904888153},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.27857333421707153},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.05879020690917969}],"concepts":[{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7884659767150879},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.755768895149231},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6882716417312622},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6198400855064392},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.590879499912262},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.581599235534668},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5436676144599915},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.537794828414917},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.533148467540741},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.524077832698822},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49235475063323975},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.48414358496665955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4747629165649414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4109266400337219},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4089028835296631},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3774723410606384},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3644706904888153},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.27857333421707153},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.05879020690917969},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-03367-4_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_21","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W199376359","https://openalex.org/W1506292197","https://openalex.org/W1508046511","https://openalex.org/W1964669678","https://openalex.org/W1988325634","https://openalex.org/W1989524012","https://openalex.org/W1992695685","https://openalex.org/W1995875735","https://openalex.org/W2000568806","https://openalex.org/W2003241571","https://openalex.org/W2022352965","https://openalex.org/W2046792522","https://openalex.org/W2064947478","https://openalex.org/W2065954102","https://openalex.org/W2068373264","https://openalex.org/W2086815838","https://openalex.org/W2092885083","https://openalex.org/W2098155821","https://openalex.org/W2901608006","https://openalex.org/W3021119008","https://openalex.org/W3198160809","https://openalex.org/W6633749307"],"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":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
