List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the cost of interchange rearrangement in strings SIAM Journal on Computing | 2010-09-06 | Paper |
| Approximate string matching with address bit errors Theoretical Computer Science | 2009-11-18 | Paper |
| Interchange rearrangement: the element-cost model Theoretical Computer Science | 2009-10-09 | Paper |
| Generalized LCS Theoretical Computer Science | 2009-01-08 | Paper |
| On the Cost of Interchange Rearrangement in Strings Algorithms – ESA 2007 | 2008-09-25 | Paper |
| Approximate String Matching with Address Bit Errors Combinatorial Pattern Matching | 2008-06-17 | Paper |
| Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications Combinatorial Pattern Matching | 2008-06-17 | Paper |
| Approximate Matching in Weighted Sequences Combinatorial Pattern Matching | 2007-09-14 | Paper |
| Faster two-dimensional pattern matching with rotations Theoretical Computer Science | 2007-01-22 | Paper |
| Combinatorial Pattern Matching Lecture Notes in Computer Science | 2005-09-07 | Paper |
Research outcomes over time
This page was built for person: Oren Kapah
