# Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees)

Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log^{2}(n)$) == Space Complexity == $O(n^{({1}+\eps)})$ for any fixed eps>{0} words (https://link.springer.com/content/pdf/10.1007/3-540-57811-0_3.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == CRCW PRAM == Year == 1994 == Reference == https://link.springer.com/content/pdf/10.1007/3-540-57811-0_3.pdf")

## Time Complexity

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

## Space Complexity

$O(n^{({1}+\eps)})$ for any fixed eps>{0} words

(https://link.springer.com/content/pdf/10.1007/3-540-57811-0_3.pdf)

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

CRCW PRAM

## Year

1994

## Reference

https://link.springer.com/content/pdf/10.1007/3-540-57811-0_3.pdf