Moshe Lewenstein

From MaRDI portal
Person:287448

Available identifiers

zbMath Open lewenstein.mosheMaRDI QIDQ287448

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58755672023-02-03Paper
Pattern matching in hypertext2022-08-19Paper
https://portal.mardi4nfdi.de/entity/Q50095972021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51362592020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51108912020-05-25Paper
Can we recover the cover?2019-05-21Paper
Two-Dimensional Parameterized Matching2018-10-30Paper
https://portal.mardi4nfdi.de/entity/Q46063162018-03-02Paper
On the succinct representation of equivalence classes2017-10-09Paper
https://portal.mardi4nfdi.de/entity/Q53650852017-09-29Paper
Conditional lower bounds for space/time tradeoffs2017-09-22Paper
https://portal.mardi4nfdi.de/entity/Q29655122017-03-03Paper
Less space: indexing for queries with wildcards2016-06-27Paper
Two dimensional range minimum queries and Fibonacci lattices2016-06-16Paper
Efficient special cases of pattern matching with swaps2016-06-09Paper
Document retrieval with one wildcard2016-05-26Paper
Dynamic text and static pattern matching2015-09-02Paper
Clustered Integer 3SUM via Additive Combinatorics2015-08-21Paper
Longest Common Extensions in Sublinear Space2015-08-20Paper
Fast String Dictionary Lookup with One Error2015-08-20Paper
Range Minimum Query Indexes in Higher Dimensions2015-08-20Paper
Suffix trays and suffix trists: structures for faster text indexing2015-07-10Paper
Hypertext Searching - A Survey2015-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29346052014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346392014-12-18Paper
Optimization problems in multiple-interval graphs2014-11-18Paper
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing2014-11-14Paper
Document Retrieval with One Wildcard2014-10-14Paper
https://portal.mardi4nfdi.de/entity/Q29216882014-10-13Paper
Weighted Ancestors in Suffix Trees2014-10-08Paper
Improved Explicit Data Structures in the Bitprobe Model2014-10-08Paper
Finding witnesses by peeling2014-09-09Paper
Dotted interval graphs2014-09-09Paper
On Hardness of Jumbled Indexing2014-07-01Paper
Quick greedy computation for minimum common string partition2014-06-23Paper
Range LCP2014-06-10Paper
Generalized substring compression2014-03-13Paper
Less Space: Indexing for Queries with Wildcards2014-01-14Paper
Succinct Data Structures for Representing Equivalence Classes2014-01-14Paper
Orthogonal Range Searching for Text Indexing2013-09-13Paper
Finding the Minimum-Weight k-Path2013-08-12Paper
An efficient algorithm to test square-freeness of strings compressed by straight-line programs2012-10-23Paper
Two Dimensional Range Minimum Queries and Fibonacci Lattices2012-09-25Paper
Forbidden Patterns2012-06-29Paper
On demand string sorting over unbounded alphabets2012-05-30Paper
Range LCP2011-12-16Paper
Quick Greedy Computation for Minimum Common String Partitions2011-06-29Paper
Restricted Common Superstring and Restricted Common Supersequence2011-06-29Paper
Dictionary matching and indexing with errors and don't cares2010-08-15Paper
Approximate parameterized matching2010-08-14Paper
Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems2010-06-16Paper
Algorithms and Data Structures2010-04-20Paper
Algorithms and Data Structures2010-04-20Paper
On the longest common rigid subsequence problem2010-02-23Paper
On the longest common parameterized subsequence2009-11-18Paper
Real two dimensional scaled matching2009-06-17Paper
Suffix trays and suffix trists: structures for faster text indexing2009-03-12Paper
Range Non-overlapping Indexing and Successive List Indexing2009-02-17Paper
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem2009-02-12Paper
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs2008-12-21Paper
On Demand String Sorting over Unbounded Alphabets2008-06-17Paper
Finding Witnesses by Peeling2008-06-17Paper
Two-Dimensional Range Minimum Queries2008-06-17Paper
Constrained LCS: Hardness and Approximation2008-06-17Paper
On the Longest Common Parameterized Subsequence2008-06-17Paper
Parameterized matching with mismatches2008-05-16Paper
Efficient one-dimensional real scaled matching2007-10-30Paper
Approximation and Online Algorithms2007-02-12Paper
String Processing and Information Retrieval2006-10-24Paper
Function Matching2006-06-01Paper
Constructive Bounds on Ordered Factorizations2006-06-01Paper
Combinatorial Pattern Matching2005-12-14Paper
An improved upper bound for the TSP in cubic 3-edge-connected graphs2005-08-25Paper
Automata, Languages and Programming2005-08-24Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30247762005-07-04Paper
Faster algorithms for string matching with k mismatches2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44724532004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44713542004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713822004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44492302004-02-08Paper
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP2004-01-08Paper
Overlap matching.2003-08-19Paper
Approximate swapped matching.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27682672003-01-20Paper
Alternation and bounded concurrency are reverse equivalent.2003-01-14Paper
Real scaled matching2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27683062002-06-18Paper
https://portal.mardi4nfdi.de/entity/Q27683092002-01-30Paper
Uniquely restricted matchings2001-10-14Paper
Text Indexing and Dictionary Matching with One Error2001-04-02Paper
Pattern Matching with Swaps2000-12-19Paper
New results on induced matchings2000-12-11Paper
Pattern Matching in Hypertext2000-10-04Paper
https://portal.mardi4nfdi.de/entity/Q49527022000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49527042000-05-10Paper
Inverse Pattern Matching1997-10-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Moshe Lewenstein