Pages that link to "Item:Q2942246"
From MaRDI portal
The following pages link to Longest Common Extensions in Sublinear Space (Q2942246):
Displaying 14 items.
- Longest common extensions in trees (Q294947) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Tight lower bounds for the longest common extension problem (Q2628282) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Fully Dynamic Data Structure for LCE Queries in Compressed Space (Q4608635) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)