Closest Pair Problems in Very High Dimensions. - Piotr Indyk; Moshe Lewenstein; Ohad Lipsky; Ely Porat (ICALP, 2004)

Approximate Matching in the L1 Metric. - Amihood Amir; Ohad Lipsky; Ely Porat; Julia Umanski (CPM, 2005)

L1 Pattern Matching Lower Bound. - Ohad Lipsky; Ely Porat (SPIRE, 2005)

Approximate Matching in the Linfinity Metric. - Ohad Lipsky; Ely Porat (SPIRE, 2005)

Pattern matching with address errors: rearrangement distances. - Amihood Amir; Yonatan Aumann; Gary Benson; Avivit Levy; Ohad Lipsky; Ely Porat; Steven Skiena; Uzi Vishne (SODA, 2006)

Improved Sketching of Hamming Distance with Error Correcting. - Ely Porat; Ohad Lipsky (CPM, 2007)

Approximate String Matching with Swap and Mismatch. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (ISAAC, 2007)

Approximate Swap and Mismatch Edit Distance. - Yair Dombb; Ohad Lipsky; Benny Porat; Ely Porat; Asaf Tsur (SPIRE, 2007)

Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. - Ohad Lipsky; Ely Porat (SPIRE, 2008)

String matching with up to k swaps and mismatches. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (Inf. Comput., 2010)

Approximate Pattern Matching with the L1, L2 and L∞ Metrics. - Ohad Lipsky; Ely Porat (Algorithmica, 2011)