{"id":"https://openalex.org/W1855982621","doi":"https://doi.org/10.1007/3-540-44634-6_38","title":"Search Trees with Relaxed Balance and Near-Optimal Height","display_name":"Search Trees with Relaxed Balance and Near-Optimal Height","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1855982621","doi":"https://doi.org/10.1007/3-540-44634-6_38","mag":"1855982621"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44634-6_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44634-6_38","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":[{"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":"Rolf Fagerberg","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, building 540, DK-8000, \u00c5rhus C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, building 540, DK-8000, \u00c5rhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012284279","display_name":"Rune Erlend Jensen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rune E. Jensen","raw_affiliation_strings":["ALOC Bonnier A/S, Buchwaldsgade 35, DK-5000, Odense C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALOC Bonnier A/S, Buchwaldsgade 35, DK-5000, Odense C, Denmark","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000210653","display_name":"Kim S. Larsen","orcid":"https://orcid.org/0000-0003-0560-3794"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kim S. Larsen","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark Main Campus: Odense University, Campusvej 55, DK-5230, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark Main Campus: Odense University, Campusvej 55, DK-5230, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"414","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/constant","display_name":"Constant (computer programming)","score":0.7099775671958923},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7020692825317383},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6963855624198914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5487065315246582},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5233651399612427},{"id":"https://openalex.org/keywords/golden-ratio","display_name":"Golden ratio","score":0.4697057902812958},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4672517776489258},{"id":"https://openalex.org/keywords/balance","display_name":"Balance (ability)","score":0.433353066444397},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4254075586795807},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4134022295475006},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4102213382720947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3817254304885864},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.37335580587387085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2527783513069153},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.24285262823104858},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06865185499191284}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7099775671958923},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7020692825317383},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6963855624198914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5487065315246582},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5233651399612427},{"id":"https://openalex.org/C18802822","wikidata":"https://www.wikidata.org/wiki/Q41690","display_name":"Golden ratio","level":2,"score":0.4697057902812958},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4672517776489258},{"id":"https://openalex.org/C168031717","wikidata":"https://www.wikidata.org/wiki/Q1530280","display_name":"Balance (ability)","level":2,"score":0.433353066444397},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4254075586795807},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4134022295475006},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4102213382720947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3817254304885864},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.37335580587387085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2527783513069153},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.24285262823104858},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06865185499191284},{"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},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C99508421","wikidata":"https://www.wikidata.org/wiki/Q2678675","display_name":"Physical medicine and rehabilitation","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-44634-6_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44634-6_38","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:sdu.dk:openaire_cris_publications/08d8f680-4f1f-11dd-b1a1-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/08d8f680-4f1f-11dd-b1a1-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fagerberg, R, Jensen, R E & Larsen, K S 2001, Search Trees with Relaxed Balance and Near-Optimal Height. in Algorithms and Data Structures, 7th International Workshop, WADS 2001. Lecture Notes in Computer Science, vol. 2125, pp. 414-425, Seventh International Workshop on Algorithms and Data Structures, Providence, United States, 08/08/2001. https://doi.org/10.1007/3-540-44634-6_38","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":11,"referenced_works":["https://openalex.org/W1966797788","https://openalex.org/W1968477279","https://openalex.org/W1974269564","https://openalex.org/W1984825199","https://openalex.org/W2011297770","https://openalex.org/W2018097735","https://openalex.org/W2021615496","https://openalex.org/W2055947636","https://openalex.org/W2071391045","https://openalex.org/W2082993995","https://openalex.org/W4241183800"],"related_works":["https://openalex.org/W2130055503","https://openalex.org/W2086158775","https://openalex.org/W1958605991","https://openalex.org/W1837592468","https://openalex.org/W2565735338","https://openalex.org/W2005570743","https://openalex.org/W2955615582","https://openalex.org/W2065457428","https://openalex.org/W2950907886","https://openalex.org/W2181425632"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}