The following pages link to Avivit Levy (Q417981):
Displayed 41 items.
- (Q294920) (redirect page) (← links)
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Approximate cover of strings (Q2326399) (← links)
- Approximate periodicity (Q2343134) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Mind the gap! (Q2414857) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Detecting approximate periodic patterns (Q2437747) (← links)
- Closest periodic vectors in \(L_p\) spaces (Q2446104) (← links)
- Cycle detection and correction (Q2933643) (← links)
- Distance Oracles for Vertex-Labeled Graphs (Q3012943) (← links)
- Approximate Periodicity (Q3060718) (← links)
- Closest Periodic Vectors in L p Spaces (Q3104672) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- String Rearrangement Metrics: A Survey (Q3558255) (← links)
- Cycle Detection and Correction (Q3587368) (← links)
- Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap (Q4636494) (← links)
- Detecting Approximate Periodic Patterns (Q4916028) (← links)
- (Q5110891) (← links)
- (Q5110892) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Dictionary Matching with One Gap (Q5165586) (← links)
- (Q5506324) (← links)
- Range LCP (Q5894415) (← links)
- On the Cost of Interchange Rearrangement in Strings (Q5900366) (← links)
- On the Cost of Interchange Rearrangement in Strings (Q5901157) (← links)
- Range LCP (Q5920340) (← links)