Mission

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.

Mechanism

1. An email solicitation for abstracts of relevant topics/problems sent to faculty.
2. Technical committee selects a small set of abstracts and invites selected experts for highly interactive sessions. An expert makes a presentation during which ARC ThinkTank members attempt to make the problem precise. Click here to submit your problem.
3. Committee decides if a problem is suitable and if so,
4. they have a weekly lunch meeting to solve it along with other interested researchers.
5. Postdocs and students participate in research.
6. The center hosts a regular seminar and a once-a-year workshop.
7. Two regular courses on the topic, one geared for theory students, another for students from all sciences.