( en | de | ru )

 

Disambiguation of "Kapah, Oren"

Author of the publication

copydeleteadd this publication to your clipboard
Approximate String Matching with Address Bit Errors.

, , , , and . CPM, volume 5029 of Lecture Notes in Computer Science, page 118-129. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oren Weimann

Oren Etzioni

Nir Oren

Oren Osterer

Hubert Emil Kapahnke

 

Other publications of authors with the same name

Approximate String Matching with Address Bit Errors., , , , and . CPM, volume 5029 of Lecture Notes in Computer Science, page 118-129. Springer, (2008)Approximate string matching with address bit errors., , , , and . Theor. Comput. Sci., 410 (51): 5334-5346 (2009)On the Cost of Interchange Rearrangement in Strings., , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 99-110. Springer, (2007)Faster two-dimensional pattern matching with rotations., , and . Theor. Comput. Sci., 368 (3): 196-204 (2006)Faster Two Dimensional Pattern Matching with Rotations., , and . CPM, volume 3109 of Lecture Notes in Computer Science, page 409-419. Springer, (2004)On the Cost of Interchange Rearrangement in Strings., , , , and . SIAM J. Comput., 39 (4): 1444-1461 (2009)Interchange rearrangement: The element-cost model., , , and . Theor. Comput. Sci., 410 (43): 4315-4326 (2009)Generalized LCS., , , , and . Theor. Comput. Sci., 409 (3): 438-449 (2008)Polynomials: a new tool for length reduction in binary discrete convolutions., , , and . CoRR, (2014)Improved Deterministic Length Reduction, , , , and . CoRR, (2008)