{"id":"https://openalex.org/W4390579155","doi":"https://doi.org/10.1137/1.9781611977929.4","title":"Fast and simple unrooted dynamic forests","display_name":"Fast and simple unrooted dynamic forests","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4390579155","doi":"https://doi.org/10.1137/1.9781611977929.4"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977929.4","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977929.4","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},"type":"book-chapter","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/A5065566770","display_name":"Benjamin Aram Berendsohn","orcid":"https://orcid.org/0000-0002-3430-5262"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Benjamin Aram Berendsohn","raw_affiliation_strings":["Freie Universit\u00e4t Berlin. Supported by DFG Grant KO 6140/1-2"],"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin. Supported by DFG Grant KO 6140/1-2","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065566770"],"corresponding_institution_ids":["https://openalex.org/I75951250"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00865059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9685999751091003,"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.9685999751091003,"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.9629999995231628,"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"}},{"id":"https://openalex.org/T13157","display_name":"Cancer-related gene regulation","score":0.9625999927520752,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.866974413394928},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.6414921283721924},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6035622358322144},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5974372625350952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5774350762367249},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5216931700706482},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5058688521385193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5000169277191162},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4995994567871094},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4485446810722351},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4313792586326599},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4145500063896179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3259927034378052},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.26554128527641296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20052877068519592},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.14164742827415466},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.09827080368995667}],"concepts":[{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.866974413394928},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6414921283721924},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6035622358322144},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5974372625350952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5774350762367249},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5216931700706482},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5058688521385193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5000169277191162},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4995994567871094},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4485446810722351},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4313792586326599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4145500063896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3259927034378052},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26554128527641296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20052877068519592},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.14164742827415466},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.09827080368995667},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611977929.4","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977929.4","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W964923673","https://openalex.org/W1583839420","https://openalex.org/W1964510837","https://openalex.org/W1977155699","https://openalex.org/W1987927249","https://openalex.org/W1990020944","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W2000568806","https://openalex.org/W2009695707","https://openalex.org/W2011999472","https://openalex.org/W2017619076","https://openalex.org/W2018804864","https://openalex.org/W2022163094","https://openalex.org/W2055127468","https://openalex.org/W2068373264","https://openalex.org/W2078589215","https://openalex.org/W2090359754","https://openalex.org/W2092885083","https://openalex.org/W2094632707","https://openalex.org/W2105818096","https://openalex.org/W2114313475","https://openalex.org/W2121473031","https://openalex.org/W2130055503","https://openalex.org/W2146560558","https://openalex.org/W3003005173","https://openalex.org/W3100078588","https://openalex.org/W4205643517","https://openalex.org/W4240458651","https://openalex.org/W4315705185"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W2146997899","https://openalex.org/W2914983903","https://openalex.org/W2077383771","https://openalex.org/W4376140277","https://openalex.org/W2091985989","https://openalex.org/W2501849745","https://openalex.org/W4367055576","https://openalex.org/W3169685561","https://openalex.org/W4231913352"],"abstract_inverted_index":{"A":[0],"dynamic":[1,34],"forest":[2,7,35],"data":[3,10,36],"structure":[4],"maintains":[5],"a":[6],"(and":[8],"associated":[9],"like":[11],"edge":[12,15],"weights)":[13],"under":[14],"insertions":[16],"and":[17,27,42,61],"deletions.":[18],"Dynamic":[19],"forests":[20],"are":[21,38,58,68],"widely":[22],"used":[23],"to":[24,64],"solve":[25],"online":[26],"offline":[28],"graph":[29],"problems.":[30],"Well-known":[31],"examples":[32],"of":[33,47],"structures":[37],"link-cut":[39,66],"trees":[40,44,57,67],"[28]":[41],"top":[43,56],"[4],":[45],"both":[46],"which":[48],"need":[49],"O(log":[50],"n)":[51],"time":[52],"per":[53],"operation.":[54],"While":[55],"more":[59],"flexible":[60],"arguably":[62],"easier":[63],"use,":[65],"faster":[69],"in":[70],"practice":[71],"[31].":[72]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}