In-Place Suffix Sorting

DOI10.1007/978-3-540-73420-8_47zbMath1171.68445OpenAlexW2145179960MaRDI QIDQ5428837

No author found.

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_47

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (11)

Optimal In-place Algorithms for Basic Graph Problems ⋮ Suffix-sorting via Shannon-Fano-Elias codes ⋮ Optimal in-place suffix sorting ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Lightweight data indexing and compression in external memory ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Computing the Burrows-Wheeler transform in place and in small space

This page was built for publication: In-Place Suffix Sorting