Ohad Lipsky

According to our database, Ohad Lipsky authored at least 11 papers between 2004 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Approximate Pattern Matching with the <i>L</i>₁, <i>L</i>₂ and <i>L</i>_∞ Metrics.

Ohad Lipsky, Ely Porat

Algorithmica, 2011

2010

The approximate swap and mismatch edit distance.

Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur

Theor. Comput. Sci., 2010

String matching with up to k swaps and mismatches.

Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur

Inf. Comput., 2010

2009

Pattern matching with address errors: Rearrangement distances.

Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne

J. Comput. Syst. Sci., 2009

2008

L₁ pattern matching lower bound.

Ohad Lipsky, Ely Porat

Inf. Process. Lett., 2008

Approximate matching in the L_infinity metric.

Ohad Lipsky, Ely Porat

Inf. Process. Lett., 2008

Approximated Pattern Matching with the L1, L2 and L_infinit Metrics.

Ohad Lipsky, Ely Porat

Proceedings of the String Processing and Information Retrieval, 2008

2007

Approximate String Matching with Swap and Mismatch.

Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Improved Sketching of Hamming Distance with Error Correcting.

Ely Porat, Ohad Lipsky

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2005

Approximate Matching in the L₁ Metric.

Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Closest Pair Problems in Very High Dimensions.

Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004