Martin Farach, S. Muthukrishnan. Optimal Logarithmic Time Randomized Suffix Tree Construction. In Friedhelm Meyer auf der Heide, Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Volume 1099 of Lecture Notes in Computer Science, pages 550-561, Springer, 1996.
@inproceedings{FarachM96,
title = {Optimal Logarithmic Time Randomized Suffix Tree Construction},
author = {Martin Farach and S. Muthukrishnan},
year = {1996},
researchr = {https://researchr.org/publication/FarachM96},
cites = {0},
citedby = {0},
pages = {550-561},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
editor = {Friedhelm Meyer auf der Heide and Burkhard Monien},
volume = {1099},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-61440-0},
}