Moshe Lewenstein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
71
Venues
13
Active years
1997–2026
Best venue rank
A*
Where they publish
Papers
71 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Set Parameterized Matching via Multi-Layer Hashing. | Moshe Lewenstein, Ely Porat |
| 2024 | STACS | Gapped String Indexing in Subquadratic Space and Sublinear Query Time. | Philip Bille, Inge Li Grtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner |
| 2023 | CPM | String Factorization via Prefix Free Families. | Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia |
| 2019 | ISAAC | On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2018 | ESA | Improved Space-Time Tradeoffs for kSUM. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2017 | CPM | Can We Recover the Cover?. | Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat |
| 2017 | ISAAC | Orthogonal Vectors Indexing. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2017 | WADS | Conditional Lower Bounds for Space/Time Tradeoffs. | Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2016 | ESA | How Hard is it to Find (Honest) Witnesses?. | Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2015 | CPM | Longest Common Extensions in Sublinear Space. | Philip Bille, Inge Li Grtz, Mathias Bk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhj |
| 2015 | CPM | Fast String Dictionary Lookup with One Error. | Timothy M. Chan, Moshe Lewenstein |
| 2015 | CPM | Range Minimum Query Indexes in Higher Dimensions. | Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein |
| 2015 | STOC | Clustered Integer 3SUM via Additive Combinatorics. | Timothy M. Chan, Moshe Lewenstein |
| 2015 | SPIRE | Beyond the Runs Theorem. | Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein |
| 2015 | SPIRE | Range LCP Queries Revisited. | Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan |
| 2014 | ESA | Weighted Ancestors in Suffix Trees. | Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson |
| 2014 | ESA | Improved Explicit Data Structures in the Bitprobe Model. | Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman |
| 2014 | ICALP | On Hardness of Jumbled Indexing. | Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein |
| 2014 | MFCS | Document Retrieval with One Wildcard. | Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan |
| 2014 | STACS | Space-Efficient String Indexing for Wildcard Pattern Matching. | Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter |
| 2013 | CPM | LCP Magic. | Moshe Lewenstein |
| 2013 | ISAAC | Succinct Data Structures for Representing Equivalence Classes. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman |
| 2013 | ISAAC | Less Space: Indexing for Queries with Wildcards. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan |
| 2013 | WADS | Finding the Minimum-Weight k-Path. | Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty |
| 2012 | ESA | Two Dimensional Range Minimum Queries and Fibonacci Lattices. | Gerth Stlting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao |
| 2012 | LATIN | Forbidden Patterns. | Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mkinen, Leena Salmela, Niko Vlimki |
| 2012 | SPIRE | Parikh Matching in the Streaming Model. | Lap-Kei Lee, Moshe Lewenstein, Qin Zhang |
| 2011 | CPM | Restricted Common Superstring and Restricted Common Supersequence. | Raphal Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
| 2011 | CPM | Quick Greedy Computation for Minimum Common String Partitions. | Isaac Goldstein, Moshe Lewenstein |
| 2011 | ISAAC | Range LCP. | Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat |
| 2011 | SODA | Fast, precise and dynamic distance queries. | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
| 2011 | SPIRE | Persistency in Suffix Trees with Applications to String Interval Problems. | Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2011 | SPIRE | Indexing with Gaps. | Moshe Lewenstein |
| 2010 | SPIRE | Restricted LCS. | Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein |
| 2010 | SPIRE | On Shortest Common Superstring and Swap Permutations. | Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
| 2009 | CPM | Generalized Substring Compression. | Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein |
| 2009 | SPIRE | Improved Approximation Results on the Shortest Common Supersequence Problem. | Zvi Gotthilf, Moshe Lewenstein |
| 2008 | CPM | Constrained LCS: Hardness and Approximation. | Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein |
| 2008 | CPM | On the Longest Common Parameterized Subsequence. | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
| 2008 | WAOA | A Approximation Algorithm for the Minimum Maximal Matching Problem. | Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt |
| 2007 | CPM | Two-Dimensional Range Minimum Queries. | Amihood Amir, Johannes Fischer, Moshe Lewenstein |
| 2007 | CPM | Finding Witnesses by Peeling. | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
| 2007 | CPM | On Demand String Sorting over Unbounded Alphabets. | Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
| 2007 | SODA | Optimization problems in multiple-interval graphs. | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz |
| 2007 | SODA | Dynamic weighted ancestors. | Tsvi Kopelowitz, Moshe Lewenstein |
| 2007 | SPIRE | Approximating Constrained LCS. | Zvi Gotthilf, Moshe Lewenstein |
| 2007 | WADS | Range Non-overlapping Indexing and Successive List Indexing. | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
| 2006 | ICALP | Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. | Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein |
| 2005 | CPM | Two Dimensional Parameterized Matching. | Carmit Hazay, Moshe Lewenstein, Dekel Tsur |
| 2005 | SODA | Dotted interval graphs and high throughput genotyping. | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
| 2005 | SPIRE | Towards Real-Time Suffix Tree Construction. | Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein |
| 2005 | WAOA | Tighter Approximations for Maximum Induced Matchings in Regular Graphs. | Zvi Gotthilf, Moshe Lewenstein |
| 2004 | ESA | Approximate Parameterized Matching. | Carmit Hazay, Moshe Lewenstein, Dina Sokol |
| 2004 | ICALP | Closest Pair Problems in Very High Dimensions. | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
| 2004 | STOC | Dictionary matching and indexing with errors and don't cares. | Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein |
| 2004 | SPIRE | Efficient One Dimensional Real Scaled Matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur |
| 2003 | FOCS | Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
| 2003 | ICALP | Function Matching: Algorithms, Applications, and a Lower Bound. | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat |
| 2003 | SODA | Multidimensional matching and fast search in suffix trees. | Richard Cole, Moshe Lewenstein |
| 2003 | SODA | Approximating asymmetric maximum TSP. | Moshe Lewenstein, Maxim Sviridenko |
| 2003 | WADS | Real Two Dimensional Scaled Matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat |
| 2003 | WADS | Dynamic Text and Static Pattern Matching. | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol |
| 2001 | SODA | Overlap matching. | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | SODA | Approximate subset matching with Don't Cares. | Amihood Amir, Ely Porat, Moshe Lewenstein |
| 2001 | SODA | A faster implementation of the Goemans-Williamson clustering algorithm. | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2000 | SODA | Real scaled matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein |
| 2000 | SODA | Faster algorithms for string matching with | Amihood Amir, Moshe Lewenstein, Ely Porat |
| 1999 | WADS | Indexing and Dictionary Matching with One Error. | Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh |
| 1998 | CPM | Efficient Special Cases of Pattern Matching with Swaps. | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
| 1997 | FOCS | Pattern Matching with Swaps. | Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
| 1997 | WADS | Pattern Matching In Hypertext. | Amihood Amir, Moshe Lewenstein, Noa Lewenstein |