Prof. Moshe Lewenstein

Prof.
Prof. Moshe Lewenstein
Telephone: 
Fax: 
Office: 

Publications

  1. Lewenstein, M. "A 5/8 Approximation For the Maximum Asymmetric TSP" Journal of Discrete Mathematics, vol. 17, 2004, p. 237-248.

  2. Cole, Richard, Lewenstein, Moshe. "Dictionary Matching And Indexing With Errors And Don't Cares" Symposium On Theory of Computing (STOC), 2004.

  3. Kaplan, Haim, Lewenstein, Moshe, Nira, Shafrir, Sviridenko, Maxim. "A 2/3 Aproximation For Maximum Asymmetric TSP Be Decomposing Directed Regular Multigraphs" Foundations of Computer Science (FOCS), 2003, p. 56-67.

  4. Amir, Amihood, Landau, G.M., Lewenstein, Moshe, Sokol, D.. "Dynamic Text And Static Pattern Matching" Lecture Notes On Computer Science, vol. 2748, 2003, p. 340-352.
     
  5. Lewenstein, Moshe, Sviridenko, Maxim. "Approximating Asymmetric Maximum TSP" Symposium On Discrete Algorithms (SODA), 2003, p. 646-654.
     
  6. Lewenstein, M. and Cole, R. "Multidimensional Matching and Fast Search in Suffix Trees" Symposium On Discrete Algorithms (SODA), 2003, p. 851-852.
     
  7. Amir, A.; Cole, R.; Hariharan, R.; Lewenstein, M. and Porat, E. "Overlap Matching" Information And Computation, vol. 181, 2003, p. 57-74.
     
  8. Amir, Amihood, Aumann, Yonatan, Cole, R., Lewenstein, Moshe, Porat, Ely. "Function Matching: Algorithms, Applications And a Lower Bound" ICALP, vol. 2719, 2003, p. 929-942.
     
  9. Porat, E. "Real Two Dimensional Scaled Matching" Lecture Notes On Computer Science, vol. 2748, 2003, p. 353-364.
     
  10. Amir, A.; Lewenstein, M. and Porat, E. "Approximate Swapped Matching" Information Processing Letters, vol. 83, 2002, p. 33-39.
     
  11. Golumbic, M.C.; Hirst, T. and Lewenstein, M. "Uniquely Resrticted Matchings in Graphs" Algorithmica, vol. 31, 2001, p. 139-154.
     
  12. Cole, R.; Hariharan, R.; Lewenstein, M. and Porat, E. "A Faster Implementation of the Goemans-Williamson Clustering Algorithm" Symposium On Discrete Algorithms (SODA), 2001, p. 17-25.
     
  13. Amir, A.; Lewenstein, M. and Porat, E. "Approximate Subset Matching With Don't Care" Symposium On Discrete Algorithms (SODA), 2001, p. 305-306.
     
  14. Amir, Amihood, Cole, Richard, Hariharan, Ramesh, Lewenstein, Moshe, Porat, Ely. "Overlap Matching" Symposium On Discrete Algorithms (SODA), 2001, p. 279-288.
     
  15. Amir, Amihood, Keselman, D., Landau, G.M., Lewenstein, Moshe, Lewenstein, N., Rodeh, M.. "Text Indexing and Dictionary Matching with One Error" Journal of Algorithms, vol. 37, 2000, p. 309-325.
     
  16. Golumbic, M. and Lewenstein, M. "New Results on Strong Matchings" Discrete Applied Math, vol. 101, 2000, p. 157-165.
     
  17. Amir, Amihood, Aumann, Yonatan, Landau, G.M., Lewenstein, Moshe, Lewenstein, N.. "Pattern Matching with Swaps" Journal of Algorithms, vol. 37, 2000, p. 247-266.
     
  18. Lewenstein, M.; Amir, A. and Porat, E. "Faster String Matching with K Mismatches" SODA, 2000, p. 794-803.
     
  19. Lewenstein, Moshe. "Pattern Matching in Hypertext" Journal of Algorithms, vol. 35, 2000, p. 82-99.
     
  20. Golumbic, Martin Charles, Lewenstein, Moshe. "New Results On Induced Matchings" Discrete Applied Mathematics, vol. 101, 2000, p. 157-165.
     
  21. Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe. "Real Scaled Matching" SODA, 2000, p. 815-816.
     
  22. Porat, E.; Amir, A. and Lewenstein, M. "Approximate Swapped Matching" FSTTCS, 2000, p. 302-311.
     
  23. Porat, E.; Amir, A. and Lewenstein, M. "Faster Algorithms for String Matching with K Mismatches" Journal of Algorithms, 2000, p. 794-803.
     
  24. Amir, Amihood, Keselman, D., Landau, G., Lewenstein, Moshe, Lewenstein, N., Rodeh, M.. "Indexing and Dictionary Matching with One Error" Algorithms And Data Structures (WADS), vol. 1663, 1999, p. 181-192.
     
  25. Lewenstein, M. "Alternation and Bounded Concurrency Are Reverse Equivalent" Information and Computation, vol. 152, 1999, p. 173-187.
     
  26. Lewenstein, M. "Real Scaled Matching" Information Processing Letters, vol. 70, 1999, p. 185-190.
     
  27. Amir, A.; Landau, G.; Lewenstein, M. and Lewenstein, N. "Efficient Special Cases of Pattern Matching with Swaps" Information Processing Letters, vol. 68, 1998, p. 125-132.
     
  28. Amir, A.; Landau, G. and Lewenstein, M. "Efficient Special Cases of Pattern Matching With Swaps" CPM, 1998, p. 209-220.
     
  29. Amir, Amihood, Lewenstein, N., Lewenstein, Moshe. "Pattern Matching in Hypertext" Algorithms And Data Structures (WADS), 1997, p. 160-173.
     
  30. Amir, Amihood, Aumann, Yonatan, Landau, G., Lewenstein, N., Lewenstein, Moshe. "Pattern Matching With Swaps" Foundations of Computer Science (FOCS), 1997, p. 148-153.
     
  31. Lewenstein, M. "Inverse Pattern Matching" Journal of Algorithms, vol. 24, 1997, p. 325-339

Research

Algorithms, Approximation Algorithms, Pattern Matching, Data structures