引用次数
引用: 3,764
H-指数: 34
I10-指数 : 71
出版物: 137
Permuted Common Supersequence
Zvi Gotthilf , Moshe Lewenstein , Raphaël Clifford , Alexandru Popa
2010
String processing and information retrieval : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, proceedings
Ely Porat , Moshe Lewenstein , Oren Kurland
Springer
2013
Combinatorial Pattern Matching: 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings
Moshe Lewenstein , Gabriel Valiente ,
2006
Fast, precise and dynamic distance queries
Liam Roditty , Tsvi Kopelowitz , Yair Bartal , Moshe Lewenstein
symposium on discrete algorithms 840 -853
13
2011
Multidimensional matching and fast search in suffix trees
Moshe Lewenstein , Richard Cole
symposium on discrete algorithms 851 -852
3
2003
A faster implementation of the Goemans-Williamson clustering algorithm
Ely Porat , Moshe Lewenstein , Ramesh Hariharan , Richard Cole
symposium on discrete algorithms 17 -25
24
2001
Approximating asymmetric maximum TSP
Maxim Sviridenko , Moshe Lewenstein
symposium on discrete algorithms 646 -654
11
2003
Dynamic weighted ancestors
Tsvi Kopelowitz , Moshe Lewenstein
symposium on discrete algorithms 565 -574
32
2007
Dotted interval graphs and high throughput genotyping
Yonatan Aumann , Ron Y. Pinter , Moshe Lewenstein , Oren Melamud
symposium on discrete algorithms 339 -348
14
2005
A Approximation Algorithm for the Minimum Maximal Matching Problem.
Zvi Gotthilf , Elad Rainshmidt , Moshe Lewenstein
workshop on approximation and online algorithms 267 -278
5
2008
Parameterized Pattern Matching.
Moshe Lewenstein
Encyclopedia of Algorithms 1525 -1530
3
2016
Structure and Hardness in P (Dagstuhl Seminar 16451)
Moshe Lewenstein , Virginia Vassilevska Williams , Seth Pettie
Dagstuhl Reports 6 ( 11) 34
2
2017
Erratum to: String Processing and Information Retrieval
Ely Porat , Moshe Lewenstein , Oren Kurland
string processing and information retrieval
2013
Restricted LCS
Zvi Gotthilf , Danny Hermelin , Moshe Lewenstein , Gad M. Landau
string processing and information retrieval 250 -257
22
2010
On Hardness of Jumbled Indexing
Moshe Lewenstein , Timothy Chan , Amihood Amir , Amihood Amir
arXiv: Data Structures and Algorithms
2014
Clustered Integer 3SUM via Additive Combinatorics
Moshe Lewenstein , Timothy M. Chan
arXiv: Data Structures and Algorithms
2015
Finding the Minimum-Weight k-Path
Liam Roditty , Avinatan Hassidim , Moshe Lewenstein , Orgad Keller
arXiv: Data Structures and Algorithms
2013
Longest Common Extensions in Sublinear Space
Hjalte Wedel Vildhøj , Inge Li Gørtz , Mathias Bæk Tejs Knudsen , Moshe Lewenstein
arXiv: Data Structures and Algorithms
31
2015
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface
Krishnaram Kenthapadi , Rina Panigrahy , Dimitris Achlioptas , Yossi Azar
symposium on discrete algorithms
2006
Closest Pair Problems in Very High Dimensions
Piotr Indyk , Moshe Lewenstein , Ohad Lipsky , Ely Porat
Automata, Languages and Programming 782 -792
21
2004