Subject: NAPIO Registration: Hardt Moritz [email-masked]

From: [email-masked]
Date: Sun, 10 Feb 2008 16:24:27 +0100

Thank you very much for having registered for the workshop 'New Algorithmic Paradigms in Optimization' in Ascona. You will receive a confirmation by March 1, 2008.
If you need to modify the information you submitted, please reply to this email.

You have submitted the following information:
First name:Moritz
Last name:Hardt
Status:Student
Gender:male
Institution:Princeton University
Department of Computer Science
35 Olden Street
Princeton, NJ 08540-5233
USA
E-mail:[email-masked]
Motivation:I am a first-year graduate student at Princeton University. My interest is in algorithms and complexity theory. Problems in optimization come up naturally and frequently in my current research. This is especially true for semidefinite and convex programming techniques. I wish to attend this workshop with two goals in mind. One is to improve my technical understanding of current mathematical methods in optimization. Many of these techniques have been developed in areas other than theoretical computer science. The more it is exciting that the workshop offers talks and tutorials by researches with a diverse background. My second goal is to find applications of those techniques to problems within theoretical computer science.
Preferred roommate:David Steurer  spref:
Meal preferences:  
Graduate School:Graduate School
Princeton University

Advisors: Sanjeev Arora, Boaz Barak
Reference:
Sanjeev Arora, Professor
[email-masked]

Boaz Barak, Assistant Professor
[email-masked]
Birthday:September 7, 1984
Nationality:German
Research areas:Approximation algorithms, randomness in computation, explicit constructions of pseudorandom objects
Publications:Asymptotically Optimal Hitting Sets Against Polynomials
With Markus Blaeser and David Steurer. In submission.

Testing Sparse Polynomial Identities of Unbounded Degree
With Markus Blaeser, Richard Lipton and Nisheeth Vishnoi. In submission.

Testing Polynomial Identities With Fewer Random Bits
Master\'s thesis. Saarland University. Saarbruecken, 2007.

Higher-Order Syntax and Saturation Algorithms for Hybrid Logic
With Gert Smolka. ENTCS, 2006.

All papers are available from my web site:
http://www.cs.princeton.edu/~mhardt