M
Moshe Lewenstein
Researcher at Bar-Ilan University
Publications - 141
Citations - 3654
Moshe Lewenstein is an academic researcher from Bar-Ilan University. The author has contributed to research in topics: Substring & Time complexity. The author has an hindex of 32, co-authored 139 publications receiving 3434 citations. Previous affiliations of Moshe Lewenstein include Georgia Institute of Technology & Netanya Academic College.
Papers
More filters
Proceedings ArticleDOI
Dictionary matching and indexing with errors and don't cares
TL;DR: This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a query string p, all matches of p with the text can be reported quickly.
Proceedings ArticleDOI
Faster algorithms for string matching with k mismatches
TL;DR: This work presents an algorithm that is faster than both the Galil-Giancarlo and Abrahamson algorithms in finding all locations where the pattern has at most k errors in time O(n√k log k).
Journal ArticleDOI
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
TL;DR: It is proved that if the d-regular multigraph does not contain more than ⌊d/2⌋ copies of any 2-cycle then it can be found a similar decomposition into n2 pairs of cycle covers where each 2- cycle occurs in at most one component of each pair.
Proceedings ArticleDOI
Clustered Integer 3SUM via Additive Combinatorics
Timothy M. Chan,Moshe Lewenstein +1 more
TL;DR: A truly subquadratic algorithm for integer 3SUM in 2D with integer coordinates bounded by O(n) was given in this article, where the running time is O( n(n(9+√177)/12, polylog,n) with randomization, or O (n1.864) deterministically.
Journal ArticleDOI
New results on induced matchings
TL;DR: This paper generalizes the results to wider classes of graphs, and improves the time complexity of previously known results.