Random suffix search trees

DOI10.1002/rsa.10103zbMath1036.68028OpenAlexW2153541768MaRDI QIDQ4446869

Ralph Neininger, Luc P. Devroye

Publication date: 3 February 2004

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10103

zbMATH Keywords

probabilistic analysis of algorithmssuffix treerandom binary search treerandom spacingsLacunary sequences

Mathematics Subject Classification ID

Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Symmetry breaking for suffix tree construction
• Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
• Algorithms on Strings, Trees and Sequences
• On random cartesian trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item