External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Optimal Logarithmic Time Randomized Suffix Tree Construction

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.

Authors

Martin Farach

This author has not been identified. Look up 'Martin Farach' in Google

S. Muthukrishnan

This author has not been identified. Look up 'S. Muthukrishnan' in Google
runs on