Avivit Levy
Avivit Levy
Associate professor of Computer Science, Shenkar College
Dirección de correo verificada de shenkar.ac.il
Título
Citado por
Citado por
Año
Pattern matching with address errors: rearrangement distances
A Amir, Y Aumann, G Benson, A Levy, O Lipsky, E Porat, S Skiena, ...
Journal of Computer and System Sciences 75 (6), 359-370, 2009
542009
On the cost of interchange rearrangement in strings
A Amir, T Hartman, O Kapah, A Levy, E Porat
SIAM Journal on Computing 39 (4), 1444-1461, 2010
312010
Mind the gap
A Amir, T Kopelowitz, A Levy, S Pettie, E Porat, BR Shalom
Algorithmica, 2019, 2015
26*2015
Approximate string matching with address bit errors
A Amir, Y Aumann, O Kapah, A Levy, E Porat
Theoretical Computer Science 410 (51), 5334-5346, 2009
222009
Distance oracles for vertex-labeled graphs
D Hermelin, A Levy, O Weimann, R Yuster
International Colloquium on Automata, Languages, and Programming, 490-501, 2011
212011
Cycle detection and correction
A Amir, E Eisenberg, A Levy, E Porat, N Shapira
ACM Transactions on Algorithms (TALG) 9 (1), 1-20, 2012
202012
Efficient Computations of ℓ1 and ℓ ∞  Rearrangement Distances
A Amir, Y Aumann, P Indyk, A Levy, E Porat
International Symposium on String Processing and Information Retrieval, 39-49, 2007
192007
Approximate periodicity
A Amir, E Eisenberg, A Levy
Information and Computation 241, 215-226, 2015
18*2015
Longest Common Subsequence in k Length Substrings
G Benson, A Levy, BR Shalom
International Conference on Similarity Search and Applications, 257-265, 2013
182013
Range lcp
A Amir, A Apostolico, GM Landau, A Levy, M Lewenstein, E Porat
Journal of Computer and System Sciences 80 (7), 1245-1253, 2014
172014
Approximate cover of strings
A Amir, A Levy, R Lubin, E Porat
Theoretical Computer Science 793, 59-69, 2019
162019
Dictionary matching with one gap
A Amir, A Levy, E Porat, BR Shalom
Symposium on Combinatorial Pattern Matching, 11-20, 2014
152014
On approximating string selection problems with outliers
C Boucher, GM Landau, A Levy, D Pritchard, O Weimann
Theoretical Computer Science 498, 107-114, 2013
152013
Can we recover the cover?
A Amir, A Levy, M Lewenstein, R Lubin, B Porat
Algorithmica 81 (7), 2857-2875, 2019
122019
Interchange rearrangement: The element-cost model
O Kapah, GM Landau, A Levy, N Oz
Theoretical Computer Science 410 (43), 4315-4326, 2009
122009
Lcsk: a refined similarity measure
G Benson, A Levy, S Maimoni, D Noifeld, BR Shalom
Theoretical Computer Science 638, 11-26, 2016
112016
Dictionary matching with a few gaps
A Amir, A Levy, E Porat, BR Shalom
Theoretical Computer Science 589, 34-46, 2015
112015
String rearrangement metrics: A survey
A Amir, A Levy
Algorithms and applications, 1-33, 2010
82010
Efficient computations of l1 and l∞ rearrangement distances
A Amir, Y Aumann, P Indyk, A Levy, E Porat
SPIRE 4726, 39-49, 2007
72007
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.
Y Aumann, A Kapah-Levy
SODA, 61-70, 1999
71999
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20