The Georgia Tech Algorithms and Randomness Center (ARC) identifies problems with natural connections to algorithms and randomness. To help solve these problems and understand related phenomena, ARC suggests provable algorithms and algorithmic explanations. ARC formulates general tools based on the solutions and the insights behind them and thereby extends and solidifies the theory of algorithms. Additionally, ARC represents an algorithms and randomness think tank that scientists across campus can use as a resource.
Our former colleague Subhash Khot, now at the Courant Institute of New York University, was awarded the Nevanlinna prize during the opening ceremony of the 2014 International Congress of Mathematicians.
Computing professor cited for “inventing new computer science and mathematical techniques to tackle foundational and practical problems in a wide range of areas in graph algorithms, computation, communication, program testing, and DNA computing.”