פרופ' משה לוינשטיין

פרופ'
פרופ' משה לוינשטיין
טלפון: 
פקס: 
דוא"ל: 
משרד: 
שעות קבלה: 

פירסומים

Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki: Forbidden Patterns. LATIN 2012: 327-337

Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs. ACM Transactions on Algorithms 8(2): 9 (2012)

Carmel Kent, Moshe Lewenstein, Dafna Sheinwald: On demand string sorting over unbounded alphabets. Theor. Comput. Sci. 426: 66-74 (2012)

Isaac Goldstein, Moshe Lewenstein: Quick Greedy Computation for Minimum Common String Partitions. CPM 2011: 273-284

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Restricted Common Superstring and Restricted Common Supersequence. CPM 2011: 467-478

Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat: Range LCP. ISAAC 2011: 683-692

Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. SODA 2011: 840-853

Moshe Lewenstein: Indexing with Gaps. SPIRE 2011: 135-143

Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat: Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE 2011: 67-80

Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding witnesses by peeling. ACM Transactions on Algorithms 7(2): 24 (2011)

Moshe Lewenstein, Gabriel Valiente: CPM 2006. J. Discrete Algorithms 9(4): 313 (2011)

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein: Restricted LCS. SPIRE 2010: 250-257

Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: On Shortest Common Superstring and Swap Permutations. SPIRE 2010: 270-278

Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms 6(2): (2010)

Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang: On the Longest Common Rigid Subsequence Problem. Algorithmica 56(2): 270-280 (2010)

Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein: Generalized Substring Compression. CPM 2009: 26-38

Zvi Gotthilf, Moshe Lewenstein: Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009)

Zvi Gotthilf, Moshe Lewenstein: Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7): 352-355 (2009)

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein: On the longest common parameterized subsequence. Theor. Comput. Sci. 410(51): 5347-5353 (2009)

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein: On the Longest Common Parameterized Subsequence. CPM 2008: 303-315

Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt: A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278

Moshe Lewenstein: Dictionary Matching and Indexing (Exact and with Errors). Encyclopedia of Algorithms 2008

Moshe Lewenstein: Parameterized Matching. Encyclopedia of Algorithms 2008

Carmel Kent, Moshe Lewenstein, Dafna Sheinwald: On Demand String Sorting over Unbounded Alphabets. CPM 2007: 16-27

Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39

Amihood Amir, Johannes Fischer, Moshe Lewenstein: Two-Dimensional Range Minimum Queries. CPM 2007: 286-294

Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. SODA 2007: 268-277

Tsvi Kopelowitz, Moshe Lewenstein: Dynamic weighted ancestors. SODA 2007: 565-574

Zvi Gotthilf, Moshe Lewenstein: Approximating Constrained LCS. SPIRE 2007: 164-172

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein: Range Non-overlapping Indexing and Successive List Indexing. WADS 2007: 625-636

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic text and static pattern matching. ACM Transactions on Algorithms 3(2): (2007)

Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate parameterized matching. ACM Transactions on Algorithms 3(3): (2007)

Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein: Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007)

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)

 

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

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

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.
 

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.
 
Lewenstein, Moshe, Sviridenko, Maxim. "Approximating Asymmetric Maximum TSP" Symposium On Discrete Algorithms (SODA), 2003, p. 646-654.
 
Lewenstein, M. and Cole, R. "Multidimensional Matching and Fast Search in Suffix Trees" Symposium On Discrete Algorithms (SODA), 2003, p. 851-852.
 
Amir, A.; Cole, R.; Hariharan, R.; Lewenstein, M. and Porat, E. "Overlap Matching" Information And Computation, vol. 181, 2003, p. 57-74.
 
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.
 
Porat, E. "Real Two Dimensional Scaled Matching" Lecture Notes On Computer Science, vol. 2748, 2003, p. 353-364.
 
Amir, A.; Lewenstein, M. and Porat, E. "Approximate Swapped Matching" Information Processing Letters, vol. 83, 2002, p. 33-39.
 
Golumbic, M.C.; Hirst, T. and Lewenstein, M. "Uniquely Resrticted Matchings in Graphs" Algorithmica, vol. 31, 2001, p. 139-154.
 
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.
 
Amir, A.; Lewenstein, M. and Porat, E. "Approximate Subset Matching With Don't Care" Symposium On Discrete Algorithms (SODA), 2001, p. 305-306.
 
Amir, Amihood, Cole, Richard, Hariharan, Ramesh, Lewenstein, Moshe, Porat, Ely. "Overlap Matching" Symposium On Discrete Algorithms (SODA), 2001, p. 279-288.
 
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.
 
Golumbic, M. and Lewenstein, M. "New Results on Strong Matchings" Discrete Applied Math, vol. 101, 2000, p. 157-165.
 
Amir, Amihood, Aumann, Yonatan, Landau, G.M., Lewenstein, Moshe, Lewenstein, N.. "Pattern Matching with Swaps" Journal of Algorithms, vol. 37, 2000, p. 247-266.
 
Lewenstein, M.; Amir, A. and Porat, E. "Faster String Matching with K Mismatches" SODA, 2000, p. 794-803.
 
Lewenstein, Moshe. "Pattern Matching in Hypertext" Journal of Algorithms, vol. 35, 2000, p. 82-99.
 
Golumbic, Martin Charles, Lewenstein, Moshe. "New Results On Induced Matchings" Discrete Applied Mathematics, vol. 101, 2000, p. 157-165.
 
Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe. "Real Scaled Matching" SODA, 2000, p. 815-816.
 
Porat, E.; Amir, A. and Lewenstein, M. "Approximate Swapped Matching" FSTTCS, 2000, p. 302-311.
 
Porat, E.; Amir, A. and Lewenstein, M. "Faster Algorithms for String Matching with K Mismatches" Journal of Algorithms, 2000, p. 794-803.
 
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.
 
Lewenstein, M. "Alternation and Bounded Concurrency Are Reverse Equivalent" Information and Computation, vol. 152, 1999, p. 173-187.
 
Lewenstein, M. "Real Scaled Matching" Information Processing Letters, vol. 70, 1999, p. 185-190.
 
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.
 
Amir, A.; Landau, G. and Lewenstein, M. "Efficient Special Cases of Pattern Matching With Swaps" CPM, 1998, p. 209-220.
 
Amir, Amihood, Lewenstein, N., Lewenstein, Moshe. "Pattern Matching in Hypertext" Algorithms And Data Structures (WADS), 1997, p. 160-173.
 
Amir, Amihood, Aumann, Yonatan, Landau, G., Lewenstein, N., Lewenstein, Moshe. "Pattern Matching With Swaps" Foundations of Computer Science (FOCS), 1997, p. 148-153.
 
Lewenstein, M. "Inverse Pattern Matching" Journal of Algorithms, vol. 24, 1997, p. 325-339

קורסים

89-220 אלגוריתמים 1

89-410 סמינריון במבני נתונים מתקדמים

89-474 סמינר מחקר מתקדם בתיאום דגמים

89-520 מסני נתונים מתקדמים

תחומי מחקר

אלגוריתמים, אלגוריתמים קירוביים, זיהוי דגמים, מבני נתונים