Ph.D and MS.c Theses, since 1988.
| Advisor | Prof. Kaminski Michael |
| Advisor's Email | kaminski@cs.technion.ac.il |
| Advisor's Home-Site | www |
| No of theses | 15 |
| Department | Computer Science |
| Department Web Site | www.cs.technion.ac.il |
No. |
Student's Name | Graduation Year  |
Degree | Abstracts | ResearchName |
|---|---|---|---|---|---|
| 1 | Daniel Genkin | 2011 | MSc | Abstracts | Radical Lexicalization of Mildly Context-Sensitive Languages |
| 2 | Tamar Aizikowitz | 2011 | PhD | Abstracts | Synchronized Alternating Pushdown Automata |
| 3 | Adam Carmi | 2010 | MSc | Abstracts | Adaptive Multi-Pass Parsing |
| 4 | Tony Tan | 2009 | PhD | Abstracts | Pebble Automata for Data Languages: Separation, Decidability and Undecidability |
| 5 | Ron Gross | 2008 | MSc | Abstracts | Invariance under Stuttering in Branching-Time Temporal Logic |
| 6 | Yulia Dubov | 2008 | MSc | Abstracts | Infinite Alphabet Pushdown Automata: Various Approaches and Comparison of Their Consequences |
| 7 | Benjamin Grimberg | 2007 | MSc | Abstracts | Minimal Model semantics for First-Order Ground Non-Monotonic Modal Logic |
| 8 | Daniel Zeitlin | 2006 | MSc | Abstracts | Look-Ahead Finite-Memory Automata |
| 9 | Julia Mosin | 2001 | MSc | Base Dependence of Extensions for Open Default Theories | |
| 10 | Yael Yariv | 2001 | MSc | An Alternative Semantics of Temporal Logic of Actions | |
| 11 | Yael Zbar | 2000 | MSc | Open Default Theories | |
| 12 | Shay Artzi | 2000 | MSc | Lower Bounds on the Complexity of Polynomail Multiplication Over Finite Fields | |
| 13 | Guy Rey | 2000 | MSc | First-Order Non-Monotonic Logic | |
| 14 | Arie Tal | 1999 | MSc | Decidability of Inclusion for Unification Based Automata | |
| 15 | Nader Bshouty | 1989 | PhD | Bounds on Multiplicative Complexity of Sets of Bilinear Form |
Last updated on: Tuesday ,May 14, 2013