Previous Conferences & Workshops

Worst-case analysis of algorithms has been the central method of theoretical computer science for the last 60 years, leading to great discoveries in algorithm design and a beautiful theory of computational hardness. However, worst-case analysis can...

The Sato-Tate group of an abelian variety A of dimension g defined over a number field is a compact real Lie subgroup of the unitary simplectic group of degree 2g that conjecturally governs the limiting distribution of the normalized Frobenius...

State the main theorems of Fukaya-Kato and outline the proofs.

At leading order, the fluctuations around the typical dynamics are described by the second cumulant. They actually satisfy a stochastic PDE with time-space white noise. Can we say more using higher order cumulants?

When designing the first computer built at IAS, von Neumann rejected floating-point arithmetic as neither necessary nor convenient. In 1997 William Kahan at Berkeley, who designed the famously accurate algorithms on Hewlett-Packard calculators, said...

The problem of finding metrics with constant Q-curvature in a prescribed conformal class is an important fourth-order cousin of the Yamabe problem. In this talk, I will explain how certain variational bifurcation techniques used to prove non...

Although the distribution of hard spheres remains essentially chaotic in this regime, collisions give birth to small correlations. The structure of these dynamical correlations is amazing, going through all scales. How combinatorial techniques can...

A nonnegative flow on the edges of a directed acyclic graph $G$ on the vertex set $[n]$ with netflow vector $\bf{a}=(a_1, \ldots, a_n)\in \mathbb{Z}^n$ is an assignment of nonnegative real numbers to the edges of $G$ so that at each vertex $i$ the...