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

From Algorithm Wiki

Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+m)$ ? == Space Complexity == $O(n)$ words (space bounded by pre-processing time) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1993 == Reference == https://apps.dtic.mil/dtic/tr/fulltext/u2/a227803.pdf")

(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

(space bounded by pre-processing time)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1993

Reference

https://apps.dtic.mil/dtic/tr/fulltext/u2/a227803.pdf

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