Personal profile
Research interests
Appointed Deputy President in October 2017, Prof. Moshe Lewenstein previously served as the Dean of the Faculty of Exact Sciences and the Chair of the Department of Computer Science. After completing his undergraduate and graduate degrees at Bar-Ilan, Prof. Lewenstein was awarded the coveted Herman Goldstine Memorial Postdoctoral Fellowship at the IBM Thomas J. Watson Research Center. His residency of the highly competitive two year fellowship was spent in the IBM Research Center in Yorktown Heights, New York during 2001-2002. Prof. Lewenstein was also a visiting assistant professor in the Courant Institute of Mathematical Sciences at NYU and a visiting professor in the Computer Science Department of the University of Waterloo, Canada for the years 2000 and 2012, respectively.
His research is on algorithms in general and on pattern matching and data structure design in particular. With his team, he has created novel data structures for fast text indexing, indexing with errors, and online indexing. His research group at Bar-Ilan University has several Ph.D. and M.Sc. students and graduated numerous others. He has authored over 70 papers, edited a couple of books and has served and chaired numerous PC committees and serves as an editor of a journal. He is the recipient of a Google faculty award, an IBM faculty award and was a Gambrinus Fellow.
Education/Academic qualification
PhD, Bar-Ilan University
Oct 1996 → Jan 2000
Award Date: 1 Jan 2000
Master, Bar-Ilan University
Oct 1994 → Sep 1996
Award Date: 1 Sep 1996
Bachelor, Bar-Ilan University
Oct 1991 → Sep 1994
Award Date: 1 Sep 1994
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
Bille, P., Gørtz, I. L., Lewenstein, M., Pissis, S. P., Rotenberg, E. & Steiner, T. A., Mar 2024, 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Beyersdorff, O., Kante, M. M., Kupferman, O. & Lokshtanov, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 289).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
String Factorization via Prefix Free Families
Kraus, M., Lewenstein, M., Popa, A., Porat, E. & Sadia, Y., Jun 2023, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023. Bulteau, L. & Liptak, Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 259).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
Bille, P., Gørtz, I. L., Lewenstein, M., Pissis, S. P., Rotenberg, E. & Steiner, T. A., 30 Nov 2022, p. 21.Research output: Working paper › Preprint
Open AccessFile -
Can We Recover the Cover?
Amir, A., Levy, A., Lewenstein, M., Lubin, R. & Porat, B., Jul 2019, In: Algorithmica. p. 2857-2875 19 p.Research output: Contribution to journal › Article › peer-review
-
On the hardness of set disjointness and set intersection with bounded universe
Goldstein, I., Lewenstein, M. & Porat, E., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review