Schieber; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)

From Algorithm Wiki

Revision as of 09:43, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n+m)$

Space Complexity

$O(n)$ words

(https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1988

Reference

https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Schieber;_Vishkin_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)&oldid=47408"