Fischer, Heun (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m+n)$ == Space Complexity == $O(n)$ words (https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439")

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

Jump to navigation Jump to search

Time Complexity

$O(m+n)$

Space Complexity

$O(n)$ words

(https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5439

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fischer,_Heun_(Lowest_Common_Ancestor_with_Static_Trees_Lowest_Common_Ancestor)&oldid=45670"