Lewenstein, Moshe
96  Ergebnisse:
Personensuche X
?
1

Can We Recover the Cover?:

Amir, Amihood ; Levy, Avivit ; Lewenstein, Moshe..
Algorithmica.  81 (2019)  7 - p. 2857-2875 , 2019
 
?
5

Document retrieval with one wildcard:

Lewenstein, Moshe ; Munro, J. Ian ; Nekrich, Yakov.
Theoretical Computer Science.  635 (2016)  - p. 94-101 , 2016
 
?
6

Clustered Integer 3SUM via Additive Combinatorics:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,
Chan, Timothy M. ; Lewenstein, Moshe - p. 31-40 , 2015
 
?
7

Two-Dimensional Parameterized Matching:

Cole, Richard ; Hazay, Carmit ; Lewenstein, Moshe.
ACM Transactions on Algorithms.  11 (2014)  2 - p. 1-30 , 2014
 
?
8

Range LCP:

Amir, Amihood ; Apostolico, Alberto ; Landau, Gad M....
Journal of Computer and System Sciences.  80 (2014)  7 - p. 1245-1253 , 2014
 
?
 
?
10

Generalized substring compression:

Keller, Orgad ; Kopelowitz, Tsvi ; Landau Feibish, Shir.
Theoretical Computer Science.  525 (2014)  - p. 42-54 , 2014
 
?
12

Two-Dimensional Parameterized Matching:

Cole, Richard ; Hazay, Carmit ; Lewenstein, Moshe.
ACM Transactions on Algorithms (TALG).  11 (2014)  2 - p. 1-30 , 2014
 
?
14

Less space: Indexing for queries with wildcards:

Lewenstein, Moshe ; Ian Munro, J. ; Raman, Venkatesh.
Theoretical Computer Science.  557 (2014)  - p. 120-127 , 2014
 
?
15

String Processing and Information Retrieval 

20th International Symposium, SPIRE 2013, Jerusalem, Israel...  Lecture Notes in Computer Science ; 8214;SpringerLink, Bücher
 
1-15