Phone: 6097348246 Office: Simonyi Hall 009 Email: nogazewi at ias.edu
Education
My research interests lie in theoretical computer science and its interactions with modern research directions in discrete mathematics. My Ph.d. research focused on applying methods and techniques from the mathematical field of additive combinatorics in computational complexity, most notably in the areas of communication and coding. My M.Sc. research focused on applying methods from algebraic topology to matching theory in graphs.
Publications
Highrate locallycorrectable and locallytestable codes with subpolynomial query complexity.  With Swastik Kopparty, Or Meir and Shubhangi Saraf.
On public key encryption from noisy codewords.  With Eli BenSasson, Iddo BenTov, Ivan Damgard and Yuval Ishai.
Samplingbased proofs of almostperiodicity results and algorithmic applications.  With Eli BenSasson, Madhur Tulsiani and Julia Wolf.
 In proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014).
Absolutely sound testing of lifted codes.  With Elad Haramaty and Madhu Sudan.
 To appear in Theory of Computing (Special issue of Random 2013).
 Preliminary version in proceedings of the 7th International Workshop on Randomization and Computation (Random 2013).
An additive combinatorics approach relating rank to communication complexity.  With Eli BenSasson and Shachar Lovett.
 In journal of the ACM (JACM), volume 61, issue 4, 2014.
 Preliminary version in proceedings of the 53^{rd }Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012).
Sparse affineinvariant linear codes are locally testable.  With Eli BenSasson and Madhu Sudan.
 To appear in Computational Complexity.
 Preliminary version in proceedings of the 53^{rd }Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012).
A new upper bound on the query complexity of testing the generalized ReedMuller codes.  With Madhu Sudan.
 In Theory of Computing, volume 9(25), pages 781807, 2013 (Special issue of Random 2012).
 Preliminary version in proceedings of the 6th International Workshop on Randomization and Computation (Random 2012).
[Full version]
Space complexity in polynomial calculus. With Yuval Filmus, Massimo Lauria, Jakob Nordstrom and Neil Thapen.
 To appear in SIAM Journal of Computing (SICOMP).
 In proceedings of the 27th IEEE Conference on Computational Complexity (CCC 2012).
From affine to twosource extractors via approximate duality.  With Eli BenSasson.
 In proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC 2011).
[Full version]
Vector representation of graph domination.  In Journal of Graph Theory, volume 70, issue 2, pages 152170, 2012.
[Full version]
Theses
Additive combinatorics methods in computational complexity.  Ph.D. Thesis, Technion, 2014.
Vector representation fo graph domination.  M.Sc. Thesis, Technion, 2010.
Lecturer:  Winter 20122013  Logic and set theory for computer science, Department of computer science, Technion.
Teaching assistant:  20082014 (9 semesters)  Logic and set theory for computer science, Department of computer science, Technion.
 20092010 (2 semesters)  Probability M, Department of industrial engineering and management, Technion.
 Spring 2007  Calculus 2, Department of mathematics, Technion.

