(http://intractability.princeton.edu/) announces
the second in a series of workshops
Barriers in Theoretical Computer Science, in Princeton NJ, August 26-30, 2010.
http://intractability.princeton.edu/blog/2010/02/workshop-barriers-ii/
The workshop is open to any interested participant, but our capacity is
limited to about 150 participants. There will be no registration fee.
If you may be interested in attending, it would be very helpful
for you to respond as described later in this email by April 30.
The goal of this series is to identify important topics
and problems where our field seems to be "stuck" for a fundamental reason.
We hope that identifying and articulating these "barriers", and
disseminating knowledge about them to a large and diverse
audience will jump start research to remove or circumvent
these barriers. The first Barriers workshop was held in
August 2009.
As with the Barriers I, each day of Barriers II
will focus on one area of theoretical CS, but these foci will be different
than those in Barriers I. The planned topics and organizers for each day are:
Thursday August 26
Approximation Algorithms and Hardness of Approximation
Organizer: Moses Charikar
Friday August 27
Recent Advances and Challenges in Cryptography
Organizers: Shafi Goldwasser and Yuval Ishai
Saturday August 28
Quantum computation
Organizers: Scott Aaronson and Umesh Vazirani
Sunday August 29
Title: Communication and information in complexity
Organizer: Paul Beame
Monday August 30
Title: (Geo)metric algorithms
Organizer: Piotr Indyk
Please register on the web page:
http://intractability.princeton.edu/blog/2010/02/workshop-barriers-ii/
If you have suggestions or questions
concerning the specific topics, please write the topic committee
members directly.
Thank you,
The Barriers II organizing committee
Michael Saks (Chair)
Scott Aaronson
Sanjeev Arora
Paul Beame
Moses Charikar
Shafi Goldwasser
Piotr Indyk
Yuval Ishai
Robert Tarjan
Umesh Vazirani
Posts
