Algorithms and Computation

DOI10.1007/b94771zbMath1205.68128OpenAlexW1769833081MaRDI QIDQ5191652

Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung, Tak-Wah Lam

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (5)

Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space ⋮ Fast BWT in small space by blockwise suffix sorting ⋮ Faster suffix sorting ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

This page was built for publication: Algorithms and Computation