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

Dec 8th
Providing Statistical Guarantees for Topological Summaries of Data
Feb 2nd
Jamie Morgenstern presents a talk as part of the ARC Colloquium series.
Mar 16thto20th
Mar 16thto20th
ARC presents “The Power of Randomness in Computation Workshop,” co-sponsored by the Institute for Mathematics and its Applications (IMA) at the University of Minnesota.