Pages that link to "Item:Q3596712"
From MaRDI portal
The following pages link to Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712):
Displaying 15 items.
- Parameterized longest previous factor (Q441845) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
