Hariharan (Constructing Suffix Trees Constructing Suffix Trees): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1612:16, 15 February 2023‎ Admin talk contribs‎ 384 bytes +384‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Hariharan_(Constructing_Suffix_Trees_Constructing_Suffix_Trees)"