Avivit Levy

According to our database, Avivit Levy authored at least 40 papers between 1999 and 2023.

Collaborative distances:

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

2023

On Suffix Tree Detection.

Amihood Amir, Eitan Kondratovsky, Avivit Levy

Proceedings of the String Processing and Information Retrieval, 2023

2022

A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges.

Avivit Levy, B. Riva Shalom

Algorithmica, 2022

Multidimensional Period Recovery.

Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol

Algorithmica, 2022

Partial Permutations Comparison, Maintenance and Applications.

Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Exploiting Pseudo-locality of Interchange Distance.

Avivit Levy

Proceedings of the String Processing and Information Retrieval, 2021

2020

Online parameterized dictionary matching with one gap.

Avivit Levy, B. Riva Shalom

Theor. Comput. Sci., 2020

Online recognition of dictionary with one gap.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Inf. Comput., 2020

2019

Approximate cover of strings.

Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat

Theor. Comput. Sci., 2019

Can We Recover the Cover?

Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat

Algorithmica, 2019

Mind the Gap! - Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

Algorithmica, 2019

2018

Quasi-Periodicity Under Mismatch Errors.

Amihood Amir, Avivit Levy, Ely Porat

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2016

LCSk: A refined similarity measure.

Gary Benson, Avivit Levy, S. Maimoni, D. Noifeld, B. Riva Shalom

Theor. Comput. Sci., 2016

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Dictionary matching with a few gaps.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Theor. Comput. Sci., 2015

Approximate periodicity.

Amihood Amir, Estrella Eisenberg, Avivit Levy

Inf. Comput., 2015

Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

CoRR, 2015

2014

Closest periodic vectors in L_p spaces.

Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein

Theor. Comput. Sci., 2014

Detecting approximate periodic patterns.

Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein

Theor. Comput. Sci., 2014

Range LCP.

Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat

J. Comput. Syst. Sci., 2014

Dictionary Matching with One Gap.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

On approximating string selection problems with outliers.

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann

Theor. Comput. Sci., 2013

Longest Common Subsequence in k Length Substrings.

Gary Benson, Avivit Levy, B. Riva Shalom

Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

2012

Quasi-distinct parsing and optimal compression methods.

Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko

Theor. Comput. Sci., 2012

Cycle detection and correction.

Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira

ACM Trans. Algorithms, 2012

Student Poster Session.

Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Approximate Period Detection and Correction.

Amihood Amir, Avivit Levy

Proceedings of the String Processing and Information Retrieval, 2012

2011

Approximate string matching with stuck address bits.

Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat

Theor. Comput. Sci., 2011

LCS approximation via embedding into locally non-repetitive strings.

Gad M. Landau, Avivit Levy, Ilan Newman

Inf. Comput., 2011

Closest Periodic Vectors in L p Spaces.

Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Distance Oracles for Vertex-Labeled Graphs.

Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

String Rearrangement Metrics: A Survey.

Amihood Amir, Avivit Levy

Proceedings of the Algorithms and Applications, 2010

2009

Interchange rearrangement: The element-cost model.

Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz

Theor. Comput. Sci., 2009

Approximate string matching with address bit errors.

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat

Theor. Comput. Sci., 2009

Efficient computations of <i>l</i>₁ and <i>l</i>_∞ rearrangement distances.

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat

Theor. Comput. Sci., 2009

On the Cost of Interchange Rearrangement in Strings.

Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat

SIAM J. Comput., 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

LCS Approximation via Embedding into Local Non-repetitive Strings.

Gad M. Landau, Avivit Levy, Ilan Newman

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

The Practical Efficiency of Convolutions in Pattern Matching Algorithms.

Amihood Amir, Avivit Levy, Liron Reuveni

Fundam. Informaticae, 2008

2007

Efficient Computations of <i>l</i>₁ and <i>l</i>_infinity Rearrangement Distances.

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat

Proceedings of the String Processing and Information Retrieval, 2007

1999

Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.

Yonatan Aumann, Avivit Kapah-Levy

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999