{"id":"https://openalex.org/W2105818096","doi":"https://doi.org/10.1145/1498698.1594231","title":"Dynamic trees in practice","display_name":"Dynamic trees in practice","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2105818096","doi":"https://doi.org/10.1145/1498698.1594231","mag":"2105818096"},"language":"en","primary_location":{"id":"doi:10.1145/1498698.1594231","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1594231","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","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/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA and HP Labs, Palo Alto, CA, USA","Princeton University, Princeton, NJ, USA and HP Labs, Palo Alto, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA and HP Labs, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA and HP Labs, Palo Alto, CA, USA#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063407134","display_name":"Renato F. Werneck","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato F. Werneck","raw_affiliation_strings":["Microsoft Research Silicon Valley, Mountain View, CA, USA","Microsoft Research Silicon Valley, Mountain view, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210086253"]},{"raw_affiliation_string":"Microsoft Research Silicon Valley, Mountain view, CA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210086253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.839,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.91271651,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9969000220298767,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"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/computer-science","display_name":"Computer science","score":0.70354825258255},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7026056051254272},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6245127320289612},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.560728132724762},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.55865079164505},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5414405465126038},{"id":"https://openalex.org/keywords/strengths-and-weaknesses","display_name":"Strengths and weaknesses","score":0.5279461741447449},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.455394446849823},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3622334599494934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34616953134536743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24005168676376343},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22148633003234863},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.19996735453605652},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17746564745903015}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.70354825258255},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7026056051254272},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6245127320289612},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.560728132724762},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.55865079164505},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5414405465126038},{"id":"https://openalex.org/C63882131","wikidata":"https://www.wikidata.org/wiki/Q17122954","display_name":"Strengths and weaknesses","level":2,"score":0.5279461741447449},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.455394446849823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3622334599494934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34616953134536743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24005168676376343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22148633003234863},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.19996735453605652},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17746564745903015},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1498698.1594231","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1594231","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6299999952316284}],"awards":[{"id":"https://openalex.org/G755742384","display_name":null,"funder_award_id":"112-0188-1234-12","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W810974967","https://openalex.org/W964923673","https://openalex.org/W1486260668","https://openalex.org/W1513400187","https://openalex.org/W1762015549","https://openalex.org/W1822311423","https://openalex.org/W1847690346","https://openalex.org/W1977155699","https://openalex.org/W1977545325","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W2013444956","https://openalex.org/W2018804864","https://openalex.org/W2022163094","https://openalex.org/W2025791989","https://openalex.org/W2049761335","https://openalex.org/W2054014036","https://openalex.org/W2074792936","https://openalex.org/W2078443814","https://openalex.org/W2089016801","https://openalex.org/W2090193162","https://openalex.org/W2102347446","https://openalex.org/W2104224360","https://openalex.org/W2114421280","https://openalex.org/W2121473031","https://openalex.org/W2130055503","https://openalex.org/W2149342630","https://openalex.org/W2222522247","https://openalex.org/W2227557434","https://openalex.org/W2610955095","https://openalex.org/W2995414748","https://openalex.org/W3014094413","https://openalex.org/W3138807513","https://openalex.org/W4285719527","https://openalex.org/W4389615663","https://openalex.org/W4389615669","https://openalex.org/W6689124678"],"related_works":["https://openalex.org/W4295769391","https://openalex.org/W1968687912","https://openalex.org/W2491277646","https://openalex.org/W2067642082","https://openalex.org/W4252484868","https://openalex.org/W2058642825","https://openalex.org/W1602392394","https://openalex.org/W2064750939","https://openalex.org/W1981500574","https://openalex.org/W2044738414"],"abstract_inverted_index":{"Dynamic":[0],"tree":[1],"data":[2,92],"structures":[3,93],"maintain":[4],"forests":[5],"that":[6,74,88],"change":[7],"over":[8,28],"time":[9],"through":[10,62],"edge":[11],"insertions":[12],"and":[13,47,54,60,87,90],"deletions.":[14],"Besides":[15],"maintaining":[16],"connectivity":[17],"information":[18,27],"in":[19],"logarithmic":[20],"time,":[21],"they":[22],"can":[23],"support":[24],"aggregation":[25],"of":[26,38,41,50,84],"paths,":[29],"trees,":[30],"or":[31],"both.":[32],"We":[33,56,72],"perform":[34],"an":[35],"experimental":[36],"comparison":[37],"several":[39],"versions":[40],"dynamic":[42],"trees:":[43],"ST-trees,":[44],"ET-trees,":[45],"RC-trees,":[46],"two":[48],"variants":[49],"top":[51],"trees":[52],"(self-adjusting":[53],"worst-case).":[55],"quantify":[57],"their":[58],"strengths":[59],"weaknesses":[61],"tests":[63],"with":[64],"various":[65],"workloads,":[66],"most":[67],"stemming":[68],"from":[69],"practical":[70],"applications.":[71],"observe":[73],"a":[75],"simple,":[76],"linear-time":[77],"implementation":[78],"is":[79,106],"remarkably":[80],"fast":[81],"for":[82],"graphs":[83],"small":[85],"diameter,":[86],"worst-case":[89],"randomized":[91],"are":[94,98],"best":[95,102],"when":[96],"queries":[97],"very":[99],"frequent.":[100],"The":[101],"overall":[103],"performance,":[104],"however,":[105],"achieved":[107],"by":[108],"self-adjusting":[109],"ST-trees.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}