Moshe Lewenstein

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 20

Top Venues

Publications

Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS (2024)
Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia
String Factorization via Prefix Free Families. CPM (2023)
Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR (2022)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover? Algorithmica 81 (7) (2019)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ISAAC (2019)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. CoRR (2019)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
Improved Space-Time Tradeoffs for kSUM. CoRR (2018)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
Improved Space-Time Tradeoffs for kSUM. ESA (2018)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
Orthogonal Vectors Indexing. ISAAC (2017)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
How Hard is it to Find (Honest) Witnesses? CoRR (2017)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover?. CPM (2017)
Isaac Goldstein, Moshe Lewenstein, Ely Porat
Orthogonal Vectors Indexing. CoRR (2017)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Conditional Lower Bounds for Space/Time Tradeoffs. WADS (2017)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Conditional Lower Bounds for Space/Time Tradeoffs. CoRR (2017)
Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan
On the Succinct Representation of Equivalence Classes. Algorithmica 78 (3) (2017)
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
Document retrieval with one wildcard. Theor. Comput. Sci. 635 (2016)
Moshe Lewenstein, Seth Pettie, Virginia Vassilevska Williams
Structure and Hardness in P (Dagstuhl Seminar 16451). Dagstuhl Reports 6 (11) (2016)
Gary Benson, Martin Farach-Colton, Moshe Lewenstein, Ely Porat
Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. 638 (2016)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638 (2016)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
How Hard is it to Find (Honest) Witnesses?. ESA (2016)
Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
Longest Common Extensions in Sublinear Space. CoRR (2015)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72 (2) (2015)
Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein
Beyond the Runs Theorem. SPIRE (2015)
Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
Longest Common Extensions in Sublinear Space. CPM (2015)
Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
Range Minimum Query Indexes in Higher Dimensions. CPM (2015)
Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan
Range LCP Queries Revisited. SPIRE (2015)
Timothy M. Chan, Moshe Lewenstein
Clustered Integer 3SUM via Additive Combinatorics. STOC (2015)
Timothy M. Chan, Moshe Lewenstein
Fast String Dictionary Lookup with One Error. CPM (2015)
Timothy M. Chan, Moshe Lewenstein
Clustered Integer 3SUM via Additive Combinatorics. CoRR (2015)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. J. Comput. Syst. Sci. 80 (7) (2014)
Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
On Hardness of Jumbled Indexing. CoRR (2014)
Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein
Generalized substring compression. Theor. Comput. Sci. 525 (2014)
Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
Weighted Ancestors in Suffix Trees. ESA (2014)
Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
Weighted ancestors in suffix trees. CoRR (2014)
Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman
Improved Explicit Data Structures in the Bitprobe Model. ESA (2014)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43 (4) (2014)
Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11 (2) (2014)
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
Document Retrieval with One Wildcard. MFCS (2) (2014)
Isaac Goldstein, Moshe Lewenstein
Quick greedy computation for minimum common string partition. Theor. Comput. Sci. 542 (2014)
Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
On Hardness of Jumbled Indexing. ICALP (1) (2014)
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557 (2014)
Amihood Amir, Moshe Lewenstein, Noa Lewenstein
Hypertext Searching - A Survey. Language, Culture, Computation (1) (2014)
Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter
Space-Efficient String Indexing for Wildcard Pattern Matching. STACS (2014)
Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter
Space-Efficient String Indexing for Wildcard Pattern Matching. CoRR (2014)
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
Finding the Minimum-Weight k-Path. WADS (2013)
Moshe Lewenstein
Orthogonal Range Searching for Text Indexing. CoRR (2013)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR (2013)
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
Succinct data structures for representing equivalence classes. CoRR (2013)
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
Succinct Data Structures for Representing Equivalence Classes. ISAAC (2013)
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
Less Space: Indexing for Queries with Wildcards. ISAAC (2013)
Moshe Lewenstein
LCP Magic. CPM (2013)
Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty
Finding the Minimum-Weight k-Path. CoRR (2013)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR (2013)
Moshe Lewenstein
Orthogonal Range Searching for Text Indexing. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
On demand string sorting over unbounded alphabets. Theor. Comput. Sci. 426 (2012)
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) (2012)
Lap-Kei Lee, Moshe Lewenstein, Qin Zhang
Parikh Matching in the Streaming Model. SPIRE (2012)
Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki
Forbidden Patterns. LATIN (2012)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA (2012)
Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
Dotted interval graphs. ACM Trans. Algorithms 8 (2) (2012)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding witnesses by peeling. ACM Trans. Algorithms 7 (2) (2011)
Moshe Lewenstein, Gabriel Valiente
CPM 2006. J. Discrete Algorithms 9 (4) (2011)
Moshe Lewenstein
Indexing with Gaps. SPIRE (2011)
Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE (2011)
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
Restricted Common Superstring and Restricted Common Supersequence. CPM (2011)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries. SODA (2011)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. ISAAC (2011)
Isaac Goldstein, Moshe Lewenstein
Quick Greedy Computation for Minimum Common String Partitions. CPM (2011)
Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
On Shortest Common Superstring and Swap Permutations. SPIRE (2010)
Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang
On the Longest Common Rigid Subsequence Problem. Algorithmica 56 (2) (2010)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries CoRR (2010)
Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
Optimization problems in multiple-interval graphs. ACM Trans. Algorithms 6 (2) (2010)
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
Permuted Common Supersequence CoRR (2010)
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
Restricted LCS. SPIRE (2010)
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
Real Two Dimensional Scaled Matching. Algorithmica 53 (3) (2009)
Zvi Gotthilf, Moshe Lewenstein
Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE (2009)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
On the longest common parameterized subsequence. Theor. Comput. Sci. 410 (51) (2009)
Zvi Gotthilf, Moshe Lewenstein
Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109 (7) (2009)
Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein
Generalized Substring Compression. CPM (2009)
Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt
A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA (2008)
Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
Constrained LCS: Hardness and Approximation. CPM (2008)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
On the Longest Common Parameterized Subsequence. CPM (2008)
Carmit Hazay, Moshe Lewenstein, Dina Sokol
Approximate parameterized matching. ACM Trans. Algorithms 3 (3) (2007)
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5 (2) (2007)
Tsvi Kopelowitz, Moshe Lewenstein
Dynamic weighted ancestors. SODA (2007)
Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
Parameterized matching with mismatches. J. Discrete Algorithms 5 (1) (2007)
Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
On Demand String Sorting over Unbounded Alphabets. CPM (2007)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
Range Non-overlapping Indexing and Successive List Indexing. WADS (2007)
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
Dynamic text and static pattern matching. ACM Trans. Algorithms 3 (2) (2007)
Amihood Amir, Johannes Fischer, Moshe Lewenstein
Two-Dimensional Range Minimum Queries. CPM (2007)
Zvi Gotthilf, Moshe Lewenstein
Approximating Constrained LCS. SPIRE (2007)
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding Witnesses by Peeling. CPM (2007)
Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
Optimization problems in multiple-interval graphs. SODA (2007)
Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
Function Matching. SIAM J. Comput. 35 (5) (2006)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) (2006)
Don Coppersmith, Moshe Lewenstein
Constructive Bounds on Ordered Factorizations. SIAM J. Discret. Math. 19 (2) (2005)
Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Towards Real-Time Suffix Tree Construction. SPIRE (2005)
Zvi Gotthilf, Moshe Lewenstein
Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA (2005)
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52 (4) (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) (2005)

Moshe Lewenstein.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Moshe Lewenstein