Advisor: Prof. Eli Ben-Sasson
My research interests lie in theoretical computer science and its interactions with modern research directions in discrete mathematics. A unifying theme in my work so far has been the use of methods and techniques from the mathematical field of additive combinatorics for making progress on open problems in the area of computational complexity, most notably in the sub-fields of pseudorandomness, communication complexity and local decoding.
I did my M.Sc. at the department of computer science at the Technion under the supervision of Prof. Ron Aharoni and Prof. Seffi Naor. My M.Sc. research focused on applying methods from algebraic topology to matching theory in graphs. My thesis, titled "Vector representation of graph domination" can be found here.
Office: Taub 510
E-mail: nogaz at cs.technion.ac.il
Sampling-based proofs of almost-periodicity results and algorithmic applications.
Absolutely sound testing of lifted codes.
An additive combinatorics approach relating rank to communication complexity.
Sparse affine-invariant linear codes are locally testable.
A new upper bound on the query complexity of testing the generalized Reed-Muller codes.
Space complexity in polynomial calculus.
From affine to two-source extractors via approximate duality.
Vector representation of graph domination.
Technion Theory Lunch
In years 2010-2013 I organized the Theory Lunch at my department.