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.

Talks & Events

Apr 24th
Maximum Entropy Summary Trees
Apr 25thto25th
The ARC Theory Day features hour-long lectures focusing on recent innovative results in theoretical computer science.
Apr 28th
Distributed Algorithmic Foundations of Dynamic Networks


ARC Student Fellowship - Spring 2014

The ARC Committee consisting of Gregory Blekherman, Math; Santanu Dey (Chair); David Goldberg, ISYE; Alexandra Boldyreva, CS, Nina Balcan, CS and Santosh Vempala, CS announced the winners of ARC Fellowships for spring 2014.

Postdoctoral position with ARC, Georgia Tech
ARC Student Fellowship for Spring 2014

View All News