Algorithmic Convex Geometry
November 5 to November 9, 2007
AIM Research Conference Center, Palo Alto, CA

Organizers:
Assaf Naor and Santosh Vempala

Description:
This workshop, sponsored by AIM and the NSF, is motivated by
algorithms and draws heavily on probability (especially the theory
of stochastic processes), convex geometry and functional analysis.
The workshop will bring together leading researcher in these areas.
On one hand, algorithms researchers will clearly benefit from this.
What is equally exciting is that algorithmic insights have started
returning the favor --- they have led to questions and advances in
convex geometry and probability, notably in the form of isoperimetric
inequalities and rapidly-mixing geometric random walks. The workshop
will identify and focus on such directions, showing new directions
for analysts, geometers and probabilists. It is hoped that such a
confluence will make substantial progress in shaping this field. 

Deadline:
July 1, 2007  

Details:
http://aimath.org/ARCC/workshops/convexgeometry.html