1 

Labai Nadia 
2015 
MSc 
Abstracts

Definability and Hankel Matrices 
2 

Kotek Tomer 
2012 
PhD 
Abstracts

Definability of Combinatorial Functions 
3 

Averbouch Ilia 
2011 
PhD 
Abstracts

Completeness and Universality Properties of Graph Invariants and Graph Polynomials 
4 

Magid Avi 
2008 
MSc 
Abstracts

Structural Properties of Formulas for which SAT Problem is Easy 
5 

Magid Yonit 
2007 
MSc 
Abstracts

BSS Model of Computation over the Reals and Choice Operator 
6 

Glikson Alexander 
2004 
MSc 
Abstracts

Verification of Generally Intractable Graph Properties on Graphs Generated by Graph Grammars 
7 

Ravve Elena 
1999 
PhD 

Decomposition of Databases with Translation Schemes 
8 

Rotics Udi 
1999 
PhD 

Efficient Algorithms for Generally Intractable Graph Problems Restricted to Specific Classes of Graphs 
9 

Ravve Elena 
1995 
MSc 

Model Cheking for Various Notions of Product 
10 

Sharell Abraham 
1993 
MSc 

On the Average Gomplexity of Sat for Fiat Distributions 
11 

Barguri Yaniv 
1992 
MSc 

The Hierarchy of Transitive Closure 
12 

Hasson Ruben 
1992 
MSc 

A Comparison of Data Models Forcomplex Objects 
13 

Kupp MosheZvi 
1992 
MSc 

Program Testing by Acceptability Estimation 
14 

Calo Ariel 
1990 
MSc 

The Expressive Power of the Transitive Closure 
15 

Weissberg Yifat 
1990 
MSc 

Iterative Learning Finite AutomataApplication by Nevral Net 
16 

Ukelson Israel 
1989 
PhD 
