Farach (Constructing Suffix Trees Constructing Suffix Trees): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(log n)$ | $O(\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
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