{"id":"https://openalex.org/W1879543997","doi":"https://doi.org/10.25596/jalc-2003-607","title":"New Dynamic Balanced Search Trees with Worst-Case Constant Update Time","display_name":"New Dynamic Balanced Search Trees with Worst-Case Constant Update Time","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1879543997","doi":"https://doi.org/10.25596/jalc-2003-607","mag":"1879543997"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2003-607","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-607","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2003-607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061497405","display_name":"George Lagogiannis","orcid":"https://orcid.org/0000-0001-8040-4125"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Lagogiannis, George","raw_affiliation_strings":["Computer Engineering and Informatics Dept, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Dept, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087360505","display_name":"Christos Makris","orcid":"https://orcid.org/0000-0003-2571-7449"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Makris, Christos","raw_affiliation_strings":["Computer Engineering and Informatics Dept, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Dept, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034355227","display_name":"Yannis Panagis","orcid":"https://orcid.org/0000-0003-0052-9302"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Panagis, Yannis","raw_affiliation_strings":["Computer Engineering and Informatics Dept, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Dept, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065914489","display_name":"Spyros Sioutas","orcid":"https://orcid.org/0000-0003-1825-5565"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Sioutas, Spyros","raw_affiliation_strings":["Computer Engineering and Informatics Dept, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Dept, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086706681","display_name":"Kostas Tsichlas","orcid":"https://orcid.org/0000-0003-4107-9520"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Tsichlas, Kostas","raw_affiliation_strings":["Computer Engineering and Informatics Dept, University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Dept, University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5061497405"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":0.4569,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72219001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"4","first_page":"607","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9908000230789185,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9904000163078308,"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/pointer","display_name":"Pointer (user interface)","score":0.7138203978538513},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6836400032043457},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.6809167265892029},{"id":"https://openalex.org/keywords/fleischer","display_name":"Fleischer","score":0.6327090859413147},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6037741899490356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.570974588394165},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5606562495231628},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5464259386062622},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5289953947067261},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49449393153190613},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.472854882478714},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46223360300064087},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46064335107803345},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.45173320174217224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42384201288223267},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4176318943500519},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40146827697753906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3953145146369934},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.21941590309143066},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.19552430510520935},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1279175877571106}],"concepts":[{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.7138203978538513},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6836400032043457},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6809167265892029},{"id":"https://openalex.org/C2778707992","wikidata":"https://www.wikidata.org/wiki/Q1427812","display_name":"Fleischer","level":3,"score":0.6327090859413147},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6037741899490356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.570974588394165},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5606562495231628},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5464259386062622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5289953947067261},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49449393153190613},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.472854882478714},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46223360300064087},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46064335107803345},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.45173320174217224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42384201288223267},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4176318943500519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40146827697753906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3953145146369934},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.21941590309143066},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.19552430510520935},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1279175877571106},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C154775046","wikidata":"https://www.wikidata.org/wiki/Q188","display_name":"German","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.25596/jalc-2003-607","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-607","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:1879543997","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc8.html#LagogiannisMPST03","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2003-607","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-607","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W1482484961","https://openalex.org/W1921060284","https://openalex.org/W1993762176","https://openalex.org/W2006131099","https://openalex.org/W2009798194","https://openalex.org/W2010483698","https://openalex.org/W2011933350","https://openalex.org/W2037007500","https://openalex.org/W2059868876","https://openalex.org/W2077180154","https://openalex.org/W2079716268","https://openalex.org/W2079716330","https://openalex.org/W2115409696","https://openalex.org/W2134458085","https://openalex.org/W2142947709","https://openalex.org/W2996916404"],"related_works":["https://openalex.org/W2949477394","https://openalex.org/W2048484740","https://openalex.org/W2654913633","https://openalex.org/W1973784010","https://openalex.org/W2498714246","https://openalex.org/W1995186768","https://openalex.org/W3000335563","https://openalex.org/W2917889020","https://openalex.org/W2134458085","https://openalex.org/W1610029617","https://openalex.org/W2950907886","https://openalex.org/W2070042241","https://openalex.org/W2567710441","https://openalex.org/W3095545110","https://openalex.org/W1947321792","https://openalex.org/W2027615035","https://openalex.org/W2911924517","https://openalex.org/W1583067157","https://openalex.org/W2106099989","https://openalex.org/W25426087"],"abstract_inverted_index":{"We":[0,97],"present":[1],"new":[2],"search":[3,13,61,95,121,182],"trees":[4,32,150],"with":[5,128],"worst-case":[6,46,125],"$O(1)$":[7],"update":[8,43,126,180],"time":[9,39,89],"and":[10,42,63,90],"$O(\\log":[11,40],"n)$":[12,48],"time,":[14],"storing":[15],"$n$":[16],"elements":[17,57],"in":[18,21,38,45,105,161],"linear":[19],"space,":[20],"the":[22,54,60,86,111,119,146,162,178],"Pointer":[23],"Machine":[24],"(PM)":[25],"model":[26],"of":[27,56,114,148,177],"computation.":[28],"In":[29,140],"addition,":[30,141],"these":[31,149,169],"can":[33],"easily":[34],"support":[35],"finger":[36,181],"searches":[37],"d)$":[41],"operations":[44],"$O(\\log^*":[47],"time.":[49],"The":[50],"parameter":[51],"at":[52],"represents":[53],"number":[55],"(distance)":[58],"between":[59],"element":[62,65],"an":[64,106],"pointed":[66],"to":[67,137,152,173],"by":[68,82,102,186],"a":[69,79,129,174],"pointer":[70],"termed":[71],"finger.":[72],"Our":[73],"data":[74],"structure":[75],"is":[76,118,143],"based":[77],"on":[78,99],"previous":[80],"result":[81,101],"Fleischer":[83],"that":[84,123,168],"exhibits":[85],"same":[87],"asymptotic":[88],"space":[91],"complexities":[92],"for":[93],"simple":[94],"trees.":[96],"improve":[98],"this":[100],"handling":[103],"deletions":[104,154],"explicit":[107],"way":[108],"without":[109,133],"using":[110,134],"standard":[112],"trick":[113],"global":[115,135],"rebuilding.":[116],"This":[117],"first":[120],"tree":[122,183],"combines":[124],"times":[127],"local":[130],"rebalancing":[131],"scheme":[132],"rebuilding":[136],"tackle":[138],"deletions.":[139],"insight":[142],"acquired":[144],"from":[145],"construction":[147],"as":[151],"why":[153],"are":[155],"considered":[156],"more":[157],"difficult":[158],"than":[159],"insertions":[160],"$(a,b)$-trees":[163],"setting.":[164],"Finally,":[165],"we":[166],"hope":[167],"techniques":[170],"may":[171],"lead":[172],"simpler":[175],"version":[176],"constant":[179],"presented":[184],"recently":[185],"Brodal":[187],"et":[188],"al.":[189],"[5].":[190]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}