Avivit Levy

Orcid: 0000-0002-1686-0094

According to our database1, Avivit Levy authored at least 44 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On suffix tree detection.
Theor. Comput. Sci., 2024

Improving deep learning based bluespotted ribbontail ray (Taeniura Lymma) recognition.
Ecol. Informatics, 2024

A Guide to Similarity Measures.
CoRR, 2024

Burst Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2024

Computation over APT Compressed Data.
Proceedings of the Data Compression Conference, 2024

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

Multidimensional Period Recovery.
Algorithmica, 2022

Partial Permutations Comparison, Maintenance and Applications.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Exploiting Pseudo-locality of Interchange Distance.
Proceedings of the String Processing and Information Retrieval, 2021

2020
Online parameterized dictionary matching with one gap.
Theor. Comput. Sci., 2020

Online recognition of dictionary with one gap.
Inf. Comput., 2020

2019
Approximate cover of strings.
Theor. Comput. Sci., 2019

Can We Recover the Cover?
Algorithmica, 2019

Mind the Gap! - Online Dictionary Matching with One Gap.
Algorithmica, 2019

2018
Quasi-Periodicity Under Mismatch Errors.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2016
LCSk: A refined similarity measure.
Theor. Comput. Sci., 2016

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Dictionary matching with a few gaps.
Theor. Comput. Sci., 2015

Approximate periodicity.
Inf. Comput., 2015

Online Dictionary Matching with One Gap.
CoRR, 2015

2014
Closest periodic vectors in L<sub>p</sub> spaces.
Theor. Comput. Sci., 2014

Detecting approximate periodic patterns.
Theor. Comput. Sci., 2014

Range LCP.
J. Comput. Syst. Sci., 2014

Dictionary Matching with One Gap.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
On approximating string selection problems with outliers.
Theor. Comput. Sci., 2013

Longest Common Subsequence in k Length Substrings.
Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

2012
Quasi-distinct parsing and optimal compression methods.
Theor. Comput. Sci., 2012

Cycle detection and correction.
ACM Trans. Algorithms, 2012

Student Poster Session.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Approximate Period Detection and Correction.
Proceedings of the String Processing and Information Retrieval, 2012

2011
Approximate string matching with stuck address bits.
Theor. Comput. Sci., 2011

LCS approximation via embedding into locally non-repetitive strings.
Inf. Comput., 2011

Closest Periodic Vectors in L p Spaces.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Distance Oracles for Vertex-Labeled Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
String Rearrangement Metrics: A Survey.
Proceedings of the Algorithms and Applications, 2010

2009
Interchange rearrangement: The element-cost model.
Theor. Comput. Sci., 2009

Approximate string matching with address bit errors.
Theor. Comput. Sci., 2009

Efficient computations of <i>l</i><sub>1</sub> and <i>l</i><sub>∞</sub> rearrangement distances.
Theor. Comput. Sci., 2009

On the Cost of Interchange Rearrangement in Strings.
SIAM J. Comput., 2009

Pattern matching with address errors: Rearrangement distances.
J. Comput. Syst. Sci., 2009

LCS Approximation via Embedding into Local Non-repetitive Strings.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
The Practical Efficiency of Convolutions in Pattern Matching Algorithms.
Fundam. Informaticae, 2008

2007
Efficient Computations of <i>l</i><sub>1</sub> and <i>l</i><sub>infinity</sub> Rearrangement Distances.
Proceedings of the String Processing and Information Retrieval, 2007

1999
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999


  Loading...