Pages that link to "Item:Q2410365"

The following pages link to Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365):

Displaying 12 items.

• A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
• Space efficient search for maximal repetitions (Q557913) (← links)
• Two time-space tradeoffs for element distinctness (Q1095660) (← links)
• Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
• Computing minimal unique substrings for a sliding window (Q2118202) (← links)
• Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
• A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
• In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
• A general Sequential Time-Space Tradeoff for Finding Unique Elements (Q3210181) (← links)
• Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)
• Compact data structures for shortest unique substring queries (Q6536247) (← links)
• Range shortest unique substring queries (Q6536259) (← links)