Moshe Lewenstein

According to our database1, Moshe Lewenstein authored at least 135 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe.
CoRR, 2019

Can We Recover the Cover?
Algorithmica, 2019

2018
Improved Space-Time Tradeoffs for kSUM.
CoRR, 2018

Improved Space-Time Tradeoffs for kSUM.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Orthogonal Vectors Indexing.
CoRR, 2017

Conditional Lower Bounds for Space/Time Tradeoffs.
CoRR, 2017

How Hard is it to Find (Honest) Witnesses?
CoRR, 2017

On the Succinct Representation of Equivalence Classes.
Algorithmica, 2017

Conditional Lower Bounds for Space/Time Tradeoffs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Orthogonal Vectors Indexing.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Can We Recover the Cover?.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Parameterized Pattern Matching.
Encyclopedia of Algorithms, 2016

Dictionary Matching.
Encyclopedia of Algorithms, 2016

Document retrieval with one wildcard.
Theor. Comput. Sci., 2016

Two dimensional range minimum queries and Fibonacci lattices.
Theor. Comput. Sci., 2016

Special issue in honor of the 60th birthday of Amihood Amir.
Theor. Comput. Sci., 2016

Structure and Hardness in P (Dagstuhl Seminar 16451).
Dagstuhl Reports, 2016

How Hard is it to Find (Honest) Witnesses?.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Clustered Integer 3SUM via Additive Combinatorics.
CoRR, 2015

Longest Common Extensions in Sublinear Space.
CoRR, 2015

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
Algorithmica, 2015

Clustered Integer 3SUM via Additive Combinatorics.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Range LCP Queries Revisited.
Proceedings of the String Processing and Information Retrieval, 2015

Beyond the Runs Theorem.
Proceedings of the String Processing and Information Retrieval, 2015

Range Minimum Query Indexes in Higher Dimensions.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Fast String Dictionary Lookup with One Error.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Longest Common Extensions in Sublinear Space.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Less space: Indexing for queries with wildcards.
Theor. Comput. Sci., 2014

Generalized substring compression.
Theor. Comput. Sci., 2014

Quick greedy computation for minimum common string partition.
Theor. Comput. Sci., 2014

Two-Dimensional Parameterized Matching.
ACM Trans. Algorithms, 2014

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing.
SIAM J. Comput., 2014

Range LCP.
J. Comput. Syst. Sci., 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.
CoRR, 2014

Weighted ancestors in suffix trees.
CoRR, 2014

On Hardness of Jumbled Indexing.
CoRR, 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Document Retrieval with One Wildcard.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On Hardness of Jumbled Indexing.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Improved Explicit Data Structures in the Bitprobe Model.
Proceedings of the Algorithms - ESA 2014, 2014

Weighted Ancestors in Suffix Trees.
Proceedings of the Algorithms - ESA 2014, 2014

Hypertext Searching - A Survey.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

2013
Succinct data structures for representing equivalence classes.
CoRR, 2013

Orthogonal Range Searching for Text Indexing.
CoRR, 2013

Finding the Minimum-Weight k-Path.
CoRR, 2013

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
CoRR, 2013

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing.
CoRR, 2013

Finding the Minimum-Weight k-Path.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Less Space: Indexing for Queries with Wildcards.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Succinct Data Structures for Representing Equivalence Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

LCP Magic.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Orthogonal Range Searching for Text Indexing.
Proceedings of the Space-Efficient Data Structures, 2013

2012
On demand string sorting over unbounded alphabets.
Theor. Comput. Sci., 2012

Dotted interval graphs.
ACM Trans. Algorithms, 2012

An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett., 2012

Parikh Matching in the Streaming Model.
Proceedings of the String Processing and Information Retrieval, 2012

Forbidden Patterns.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Two Dimensional Range Minimum Queries and Fibonacci Lattices.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Finding witnesses by peeling.
ACM Trans. Algorithms, 2011

CPM 2006.
J. Discrete Algorithms, 2011

Indexing with Gaps.
Proceedings of the String Processing and Information Retrieval, 2011

Persistency in Suffix Trees with Applications to String Interval Problems.
Proceedings of the String Processing and Information Retrieval, 2011

Fast, precise and dynamic distance queries.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Range LCP.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Quick Greedy Computation for Minimum Common String Partitions.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Restricted Common Superstring and Restricted Common Supersequence.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
Optimization problems in multiple-interval graphs.
ACM Trans. Algorithms, 2010

