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

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

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

תפקיד:מרצה

מחלקה:ביה"ס למדעי המחשב והמתמטיקה

חדר:2507

טלפון:09-8607879

דוא"ל:[email protected]

1983-1986

B.Sc.: Computer science and Mathematics (major), Bar Ilan University, Ramat Gan, , magna cum laude

1987-1991

M.S Computer science, Bar Ilan University, Ramat Gan, , summa cum laude

Thesis adviser: Prof. David Harel

Thesis topic: CompleIity Results for Multi-Pebble Automata and their Logics

– 1992-1998

Ph.D.: Computer science, Bar Ilam University, Ramat Gan, , Thesis adviser: Prof. Amihood Amir

Thesis topic: Generalized Pattern Matching

Journal publications:

· N. Globerman (Lwenstein) and D. Harel.
Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theoretical Computer Science, 169(2):161-184, 1996.

· Amir, G. Landau, M. Lewenstein and N. Lewenstein.
Efficient Special Cases of Pattern Matching with Swaps.
Information Processing Letters, 68(3):125-132, 1998.

· A. Mmir, Y. Aumann, G. Landau, M. Lewenstein and N. Lewenstein.
Pattern Matching with Swaps. Submitted to Journal of the ACM.

· A. Aimir, M. Lewenstein and N. Lewenstein.
Pattern Matching in Hypertext. Submitted to Journal of Algorithms.

· A. Aimir, G. Landau, M. Lewenstein and N. Lewenstein.
Indexing and Dictionary Matching with One Error.
Submitted to Journal of Algorithms.

Dept. of Computer Science, Netanya Academic College

1998 – current – Lecturer; Computability.

1999 – current .- Lecturer; Data Structures, Discrete Math. Computer Science Depatment, IDC, Herzliya

1999 current – Lecturer; Automata and Formal Languages, Logic and Set Theory. Computer Science Department, Bar Ilan University

1987-1988 – TA; Numerical Analysis, Scientiftic ApplicationS.

1989-1997 – TA; Automata and Formal Languages, ConipUtability. Dept. of Education, Bar Ilan University

1987-1991 – Lecturer; Prolog, Data Structures, Automata.Ministry of Education

1992 – Lecturer; Data Structures, Algorithms, Automata.Computer Science Dept, Open University

1995 – 1996 – Adviser in preparation of Bagrut study book “computational Models”.
1995 – 1997 – Lecturer & Models of computation.

1993 – 1998 – Lecturer; Automata and Formal Languages (partially in accordance with Ramat Gan College).
Dept. of Science reaching, Weizmann Institute

1992 – 1993 – Co-authored a book and study program “Logic Programming" (in hebrew, and used for Bagrut studies).

Conference publications:

· N. Globerman (Lewenstein) and D. Harel.
Complexity Results for Two-Way and MultiPebb1e Automata and their Logics.
Pc. of ICALP 1994.

· A. Amir, Y. Aumaxin, Cl Landau, M. LewenStein and N. Lewenstein.
Pattern Matching with Swaps.
proceedings, 88th Annual IEEE Conference on Foundations of Computer Science (FOCS), Miami Beach, Florida, 1997.

· A. Amir, M. Lewenstein and N. Lewenstein.
Pattern Matching in Hypertext.
Proceedings, 5th Workshop of Algorithms and Data Structures (WADS) Halifax, Canada, 1997.

· A. Aniir, G. Landau, M. LewenStein and N. LewenStein.
Efficient Special Cases of Pattern Matching with Swaps.
Proceedings, The 8th Annual Symposium on Combinat07i° Pattern Matching (CPM), New Jersey, July 1998.

· A. Amir, G. Landau, M. Lewenstein and N. Lewenstein.
Indexing and Dictionary Matching with One Error.
To appear in proceedings, 5th Workshop of Algorithms and Data Structures (WADS), Vancouver, Canada, 1999.