Moshe Lewenstein
Moshe Lewenstein
Professor of Computer Science, Bar-Ilan University
Verified email at - Homepage
Cited by
Cited by
Dictionary matching and indexing with errors and don't cares
R Cole, LA Gottlieb, M Lewenstein
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Faster algorithms for string matching with k mismatches
A Amir, M Lewenstein, E Porat
Journal of Algorithms 50 (2), 257-275, 2004
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
H Kaplan, M Lewenstein, N Shafrir, M Sviridenko
Journal of the ACM (JACM) 52 (4), 602-626, 2005
New results on induced matchings
MC Golumbic, M Lewenstein
Discrete Applied Mathematics 101 (1-3), 157-165, 2000
Clustered integer 3SUM via additive combinatorics
TM Chan, M Lewenstein
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
Pattern matching with swaps
A Amir, Y Aumann, GM Landau, M Lewenstein, N Lewenstein
Journal of algorithms 37 (2), 247-266, 2000
Text indexing and dictionary matching with one error
A Amir, D Keselman, GM Landau, M Lewenstein, N Lewenstein, M Rodeh
Journal of Algorithms 37 (2), 309-325, 2000
Uniquely restricted matchings
MC Golumbic, T Hirst, M Lewenstein
Algorithmica 31, 139-154, 2001
On hardness of jumbled indexing
A Amir, TM Chan, M Lewenstein, N Lewenstein
International Colloquium on Automata, Languages, and Programming, 114-125, 2014
Improved algorithms for the k simple shortest paths and the replacement paths problems
Z Gotthilf, M Lewenstein
Information Processing Letters 109 (7), 352-355, 2009
Optimization problems in multiple-interval graphs
A Butman, D Hermelin, M Lewenstein, D Rawitz
ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010
Pattern matching in hypertext
A Amir, M Lewenstein, N Lewenstein
Journal of Algorithms 35 (1), 82-99, 2000
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
Function matching
A Amir, Y Aumann, M Lewenstein, E Porat
SIAM Journal on Computing 35 (5), 1007-1022, 2006
Approximate parameterized matching
C Hazay, M Lewenstein, D Sokol
ACM Transactions on Algorithms (TALG) 3 (3), 29-es, 2007
Dynamic text and static pattern matching
A Amir, GM Landau, M Lewenstein, D Sokol
ACM Transactions on Algorithms (TALG) 3 (2), 19-es, 2007
An improved upper bound for the TSP in cubic 3-edge-connected graphs
D Gamarnik, M Lewenstein, M Sviridenko
Operations Research Letters 33 (5), 467-474, 2005
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
A Amir, G Franceschini, R Grossi, T Kopelowitz, M Lewenstein, ...
SIAM Journal on Computing 43 (4), 1396-1416, 2014
Parameterized matching with mismatches
A Apostolico, PL Erdős, M Lewenstein
Journal of Discrete Algorithms 5 (1), 135-140, 2007
Constrained LCS: hardness and approximation
Z Gotthilf, D Hermelin, M Lewenstein
Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008, Pisa, Italy …, 2008
The system can't perform the operation now. Try again later.
Articles 1–20