{"id":"https://openalex.org/W2046946959","doi":"https://doi.org/10.1137/0217079","title":"On Finding Lowest Common Ancestors: Simplification and Parallelization","display_name":"On Finding Lowest Common Ancestors: Simplification and Parallelization","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W2046946959","doi":"https://doi.org/10.1137/0217079","mag":"2046946959"},"language":"en","primary_location":{"id":"doi:10.1137/0217079","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217079","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/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":19.6866,"has_fulltext":false,"cited_by_count":535,"citation_normalized_percentile":{"value":0.99271697,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"17","issue":"6","first_page":"1253","last_page":"1262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9955000281333923,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.9144673347473145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5965359807014465},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5121397972106934},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5100458264350891},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4984152317047119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4976339638233185},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4536553621292114},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.4536322057247162},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.44732165336608887},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4430393576622009},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4262164235115051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36926376819610596},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36098960041999817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3526175022125244},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3473474979400635}],"concepts":[{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.9144673347473145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5965359807014465},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5121397972106934},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5100458264350891},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4984152317047119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4976339638233185},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4536553621292114},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.4536322057247162},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.44732165336608887},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4430393576622009},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4262164235115051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36926376819610596},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36098960041999817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3526175022125244},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3473474979400635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/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/0217079","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217079","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1995040285","https://openalex.org/W2003200876","https://openalex.org/W2011999472","https://openalex.org/W2040013583","https://openalex.org/W2058557216","https://openalex.org/W2061303458","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1873288469","https://openalex.org/W1513982482","https://openalex.org/W2028689405","https://openalex.org/W2102802671","https://openalex.org/W2899518456","https://openalex.org/W3017834538","https://openalex.org/W2963227782","https://openalex.org/W2951248193","https://openalex.org/W2963987971","https://openalex.org/W2295993224"],"abstract_inverted_index":{"We":[0,29],"consider":[1],"the":[2,18,63],"following":[3],"problem.":[4],"Suppose":[5],"a":[6,31,99],"rooted":[7],"tree":[8],"T":[9],"is":[10,92],"available":[11],"for":[12,22],"preprocessing.":[13],"Answer":[14],"on-line":[15],"queries":[16],"requesting":[17],"lowest":[19],"common":[20],"ancestor":[21],"any":[23],"pair":[24],"of":[25,65,84],"vertices":[26],"in":[27,45,49,77,95],"T.":[28],"present":[30],"linear":[32],"time":[33,79,97],"and":[34,51,68],"space":[35],"preprocessing":[36,74],"algorithm":[37,61,75],"that":[38],"enables":[39],"us":[40],"to":[41],"answer":[42],"each":[43],"query":[44,91],"$O(1)$":[46,96],"time,":[47],"as":[48],"Harel":[50],"Tarjan":[52],"[SIAM":[53],"J.":[54],"Comput.,":[55],"13":[56],"(1984),":[57],"pp.":[58],"338\u2013355].":[59],"Our":[60],"has":[62],"advantage":[64],"being":[66],"simple":[67],"easily":[69],"parallelizable.":[70],"The":[71],"resulting":[72],"parallel":[73],"runs":[76],"logarithmic":[78],"using":[80,98],"an":[81,87],"optimal":[82],"number":[83],"processors":[85],"on":[86],"EREW":[88],"PRAM.":[89],"Each":[90],"then":[93],"answered":[94],"single":[100],"processor.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":16}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}