Avivit Levy

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 21

Top Topics

Longest Common Subsequence

Top Venues

Theor. Comput. Sci.

Publications

Amihood Amir, Eitan Kondratovsky, Avivit Levy
On suffix tree detection. Theor. Comput. Sci. 1012 (2024)
Avivit Levy, Adi Barash, Chen Zaguri, Ariel Hadad, Polina Polsky
Improving deep learning based bluespotted ribbontail ray (Taeniura Lymma) recognition. Ecol. Informatics 82 (2024)
Avivit Levy, Dana Shapira
Computation over APT Compressed Data. DCC (2024)
Amihood Amir, Eitan Kondratovsky, Avivit Levy
On Suffix Tree Detection. SPIRE (2023)
Avivit Levy, B. Riva Shalom
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. Algorithmica 84 (3) (2022)
Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol
Multidimensional Period Recovery. Algorithmica 84 (6) (2022)
Avivit Levy, Ely Porat, B. Riva Shalom
Partial Permutations Comparison, Maintenance and Applications. CPM (2022)
Avivit Levy
Exploiting Pseudo-locality of Interchange Distance. SPIRE (2021)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Online recognition of dictionary with one gap. Inf. Comput. 275 (2020)
Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol
Multidimensional Period Recovery. SPIRE (2020)
Avivit Levy, B. Riva Shalom
Online parameterized dictionary matching with one gap. Theor. Comput. Sci. 845 (2020)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover? Algorithmica 81 (7) (2019)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81 (6) (2019)
Avivit Levy, B. Riva Shalom
Online Parameterized Dictionary Matching with One Gap. Stringology (2019)
Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
Approximate cover of strings. Theor. Comput. Sci. 793 (2019)
Amihood Amir, Avivit Levy, Ely Porat
Quasi-Periodicity Under Mismatch Errors. CPM (2018)
Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
Approximate Cover of Strings. CPM (2017)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover?. CPM (2017)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Online Recognition of Dictionary with One Gap. Stringology (2017)
Gary Benson, Avivit Levy, S. Maimoni, D. Noifeld, B. Riva Shalom
LCSk: A refined similarity measure. Theor. Comput. Sci. 638 (2016)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC (2016)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary matching with a few gaps. Theor. Comput. Sci. 589 (2015)
Amihood Amir, Estrella Eisenberg, Avivit Levy
Approximate periodicity. Inf. Comput. 241 (2015)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Online Dictionary Matching with One Gap. CoRR (2015)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. J. Comput. Syst. Sci. 80 (7) (2014)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
spaces. Theor. Comput. Sci. 533 (2014)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary Matching with One Gap. CoRR (2014)
Gary Benson, Avivit Levy, B. Riva Shalom
Longest Common Subsequence in k-length substrings. CoRR (2014)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting approximate periodic patterns. Theor. Comput. Sci. 525 (2014)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary Matching with One Gap. CPM (2014)
Gary Benson, Avivit Levy, B. Riva Shalom
Longest Common Subsequence in k Length Substrings. SISAP (2013)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On approximating string selection problems with outliers. Theor. Comput. Sci. 498 (2013)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers. CPM (2012)
Amihood Amir, Avivit Levy
Approximate Period Detection and Correction. SPIRE (2012)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers CoRR (2012)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting Approximate Periodic Patterns. MedAlg (2012)
Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
Student Poster Session. WG (2012)
Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422 (2012)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
Cycle detection and correction. ACM Trans. Algorithms 9 (1) (2012)
Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) (2011)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
Closest Periodic Vectors in L p Spaces. ISAAC (2011)
Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412 (29) (2011)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. ISAAC (2011)
Gad M. Landau, Avivit Levy, Ilan Newman
LCS approximation via embedding into locally non-repetitive strings. Inf. Comput. 209 (4) (2011)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
Cycle Detection and Correction. ICALP (1) (2010)
Amihood Amir, Avivit Levy
String Rearrangement Metrics: A Survey. Algorithms and Applications (2010)
Amihood Amir, Estrella Eisenberg, Avivit Levy
Approximate Periodicity. ISAAC (1) (2010)
Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Approximate String Matching with Stuck Address Bits. SPIRE (2010)
Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39 (4) (2009)
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Approximate string matching with address bit errors. Theor. Comput. Sci. 410 (51) (2009)
Gad M. Landau, Avivit Levy, Ilan Newman
LCS Approximation via Embedding into Local Non-repetitive Strings. CPM (2009)
Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75 (6) (2009)
Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Quasi-distinct Parsing and Optimal Compression Methods. CPM (2009)
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
rearrangement distances. Theor. Comput. Sci. 410 (43) (2009)
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
Interchange rearrangement: The element-cost model. Theor. Comput. Sci. 410 (43) (2009)
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
Interchange Rearrangement: The Element-Cost Model. SPIRE (2008)
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Approximate String Matching with Address Bit Errors. CPM (2008)
Amihood Amir, Avivit Levy, Liron Reuveni
The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Fundam. Informaticae 84 (1) (2008)
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
Rearrangement Distances. SPIRE (2007)
Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
On the Cost of Interchange Rearrangement in Strings. ESA (2007)
Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
Pattern matching with address errors: rearrangement distances. SODA (2006)