Student Projects

Total number of students: 13

Undergraduates

  1. Michael Beder: Bilinear Feferman-Vaught Theorem
    sbederml@t2
  2. Ariel Birnbaum: Algorithms for almost sure FOL Theories
    s0askyle@t2
  3. Eli Hag': Complexity of Ehrenfeucht Fraisse Games
    salihage@t2

Graduates

  1. Ilya Averbouch: Computing matching polynomials for k-sums.
    ailia@cs
  2. Gilad Ben-Ari: Final editing of the course slides
    bagilad@cs
  3. Beny Godlin (with Ronen Fishman): Permanents and determinants of matrices of bounded tree-width
    bgodlin@cs
  4. Bella Dubrov: Graph polynomials in chemistry
    dubrov@cs
  5. Orly Yahalom: Matrices of bounded tree width
    oyahalom@cs
  6. Arie Matsliach: Speed (density) of monotone, hereditary and MSOL definable graph properties
    ariem@cs
  7. Eyal Rozenberg: Properties implying finite Specker index (+lecture on tree width)
    eyalroz@cs
  8. Ronen Fishman (with Beny Godlin): not enrolled
    ronenf@cs
  9. Avi Magid: not enrolled
    magid@tx