Pages that link to "Item:Q5369553"
From MaRDI portal
The following pages link to Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. (Q5369553):
Displaying 11 items.
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- (Q2965480) (← links)
- Efficient Computation of Palindromes in Sequences with Uncertainties* (Q4611213) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Streaming periodicity with mismatches (Q5002646) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Searching Long Repeats in Streams (Q5088923) (← links)
- (Q5136323) (← links)
- Searching runs in streams (Q6536256) (← links)