{"id":"https://openalex.org/W2011999472","doi":"https://doi.org/10.1137/0213024","title":"Fast Algorithms for Finding Nearest Common Ancestors","display_name":"Fast Algorithms for Finding Nearest Common Ancestors","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W2011999472","doi":"https://doi.org/10.1137/0213024","mag":"2011999472"},"language":"en","primary_location":{"id":"doi:10.1137/0213024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5074985275","display_name":"Dov Harel","orcid":null},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dov Harel","raw_affiliation_strings":["Univ. of New Hampshire, Durham"],"affiliations":[{"raw_affiliation_string":"Univ. of New Hampshire, Durham","institution_ids":["https://openalex.org/I161057412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Endre Tarjan","raw_affiliation_strings":["Bell Laboratories Murray Hill NJ"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074985275"],"corresponding_institution_ids":["https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":14.5214,"has_fulltext":false,"cited_by_count":1075,"citation_normalized_percentile":{"value":0.99033856,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"13","issue":"2","first_page":"338","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962000250816345,"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/combinatorics","display_name":"Combinatorics","score":0.6436736583709717},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6000917553901672},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5489559173583984},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.521054208278656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5101483464241028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49451181292533875},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.47900837659835815},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47033175826072693},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4592452347278595},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.447343111038208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44281813502311707},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43858885765075684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42355257272720337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40703320503234863},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10616761445999146},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1048935055732727}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6436736583709717},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6000917553901672},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5489559173583984},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.521054208278656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5101483464241028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49451181292533875},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.47900837659835815},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47033175826072693},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4592452347278595},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.447343111038208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44281813502311707},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43858885765075684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42355257272720337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40703320503234863},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10616761445999146},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1048935055732727},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332688","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1984271780","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W2004116976","https://openalex.org/W2009798194","https://openalex.org/W2018804864","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2044146725"],"related_works":["https://openalex.org/W1874815355","https://openalex.org/W4243828764","https://openalex.org/W4254523142","https://openalex.org/W4229844547","https://openalex.org/W2391392917","https://openalex.org/W2464437250","https://openalex.org/W56552447","https://openalex.org/W2006708681","https://openalex.org/W2947398561","https://openalex.org/W2136838521"],"abstract_inverted_index":{"We":[0,28],"consider":[1],"the":[2,15,19,47,53,59,62,86,104,114,118],"following":[3],"problem:":[4],"Given":[5],"a":[6,70,79,111],"collection":[7,105],"of":[8,14,23,56,81,88,106,113],"rooted":[9],"trees,":[10],"answer":[11],"on-line":[12],"queries":[13],"form,":[16],"\u201cWhat":[17],"is":[18,52,108],"nearest":[20],"common":[21],"ancester":[22],"vertices":[24,57],"x":[25],"and":[26,98],"y?\u201d":[27],"show":[29],"that":[30,34,92,103],"any":[31],"pointer":[32],"machine":[33,73],"solves":[35],"this":[36],"problem":[37,115],"requires":[38,93],"$\\Omega":[39,82],"(\\log":[40,83],"\\log":[41],"n)$":[42,84],"time":[43,95],"per":[44,90,96],"query":[45,97],"in":[46,58,116],"worst":[48],"case,":[49],"where":[50],"n":[51],"total":[54],"number":[55,87],"trees.":[60],"On":[61],"other":[63],"hand,":[64],"we":[65,124],"present":[66],"an":[67,126],"algorithm":[68],"for":[69],"random":[71],"access":[72],"with":[74],"uniform":[75],"cost":[76],"measure":[77],"(and":[78,128],"bound":[80],"on":[85],"bits":[89],"word)":[91],"$O(1)$":[94],"$O(n)$":[99],"preprocessing":[100],"time,":[101],"assuming":[102],"trees":[107,119],"static.":[109],"For":[110],"version":[112],"which":[117],"can":[120],"change":[121],"between":[122],"queries,":[123],"obtain":[125],"almost-linear-time":[127],"linear-space)":[129],"algorithm.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":30},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":33},{"year":2019,"cited_by_count":36},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":24},{"year":2016,"cited_by_count":31},{"year":2015,"cited_by_count":48},{"year":2014,"cited_by_count":36},{"year":2013,"cited_by_count":44},{"year":2012,"cited_by_count":48}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}