ד"ר נועה לוונשטיין

Dr. Noa Lewenstein

מוסד עיקרי

המכללה האקדמית נתניה

Netanya Academic College

דוא״ל

noa.lewenstein@gmail.com

דיסציפלינות ראשיותMain Disciplines

Computer Sciences

פרסומים ויצירות עיקריים / עדכנייםMain / Recent Publications

Ayelet Butman, Noa Lewenstein, J. Ian Munro, Permuted scaled matching, Theoretical Computer Science, Volume 638, 2016, Pages 27-32, ISSN 0304-3975
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg, Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings, Theoretical Computer Science, Volume 656, Part B, 2016, Pages 146-159, ISSN 0304-3975
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein, Detecting approximate periodic patterns, Theoretical Computer Science, Volume 525,
2014, Pages 60-67, ISSN 0304-3975
Amir A., Apostolico A., Hirst T., Landau G.M., Lewenstein N., Rozenberg L. (2014) Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. In: Moura E., Crochemore M. (eds) String Processing and Information Retrieval. SPIRE 2014. Lecture Notes in Computer Science, vol 8799. Springer, Cham.
Amir A., Chan T.M., Lewenstein M., Lewenstein N. (2014) On Hardness of Jumbled Indexing. In: Esparza J., Fraigniaud P., Husfeldt T., Koutsoupias E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg.
Butman A., Lewenstein N., Munro J.I. (2014) Permuted Scaled Matching. In: Kulikov A.S., Kuznetsov S.O., Pevzner P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham.
Amir, Amihood & Franceschini, Gianni & Grossi, Roberto & Kopelowitz, Tsvi & Lewenstein, Moshe & Lewenstein, Noa. (2013). Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. SIAM Journal on Computing. 43