Fast, precise and dynamic distance queries
CoRR, 2010

Permuted Common Supersequence
CoRR, 2010

On the Longest Common Rigid Subsequence Problem.
Algorithmica, 2010

On Shortest Common Superstring and Swap Permutations.
Proceedings of the String Processing and Information Retrieval, 2010

Restricted LCS.
Proceedings of the String Processing and Information Retrieval, 2010

2009
On the longest common parameterized subsequence.
Theor. Comput. Sci., 2009

Improved algorithms for the k simple shortest paths and the replacement paths problems.
Inf. Process. Lett., 2009

Real Two Dimensional Scaled Matching.
Algorithmica, 2009

Improved Approximation Results on the Shortest Common Supersequence Problem.
Proceedings of the String Processing and Information Retrieval, 2009

Generalized Substring Compression.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Parameterized Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Dictionary Matching and Indexing (Exact and with Errors).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Approximation Algorithm for the Minimum Maximal Matching Problem.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

On the Longest Common Parameterized Subsequence.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Constrained LCS: Hardness and Approximation.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Approximate parameterized matching.
ACM Trans. Algorithms, 2007

Dynamic text and static pattern matching.
ACM Trans. Algorithms, 2007

Parameterized matching with mismatches.
J. Discrete Algorithms, 2007

Efficient one-dimensional real scaled matching.
J. Discrete Algorithms, 2007

Range Non-overlapping Indexing and Successive List Indexing.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Approximating Constrained LCS.
Proceedings of the String Processing and Information Retrieval, 2007

Dynamic weighted ancestors.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Optimization problems in multiple-interval graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On Demand String Sorting over Unbounded Alphabets.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Finding Witnesses by Peeling.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Two-Dimensional Range Minimum Queries.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Function Matching.
SIAM J. Comput., 2006

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Constructive Bounds on Ordered Factorizations.
SIAM J. Discrete Math., 2005

An improved upper bound for the TSP in cubic 3-edge-connected graphs.
Oper. Res. Lett., 2005

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
J. ACM, 2005

Tighter Approximations for Maximum Induced Matchings in Regular Graphs.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Towards Real-Time Suffix Tree Construction.
Proceedings of the String Processing and Information Retrieval, 2005

Dotted interval graphs and high throughput genotyping.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Two Dimensional Parameterized Matching.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Faster algorithms for string matching with k mismatches.
J. Algorithms, 2004

Dictionary matching and indexing with errors and don't cares.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Efficient One Dimensional Real Scaled Matching.
Proceedings of the String Processing and Information Retrieval, 2004

Closest Pair Problems in Very High Dimensions.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Approximate Parameterized Matching.
Proceedings of the Algorithms, 2004

2003
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP.
SIAM J. Discrete Math., 2003

Overlap matching.
Inf. Comput., 2003

Dynamic Text and Static Pattern Matching.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Real Two Dimensional Scaled Matching.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Approximating asymmetric maximum TSP.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Multidimensional matching and fast search in suffix trees.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Function Matching: Algorithms, Applications, and a Lower Bound.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Approximate swapped matching.
Inf. Process. Lett., 2002

2001
Uniquely Restricted Matchings.
Algorithmica, 2001

A faster implementation of the Goemans-Williamson clustering algorithm.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate subset matching with Don't Cares.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Overlap matching.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Pattern Matching in Hypertext.
J. Algorithms, 2000

Text Indexing and Dictionary Matching with One Error.
J. Algorithms, 2000

Pattern Matching with Swaps.
J. Algorithms, 2000

New results on induced matchings.
Discrete Applied Mathematics, 2000

Faster algorithms for string matching with k mismatches.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Real scaled matching.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximate Swapped Matching.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Real Scaled Matching.
Inf. Process. Lett., 1999

Alternation and Bounded Concurrency Are Reverse Equivalent.
Inf. Comput., 1999

Indexing and Dictionary Matching with One Error.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Efficient Special Cases of Pattern Matching with Swaps.
Inf. Process. Lett., 1998

Efficient Special Cases of Pattern Matching with Swaps.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Inverse Pattern Matching.
J. Algorithms, 1997

Pattern Matching In Hypertext.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Pattern Matching with Swaps.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997


  Loading...