The following pages link to Moshe Lewenstein (Q287448):
Displaying 50 items.
- (Q209592) (redirect page) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Overlap matching. (Q1401926) (← links)
- Real scaled matching (Q1606937) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Alternation and bounded concurrency are reverse equivalent. (Q1854297) (← links)
- New results on induced matchings (Q1975379) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Conditional lower bounds for space/time tradeoffs (Q2405302) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Generalized substring compression (Q2437745) (← links)
- Efficient one-dimensional real scaled matching (Q2457290) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- (Q2768267) (← links)
- (Q2768306) (← links)
- (Q2768309) (← links)
- Finding the Minimum-Weight k-Path (Q2842177) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Less Space: Indexing for Queries with Wildcards (Q2872074) (← links)
- Succinct Data Structures for Representing Equivalence Classes (Q2872114) (← links)
- Forbidden Patterns (Q2894477) (← links)
- Two Dimensional Range Minimum Queries and Fibonacci Lattices (Q2912843) (← links)
- Weighted Ancestors in Suffix Trees (Q2921431) (← links)
- Improved Explicit Data Structures in the Bitprobe Model (Q2921449) (← links)
- (Q2921688) (← links)
- Document Retrieval with One Wildcard (Q2922639) (← links)
- Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing (Q2929702) (← links)
- Optimization problems in multiple-interval graphs (Q2930319) (← links)
- (Q2934605) (← links)
- (Q2934639) (← links)
- Clustered Integer 3SUM via Additive Combinatorics (Q2941486) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Fast String Dictionary Lookup with One Error (Q2942250) (← links)
- Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
- Dynamic text and static pattern matching (Q2944556) (← links)
- Space-Efficient String Indexing for Wildcard Pattern Matching. (Q2965512) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
