Pages that link to "Item:Q5236256"
From MaRDI portal
The following pages link to Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256):
Displaying 9 items.
- Approximability of constrained LCS (Q439929) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- Longest common subsequence in sublinear space (Q2656347) (← links)
- Partial fillup and search time in LC tries (Q4962683) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
- (Q5864920) (← links)
- (Q6084394) (← links)