Oren Kapah - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2016

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent SetsAmihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat. spaa 2016: 367-375 [doi]

2009

On the Cost of Interchange Rearrangement in StringsAmihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat. SICOMP, 39(4):1444-1461, 2009. [doi]

Approximate string matching with address bit errorsAmihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat. TCS, 410(51):5334-5346, 2009. [doi]

Interchange rearrangement: The element-cost modelOren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz. TCS, 410(43):4315-4326, 2009. [doi]

2008

Improved Deterministic Length ReductionAmihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild. corr, abs/0802.0017, 2008. [doi]

Generalized LCSAmihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur. TCS, 409(3):438-449, 2008. [doi]

Approximate String Matching with Address Bit ErrorsAmihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat. cpm 2008: 118-129 [doi]

Interchange Rearrangement: The Element-Cost ModelOren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz. spire 2008: 224-235 [doi]

2007

2006

Faster two-dimensional pattern matching with rotationsAmihood Amir, Oren Kapah, Dekel Tsur. TCS, 368(3):196-204, 2006. [doi]

Approximate Matching in Weighted SequencesAmihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat. cpm 2006: 365-376 [doi]

2004

Faster Two Dimensional Pattern Matching with RotationsAmihood Amir, Oren Kapah, Dekel Tsur. cpm 2004: 409-419 [doi]

Efficient Unsupervised Recursive Word Segmentation Using Minimum Description LengthShlomo Argamon, Navot Akiva, Amihood Amir, Oren Kapah. COLING 2004: [doi]

Sign in or sign up to see more results.

runs on WebDSL