Pages that link to "Item:Q2442815"

The following pages link to Time-space trade-offs for longest common extensions (Q2442815):

Displaying 14 items.

• Longest common extensions in trees (Q294947) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Two time-space tradeoffs for element distinctness (Q1095660) (← links)
• Longest common substring with approximately \(k\) mismatches (Q2414870) (← 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)
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712) (← 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)
• A simple grammar-based index for finding approximately longest common substrings (Q6545431) (← links)