{"id":"https://openalex.org/W2033539581","doi":"https://doi.org/10.1007/pl00013303","title":"Relaxed balance for search trees with local rebalancing","display_name":"Relaxed balance for search trees with local rebalancing","publication_year":2001,"publication_date":"2001-07-01","ids":{"openalex":"https://openalex.org/W2033539581","doi":"https://doi.org/10.1007/pl00013303","mag":"2033539581"},"language":"en","primary_location":{"id":"doi:10.1007/pl00013303","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00013303","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-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/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":true,"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, 5230 Odense M, Denmark (e-mail: kslarsen@imada.sdu.dk)\n, , , , , , DK","Department of Mathematics and Computer Science, Odense University, Odense M, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Main campus: Odense University, Campusvej 55, 5230 Odense M, Denmark (e-mail: kslarsen@imada.sdu.dk)\n, , , , , , DK","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Odense M, Denmark","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113581859","display_name":"Thomas Ottmann","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Ottmann","raw_affiliation_strings":["Institute of Computer Science, Freiburg University, Am Flughafen 17, 79110 Freiburg, Germany (e-mail: ottmann@informatik.uni-freiburg.de)\n, , , , , , DE","Institute of Computer Science, Freiburg University, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Freiburg University, Am Flughafen 17, 79110 Freiburg, Germany (e-mail: ottmann@informatik.uni-freiburg.de)\n, , , , , , DE","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Institute of Computer Science, Freiburg University, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060919010","display_name":"Eljas Soisalon-Soininen","orcid":null},"institutions":[{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Eljas Soisalon-Soininen","raw_affiliation_strings":["Laboratory of Information Processing Science, Helsinki University of Technology, Otakaari 1 A, 02150 Espoo, Finland (e-mail: ess@cs.hut.fi)\n, , , , , , FI","Laboratory of Information Processing Science, Helsinki University of Technology , Espoo , Finland"],"affiliations":[{"raw_affiliation_string":"Laboratory of Information Processing Science, Helsinki University of Technology, Otakaari 1 A, 02150 Espoo, Finland (e-mail: ess@cs.hut.fi)\n, , , , , , FI","institution_ids":["https://openalex.org/I32943570"]},{"raw_affiliation_string":"Laboratory of Information Processing Science, Helsinki University of Technology , Espoo , Finland","institution_ids":["https://openalex.org/I32943570"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000210653"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.0902,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83808047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"37","issue":"10","first_page":"743","last_page":"763"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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.9980999827384949,"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.9972000122070312,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/computer-science","display_name":"Computer science","score":0.7508584856987},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7100890874862671},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.689117431640625},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6882967948913574},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6397756338119507},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.5564346313476562},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5191423296928406},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5067651867866516},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.44831377267837524},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.405389666557312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39775997400283813},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.37338125705718994},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3150399923324585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2711222171783447},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0813068151473999}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7508584856987},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7100890874862671},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.689117431640625},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6882967948913574},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6397756338119507},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.5564346313476562},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5191423296928406},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5067651867866516},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.44831377267837524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.405389666557312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39775997400283813},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.37338125705718994},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3150399923324585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2711222171783447},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0813068151473999},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/pl00013303","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00013303","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/bfdd24c0-41da-11dd-9fbe-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/bfdd24c0-41da-11dd-9fbe-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":"Larsen, K S, Ottmann, T & Soisalon-Soininen, E 2001, 'Relaxed Balance for Search Trees with Local Rebalancing', Acta Informatica, vol. 37, no. 10, pp. 743-763. https://doi.org/10.1007/PL00013303","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.2313","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.2313","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-1997/14.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1514971587","https://openalex.org/W1523925876","https://openalex.org/W1549335217","https://openalex.org/W1552969166","https://openalex.org/W1577409284","https://openalex.org/W1885915074","https://openalex.org/W1968477279","https://openalex.org/W1972027649","https://openalex.org/W1973610879","https://openalex.org/W1974269564","https://openalex.org/W1984825199","https://openalex.org/W1989218322","https://openalex.org/W2011297770","https://openalex.org/W2012180059","https://openalex.org/W2017602223","https://openalex.org/W2021573024","https://openalex.org/W2021615496","https://openalex.org/W2026166434","https://openalex.org/W2028764399","https://openalex.org/W2050529741","https://openalex.org/W2055947636","https://openalex.org/W2071391045","https://openalex.org/W2077180154","https://openalex.org/W2082993995","https://openalex.org/W2145052180","https://openalex.org/W2753176400","https://openalex.org/W2901608006","https://openalex.org/W2914012253"],"related_works":["https://openalex.org/W1608806855","https://openalex.org/W2023505575","https://openalex.org/W2104603305","https://openalex.org/W1850053445","https://openalex.org/W1578204257","https://openalex.org/W2313503008","https://openalex.org/W2047588290","https://openalex.org/W1972912085","https://openalex.org/W2121551448","https://openalex.org/W2121346934"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}