Moritz Hardt

PhD student
Theory Group
Department of Computer Science
Princeton University
Office: Room 103A, Computer Science Building (Map)
Email: mh...t@cs.princeton.edu

I joined Princeton in the Fall of 2007 as a graduate student in the Computer Science Department. My advisor is Boaz Barak. Previously, I spent a year as a research scholar at Carnegie Mellon University hosted by Steven Rudich. During the years 2003 through 2006, I was at Saarland University where I obtained a B.Sc. and an M.Sc. (2007) in Computer Science.

Publications

2009

PDF The Uniform Hard-Core Lemma Via Approximate Bregman Projections
with Boaz Barak and Satyen Kale
In Proc. 20th ACM-SIAM SODA 2009
PDF Deterministically Testing Sparse Polynomial Identities of Unbounded Degree
with Markus Bläser, Richard Lipton and Nisheeth Vishnoi
Inf. Process. Lett. (IPL) 2009

2008

PDF Rounding Parallel Repetitions of Unique Games
with Boaz Barak, Ishay Haviv, Anup Rao, Oded Regev and David Steurer
In Proc. 49th IEEE FOCS 2008
PDF Asymptotically Optimal Hitting Sets Against Polynomials
with Markus Bläser and David Steurer
In Proc. 35th ICALP 2008

2007

PDF Testing Polynomial Identities with Fewer Random Bits
Master's thesis. Saarland University, 2007. Advisor: Markus Bläser
Awarded the Günter-Hotz-Prize.
EE Higher-Order Syntax and Saturation Algorithms for Hybrid Logic
with Gert Smolka. Electr. Notes Theor. Comput. Sci. (ENTCS) 2007

Some Links