Hariharan (Constructing Suffix Trees Constructing Suffix Trees)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log^{4}(n)$) == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/S0022000097914963) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == CREW PRAM == Year == 1997 == Reference == https://www.sciencedirect.com/science/article/pii/S0022000097914963")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(log^{4}(n)$)

Space Complexity

$O(n)$ words

(https://www.sciencedirect.com/science/article/pii/S0022000097914963)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

CREW PRAM

Year

1997

Reference

https://www.sciencedirect.com/science/article/pii/S0022000097914963

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hariharan_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)&oldid=45444"