The following pages link to Tatiana Starikovskaya (Q294951):
Displaying 42 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Cross-document pattern matching (Q396714) (← links)
- (Q764248) (redirect page) (← links)
- Computing the longest common substring with one mismatch (Q764249) (← links)
- Dynamic and approximate pattern matching in 2D (Q1796841) (← links)
- Streaming dictionary matching with mismatches (Q2118382) (← links)
- Streaming \(k\)-mismatch with error correcting and applications (Q2304535) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Correction to: ``Longest common substring with approximately \(k\) mismatches'' (Q2415358) (← links)
- Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
- Cross-Document Pattern Matching (Q2904492) (← links)
- Computing Lempel-Ziv Factorization Online (Q2912777) (← links)
- Sublinear Space Algorithms for the Longest Common Substring Problem (Q2921446) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Computing Longest Common Substrings Via Suffix Arrays (Q3503625) (← links)
- The <i>k</i>-mismatch problem revisited (Q4575727) (← links)
- Approximate Hamming Distance in a Stream (Q4598153) (← links)
- (Q4607989) (← links)
- Computing Discriminating and Generic Words (Q4913726) (← links)
- On Minimal and Maximal Suffixes of a Substring (Q4928556) (← links)
- Time-Space Trade-Offs for the Longest Common Substring Problem (Q4928575) (← links)
- (Q5005170) (← links)
- Streaming Dictionary Matching with Mismatches (Q5088912) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Communication and Streaming Complexity of Approximate Pattern Matching (Q5110877) (← links)
- All non-trivial variants of 3-LDT are equivalent (Q5144982) (← links)
- Computing Minimal and Maximal Suffixes of a Substring Revisited (Q5165588) (← links)
- Lower bounds for text indexing with mismatches and differences (Q5236254) (← links)
- Wavelet Trees Meet Suffix Trees (Q5362987) (← links)
- Longest Common Substring with Approximately k Mismatches (Q5369556) (← links)
- (Q5874289) (← links)
- Approximating Longest Common Substring with k mismatches: Theory and Practice (Q5874444) (← links)
- (Q5874453) (← links)
- (Q5875566) (← links)
- (Q6062160) (← links)
- Sorting signed permutations by reversals in nearly-linear time (Q6545115) (← links)
- Streaming regular expression membership and pattern matching (Q6575102) (← links)
- An improved algorithm for the \(k\)-Dyck edit distance problem (Q6575226) (← links)
- Compressed indexing for consecutive occurrences (Q6622018) (← links)
