Efficient Unsupervised Recursive Word Segmentation Using Minimum Description Length. - Shlomo Argamon; Navot Akiva; Amihood Amir; Oren Kapah (COLING, 2004)

Faster Two Dimensional Pattern Matching with Rotations. - Amihood Amir; Oren Kapah; Dekel Tsur (CPM, 2004)

Approximate Matching in Weighted Sequences. - Amihood Amir; Costas S. Iliopoulos; Oren Kapah; Ely Porat (CPM, 2006)

Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. - Amihood Amir; Oren Kapah; Ely Porat (CPM, 2007)

On the Cost of Interchange Rearrangement in Strings. - Amihood Amir; Tzvika Hartman; Oren Kapah; Avivit Levy; Ely Porat (ESA, 2007)

Generalized LCS. - Amihood Amir; Tzvika Hartman; Oren Kapah; B. Riva Shalom; Dekel Tsur (SPIRE, 2007)

Approximate String Matching with Address Bit Errors. - Amihood Amir; Yonatan Aumann; Oren Kapah; Avivit Levy; Ely Porat (CPM, 2008)

Interchange Rearrangement: The Element-Cost Model. - Oren Kapah; Gad M. Landau; Avivit Levy; Nitsan Oz (SPIRE, 2008)

Improved Deterministic Length Reduction - Amihood Amir; Klim Efremenko; Oren Kapah; Ely Porat; Amir Rothschild (CoRR, 2008)

Polynomials: a new tool for length reduction in binary discrete convolutions. - Amihood Amir; Oren Kapah; Ely Porat; Amir Rothschild (CoRR, 2014)

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. - Amihood Amir; Oren Kapah; Tsvi Kopelowitz; Moni Naor; Ely Porat (SPAA, 2016)