Moshe Lewenstein

Moshe Lewenstein: LCP Magic. CPM 2013: 11

Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein: An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012)

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)

Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao: Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228

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

Lap-Kei Lee, Moshe Lewenstein, Qin Zhang: Parikh Matching in the Streaming Model. SPIRE 2012: 336-341

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

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

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

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

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

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

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

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

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Permuted Common Supersequence. CoRR abs/1004.0424 (2010)

Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010)

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)

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

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

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)

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)

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, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)

Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein: Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) 2006: 358-369

Moshe Lewenstein, Gabriel Valiente (Eds.): Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings. Lecture Notes in Computer Science 4009, Springer 2006, isbn 3-540-35455-7

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005)

David Gamarnik, Moshe Lewenstein, Maxim Sviridenko: An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005)

Don Coppersmith, Moshe Lewenstein: Constructive Bounds on Ordered Factorizations. SIAM J. Discrete Math. 19(2): 301-303 (2005)

Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279

Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348

Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein: Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78

Zvi Gotthilf, Moshe Lewenstein: Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281

Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004)

Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate Parameterized Matching. ESA 2004: 414-425

Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9

Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein: Dictionary matching and indexing with errors and don't cares. STOC 2004: 91-100

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003)

Moshe Lewenstein, Maxim Sviridenko: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. SIAM J. Discrete Math. 17(2): 237-248 (2003)

Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65

Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942

Moshe Lewenstein, Maxim Sviridenko: Approximating asymmetric maximum TSP. SODA 2003: 646-654

Richard Cole, Moshe Lewenstein: Multidimensional matching and fast search in suffix trees. SODA 2003: 851-852

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic Text and Static Pattern Matching. WADS 2003: 340-352

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364

Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002)

Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein: Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)

Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288

Amihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306

Martin Charles Golumbic, Moshe Lewenstein: New results on induced matchings. Discrete Applied Mathematics 101(1-3): 157-165 (2000)

Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000)

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000)

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000)

Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311

Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803

Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real scaled matching. SODA 2000: 815-816

Tirza Hirst, Moshe Lewenstein: Alternation and Bounded Concurrency Are Reverse Equivalent. Inf. Comput. 152(2): 173-187 (1999)

Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999)

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Indexing and Dictionary Matching with One Error. WADS 1999: 181-192

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998)

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220

Amihood Amir, Alberto Apostolico, Moshe Lewenstein: Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997)

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. FOCS 1997: 144-153

Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching In Hypertext. WADS 1997: 160-173