{"id":"https://openalex.org/W2966205006","doi":"https://doi.org/10.1145/3595180","title":"Competitive Online Search Trees on Trees","display_name":"Competitive Online Search Trees on Trees","publication_year":2023,"publication_date":"2023-04-28","ids":{"openalex":"https://openalex.org/W2966205006","doi":"https://doi.org/10.1145/3595180","mag":"2966205006"},"language":"en","primary_location":{"id":"doi:10.1145/3595180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595180","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3595180","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Prosenjit Bose","raw_affiliation_strings":["Carleton University, Canada"],"raw_orcid":"https://orcid.org/0000-0002-8906-0573","affiliations":[{"raw_affiliation_string":"Carleton University, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011369568","display_name":"Jean Cardinal","orcid":"https://orcid.org/0000-0002-2312-0967"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jean Cardinal","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles (ULB), Belgium"],"raw_orcid":"https://orcid.org/0000-0002-2312-0967","affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088852372","display_name":"John Iacono","orcid":"https://orcid.org/0000-0001-8885-8172"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"John Iacono","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles (ULB), Belgium"],"raw_orcid":"https://orcid.org/0000-0001-8885-8172","affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003164174","display_name":"Grigorios Koumoutsos","orcid":"https://orcid.org/0000-0002-4928-103X"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Grigorios Koumoutsos","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles (ULB), Belgium"],"raw_orcid":"https://orcid.org/0000-0002-4928-103X","affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072214666","display_name":"Stefan Langerman","orcid":"https://orcid.org/0000-0001-6999-3088"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Stefan Langerman","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles (ULB), Belgium"],"raw_orcid":"https://orcid.org/0000-0001-6999-3088","affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00105658,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"19","issue":"3","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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.9990000128746033,"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.9944999814033508,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9922999739646912,"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/ternary-search-tree","display_name":"Ternary search tree","score":0.7997746467590332},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.764581024646759},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7168707847595215},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6582825779914856},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.6165095567703247},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.6025168895721436},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5981155037879944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5960990786552429},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5638505816459656},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5579203367233276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.536675751209259},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5160045623779297},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49460145831108093},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4686635732650757},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4368833899497986},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4285042881965637},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42704644799232483},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3596090078353882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3443502187728882},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3178008198738098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27825927734375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09056079387664795}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.7997746467590332},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.764581024646759},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7168707847595215},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6582825779914856},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.6165095567703247},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.6025168895721436},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5981155037879944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5960990786552429},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5638505816459656},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5579203367233276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.536675751209259},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5160045623779297},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49460145831108093},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4686635732650757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4368833899497986},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4285042881965637},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42704644799232483},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3596090078353882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3443502187728882},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3178008198738098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27825927734375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09056079387664795},{"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.1145/3595180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595180","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/368666","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/368666","pdf_url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/368666/3/1908.00848.pdf","source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM transactions on algorithms, 19 (3","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3595180","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595180","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595180","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3902148225","display_name":null,"funder_award_id":"J.0146.18","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6347847539","display_name":"Combinatorics of Networks and Computation","funder_award_id":"734922","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7765055871","display_name":null,"funder_award_id":"MISU F 6001 1","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"},{"id":"https://openalex.org/G8704302936","display_name":"AitF: FULL: Collaborative Research: Provably Efficient GPU Algorithms","funder_award_id":"1533564","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320319918","display_name":"York University","ror":"https://ror.org/05fq50484"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2966205006.pdf","grobid_xml":"https://content.openalex.org/works/W2966205006.grobid-xml"},"referenced_works_count":61,"referenced_works":["https://openalex.org/W124196549","https://openalex.org/W172574161","https://openalex.org/W1513400187","https://openalex.org/W1531368347","https://openalex.org/W1547734834","https://openalex.org/W1624114741","https://openalex.org/W1793615280","https://openalex.org/W1924246083","https://openalex.org/W1956214747","https://openalex.org/W1972094496","https://openalex.org/W1972748018","https://openalex.org/W1985159132","https://openalex.org/W1991146548","https://openalex.org/W1991217335","https://openalex.org/W1995875735","https://openalex.org/W2000568806","https://openalex.org/W2007918688","https://openalex.org/W2015572702","https://openalex.org/W2016857845","https://openalex.org/W2017619076","https://openalex.org/W2018804864","https://openalex.org/W2021615496","https://openalex.org/W2022116663","https://openalex.org/W2025583426","https://openalex.org/W2027562075","https://openalex.org/W2034114460","https://openalex.org/W2039985220","https://openalex.org/W2042875854","https://openalex.org/W2044155041","https://openalex.org/W2049452854","https://openalex.org/W2062785505","https://openalex.org/W2062799424","https://openalex.org/W2068373264","https://openalex.org/W2068628972","https://openalex.org/W2070091651","https://openalex.org/W2070552865","https://openalex.org/W2070592419","https://openalex.org/W2071699701","https://openalex.org/W2092864936","https://openalex.org/W2092885083","https://openalex.org/W2106966575","https://openalex.org/W2110754991","https://openalex.org/W2114313475","https://openalex.org/W2130055503","https://openalex.org/W2130848020","https://openalex.org/W2293258084","https://openalex.org/W2294466966","https://openalex.org/W2395495808","https://openalex.org/W2962879625","https://openalex.org/W3004647052","https://openalex.org/W3022747203","https://openalex.org/W3102247091","https://openalex.org/W4213214460","https://openalex.org/W4234135937","https://openalex.org/W4241504821","https://openalex.org/W4298354324","https://openalex.org/W4389615664","https://openalex.org/W4389615669","https://openalex.org/W6643380523","https://openalex.org/W6673576355","https://openalex.org/W6763943126"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2072157347","https://openalex.org/W3109340025","https://openalex.org/W3003005173","https://openalex.org/W4288268215","https://openalex.org/W2966205006","https://openalex.org/W2006964051","https://openalex.org/W2049311920","https://openalex.org/W2095382539"],"abstract_inverted_index":{"We":[0,15,84],"consider":[1],"the":[2,21,30,35,70,78,103,109],"design":[3],"of":[4,11,20,37,39,105,113,147,159,162,171],"adaptive":[5],"data":[6,95],"structures":[7],"for":[8,50],"searching":[9],"elements":[10],"a":[12,17,40,47,82,156,169],"tree-structured":[13],"space.":[14],"use":[16,158],"natural":[18],"generalization":[19],"rotation-based":[22],"online":[23,87,125],"binary":[24,72,114,126],"search":[25,32,73,93,115,127,142,166],"tree":[26,74,80,94,128],"model":[27,43,66,75],"in":[28,97],"which":[29,144],"underlying":[31,79],"space":[33,167],"is":[34,44,67,81,102,119,153],"set":[36,170],"vertices":[38],"tree.":[41],"This":[42,107],"based":[45,154],"on":[46,155],"simple":[48],"structure":[49,96],"decomposing":[51],"graphs,":[52],"previously":[53],"known":[54],"under":[55],"several":[56,133],"names":[57],"including":[58,136],"elimination":[59],"trees,":[60,123,143],"vertex":[61],"rankings,":[62],"and":[63],"tubings.":[64],"The":[65],"equivalent":[68],"to":[69,168],"classical":[71],"exactly":[76],"when":[77],"path.":[83],"describe":[85],"an":[86,124],"O":[88],"(log":[89],"log":[90],"n":[91,101],")-competitive":[92],"this":[98],"model,":[99],"where":[100],"number":[104],"vertices.":[106],"matches":[108],"best-known":[110],"competitive":[111],"ratio":[112],"trees.":[116],"Our":[117],"method":[118],"inspired":[120],"by":[121],"Tango":[122],"algorithm,":[129],"but":[130],"critically":[131],"needs":[132],"new":[134],"notions":[135],"one":[137],"that":[138],"we":[139],"call":[140],"Steiner-closed":[141,172],"may":[145],"be":[146],"independent":[148],"interest.":[149],"Moreover,":[150],"our":[151],"technique":[152],"novel":[157],"two":[160],"levels":[161],"decomposition,":[163],"first":[164],"from":[165,176],"trees":[173,178],"and,":[174],"second,":[175],"these":[177],"into":[179],"paths.":[180]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}