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

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m+log(n)$) == Space Complexity == $O(n)$ total (auxiliary?) words (https://www.proquest.com/docview/919780720?pq-origsite=gscholar&fromopenview=true) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1988 == Reference == https://epubs.siam.org/doi/abs/10.1137/0217079?journalCode=smjcat")

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

Jump to navigation Jump to search

Time Complexity

$O(m+log(n)$)

Space Complexity

$O(n)$ total (auxiliary?) words

(https://www.proquest.com/docview/919780720?pq-origsite=gscholar&fromopenview=true)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW PRAM

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_(Parallel)_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)&oldid=45669"