The following pages link to Faster Sparse Suffix Sorting (Q2965500):
Displaying 9 items.
- Text sparsification via local maxima. (Q1401406) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- Faster suffix sorting (Q2465058) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Scalable Suffix Sorting on a Multicore Machine (Q5126060) (← links)
- A Fast Suffix-Sorting Algorithm (Q5504223) (← links)
- Sparse suffix and LCP array: simple, direct, small, and fast (Q6547927) (← links)