The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On Finding Lowest Common Ancestors: Simplification and Parallelization
Abstract
We consider the following problem. Suppose a rooted tree T is available for preprocessing. Answer on-line queries requesting the lowest common ancestor for any pair of vertices in T. We present a linear time and space preprocessing algorithm that enables us to answer each query in $O(1)$ time, as in Harel and Tarjan [SIAM J. Comput., 13 (1984), pp. 338–355]. Our algorithm has the advantage of being simple and easily parallelizable. The resulting parallel preprocessing algorithm runs in logarithmic time using an optimal number of processors on an EREW PRAM. Each query is then answered in $O(1)$ time using a single processor.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Fast Algorithms for Finding Nearest Common Ancestors
Harel, D., & Tarjan, R. E. (1984) · SIAM Journal on Computing · doi:10.1137/0213024 · Cited by 1,073
An Efficient Parallel Biconnectivity Algorithm
Tarjan, R. E., & Vishkin, U. (1985) · SIAM Journal on Computing · doi:10.1137/0214061 · Cited by 525
Self-citation
Cited by
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Data structures for weighted matching and nearest common ancestors with linking
Gabow, H. N. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320229 · Cited by 398
Goloboff, P. A., & Szumik, C. A. (2015) · Molecular Phylogenetics and Evolution · doi:10.1016/j.ympev.2015.04.003 · Cited by 73
Metadata
- Authors
- Schieber, B., & Vishkin, U.
- Venue
- SIAM Journal on Computing
- Published
- 1988-12
- Volume
- 17
- Issue
- 6
- Pages
- 1253-1262
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2046946959
- Cited by
- 532
- References
- 3
- FWCI
- 13.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Finding Lowest Common Ancestors: Simplification and Parallelization. https://app.cochat.ai/papers/10.1137/0217079
- The paper
- Schieber, B., & Vishkin, U. (1988). On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM Journal on Computing. https://doi.org/10.1137/0217079
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.