Complexity Results for Multi-Pebble Automata and their Logics. - Noa Globerman; David Harel (ICALP, 1994)

Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. - Noa Globerman; David Harel (Theor. Comput. Sci., 1996)

Efficient Special Cases of Pattern Matching with Swaps. - Amihood Amir; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein (Inf. Process. Lett., 1998)

Indexing and Dictionary Matching with One Error. - Amihood Amir; Dmitry Keselman; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein; Michael Rodeh (WADS, 1999)

Pattern Matching with Swaps. - Amihood Amir; Yonatan Aumann; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein (J. Algorithms, 2000)

Text Indexing and Dictionary Matching with One Error. - Amihood Amir; Dmitry Keselman; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein; Michael Rodeh (J. Algorithms, 2000)

Pattern Matching in Hypertext. - Amihood Amir; Moshe Lewenstein; Noa Lewenstein (J. Algorithms, 2000)

Towards Real-Time Suffix Tree Construction. - Amihood Amir; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (SPIRE, 2005)

Jump-Matching with Errors. - Ayelet Butman; Noa Lewenstein; Benny Porat; Ely Porat (SPIRE, 2007)

Teaching students to think nondeterministically. - Michal Armoni; Noa Lewenstein; Mordechai Ben-Ari (SIGCSE, 2008)

Closest Periodic Vectors in L p Spaces. - Amihood Amir; Estrella Eisenberg; Avivit Levy; Noa Lewenstein (ISAAC, 2011)

Finding witnesses by peeling. - Yonatan Aumann; Moshe Lewenstein; Noa Lewenstein; Dekel Tsur (ACM Trans. Algorithms, 2011)

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. - Amihood Amir; Gianni Franceschini; Roberto Grossi; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (CoRR, 2013)

Pattern Matching under Polynomial Transformation. - Ayelet Butman; Peter Clifford; Raphaël Clifford; Markus Jalsenius; Noa Lewenstein; Benny Porat; Ely Porat; Benjamin Sach (SIAM J. Comput., 2013)

Hypertext Searching - A Survey. - Amihood Amir; Moshe Lewenstein; Noa Lewenstein (Language, Culture, Computation (1), 2014)

On Hardness of Jumbled Indexing. - Amihood Amir; Timothy M. Chan; Moshe Lewenstein; Noa Lewenstein (ICALP (1), 2014)

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. - Amihood Amir; Gianni Franceschini; Roberto Grossi; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (SIAM J. Comput., 2014)

Detecting approximate periodic patterns. - Amihood Amir; Alberto Apostolico; Estrella Eisenberg; Gad M. Landau; Avivit Levy; Noa Lewenstein (Theor. Comput. Sci., 2014)

Closest periodic vectors in Lp spaces. - Amihood Amir; Estrella Eisenberg; Avivit Levy; Noa Lewenstein (Theor. Comput. Sci., 2014)

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. - Amihood Amir; Alberto Apostolico; Tirza Hirst; Gad M. Landau; Noa Lewenstein; Liat Rozenberg (Theor. Comput. Sci., 2016)

Permuted scaled matching. - Ayelet Butman; Noa Lewenstein; J. Ian Munro (Theor. Comput. Sci., 2016)