Farach (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 n)$ == Space Complexity == $O(n)$ words (https://www.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == CRCW PRAM == Year == 1997 == Reference == https://www.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(log n)$

Space Complexity

$O(n)$ words

(https://www.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf)

Description

Approximate?

Exact

Randomized?

Yes, Las Vegas

Model of Computation

CRCW PRAM

Year

1997

Reference

https://www.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Farach_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)&oldid=45446"