Pages that link to "Item:Q2904502"
From MaRDI portal
The following pages link to Time-Space Trade-Offs for Longest Common Extensions (Q2904502):
Displaying 10 items.
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Tight lower bounds for the longest common extension problem (Q2628282) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)