Three key issues for an algorithm are: Is it correct? How efficient is it? Can one do better? Our strong and diverse group seeks provable answers to these questions. We focus on problems and questions in the following areas: complexity theory, cryptography, computational geometry, computational algebra, randomness (in algorithm design and average case analysis) and algorithmic game theory.