To identify problems with natural connections to algorithms and randomness. To help solve these problems and understand related phenomena by suggesting provable algorithms and algorithmic explanations. To formulate general tools based on the solutions and the insights behind them and thereby extend and solidify the theory of algorithms. To represent an algorithms and randomness thinktank that scientists across campus can use as a resource.
The ARC Committee consisting of Santosh Vempala, (chair), CS, Gregory Blekherman, Math, Santanu Dey, ISYE, David Goldberg, ISYE and Dana Randall, CS and Math (Adjunct) announced the winners of ARC Fellowships for Fall 2012.