{"id":"https://openalex.org/W1491457059","doi":"https://doi.org/10.1007/3-540-61422-2_133","title":"Optimal pointer algorithms for finding nearest common ancestors in dynamic trees","display_name":"Optimal pointer algorithms for finding nearest common ancestors in dynamic trees","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1491457059","doi":"https://doi.org/10.1007/3-540-61422-2_133","mag":"1491457059"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61422-2_133","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_133","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5034291253","display_name":"Stephen Alstrup","orcid":"https://orcid.org/0000-0001-7896-8386"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Stephen Alstrup","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen, Denmark","University of Copenhagen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen, Denmark","University of Copenhagen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04518744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.991100013256073,"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.829375147819519},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6710349321365356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5557745099067688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5138862133026123},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49869537353515625},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.44980326294898987},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41389769315719604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34576231241226196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.341728150844574},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13289028406143188},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11002755165100098},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.07516792416572571}],"concepts":[{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.829375147819519},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6710349321365356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5557745099067688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5138862133026123},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49869537353515625},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.44980326294898987},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41389769315719604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34576231241226196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.341728150844574},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13289028406143188},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11002755165100098},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.07516792416572571},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-61422-2_133","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_133","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/da387912-b7cd-4700-a806-82104b034af8","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/da387912-b7cd-4700-a806-82104b034af8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alstrup , S & Thorup , M 1996 , Optimal pointer algorithms for finding nearest common ancestors in dynamic trees . in Algorithm Theory\u2014SWAT'96 . Springer Science+Business Media , Lecture notes in computer science , vol. 1097 , pp. 212-222 .","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1986261983","https://openalex.org/W2004116976","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2023658462","https://openalex.org/W2028245619","https://openalex.org/W2028503265","https://openalex.org/W2054420170","https://openalex.org/W2148928818","https://openalex.org/W6637190722"],"related_works":["https://openalex.org/W2387387477","https://openalex.org/W2394051415","https://openalex.org/W4255928847","https://openalex.org/W4388218401","https://openalex.org/W2352114091","https://openalex.org/W125546616","https://openalex.org/W1541559742","https://openalex.org/W816103523","https://openalex.org/W4320005749","https://openalex.org/W45913004"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}