Aho, Hopcroft, and Ullman (Offline) (Off-Line Lowest Common Ancestor Lowest Common Ancestor)

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+ m*alpha(m + n, n)$) where alpha is the inverse Ackermann function == Space Complexity == $O(n)$ words (https://www.cs.bgu.ac.il/~segal/PAPERS2/tarj.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://dl.acm.org/doi/pdf/10.1145/800125.804056")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n+ m*alpha(m + n, n)$) where alpha is the inverse Ackermann function

Space Complexity

$O(n)$ words

(https://www.cs.bgu.ac.il/~segal/PAPERS2/tarj.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://dl.acm.org/doi/pdf/10.1145/800125.804056

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Aho,_Hopcroft,_and_Ullman_(Offline)_(Off-Line_Lowest_Common_Ancestor_Lowest_Common_Ancestor)&oldid=45660"