Student Projects
Total number of students: 13
Undergraduates
-
Michael Beder: Bilinear Feferman-Vaught Theorem
sbederml@t2
-
Ariel Birnbaum: Algorithms for almost sure FOL Theories
s0askyle@t2
-
Eli Hag': Complexity of Ehrenfeucht Fraisse Games
salihage@t2
Graduates
-
Ilya Averbouch: Computing matching polynomials for k-sums.
ailia@cs
-
Gilad Ben-Ari: Final editing of the course slides
bagilad@cs
-
Beny Godlin (with Ronen Fishman): Permanents and determinants of
matrices of bounded tree-width
bgodlin@cs
-
Bella Dubrov: Graph polynomials in chemistry
dubrov@cs
-
Orly Yahalom: Matrices of bounded tree width
oyahalom@cs
-
Arie Matsliach: Speed (density) of monotone, hereditary
and MSOL definable graph properties
ariem@cs
-
Eyal Rozenberg:
Properties implying finite Specker index (+lecture on tree width)
eyalroz@cs
-
Ronen Fishman (with Beny Godlin): not enrolled
ronenf@cs
-
Avi Magid: not enrolled
magid@tx