S. Cenk Sahinalp and Uzi Vishkin. Symmetry breaking for su#x tree construction. In STOC, pages 300--309, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Locally Consistent Parsing and Applications to - Approximate String Comparisons Self-citation (Sahinalp) (Correct)
No context found.
S. Cenk Sahinalp and Uzi Vishkin. Symmetry breaking for su#x tree construction. In STOC, pages 300--309, 1994.
Optimal Logarithmic Time Randomized Suffix Tree Construction - Farach, Muthukrishnan (1996) (4 citations) (Correct)
No context found.
S. C. Sahinalp and U. Vishkin. Symmetry breaking for su#x tree construction. Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994.
Random Suffix Search Trees - Devroye, Neininger (2003) (Correct)
No context found.
Sahinalp, S. C. and Vishkin, U. (1994) Symmetry breaking for sux tree construction. Proc. 26th Symp. on Theory of Computing, 300-309.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC