Previous Conferences & Workshops

There has been substantial work in learning theory and game theory on adaptive "no-regret" algorithms for problems of repeated decision-making. For example, one could use such an algorithm to choose a path to drive to work each day so that no matter...

Undirected st-connectivity (USTCONN) is the problem of checking whether two given vertices of an undirected graph are connected by a path. Solving USTCONN in space O(log n), and even o(log2 n), is a challenging task. A randomized logspace algorithm...

An Extremal Erdos-Szekeres permutation is a permutation of the numbers 1,2,...,N^2 that has no monotone subsequence of length N+1 (and is therefore extremal with respect to the Erdos-Szekeres theorem). If an EES permutation is drawn uniformly at...

For an undirected graph G=(V,E), let G^n denote the graph whose vertex set is V^n in which two distinct vertices (u_1, u_2, ... ,u_n) and (v_1, v_2, ... ,v_n) are adjacent iff for all i between 1 and n, u_i and v_i are either equal or adjacent. The...

It is well-known that to study the space of modular forms of a fixed weight and level over $Q_P$, it is useful to embed this finite-dimensional space in a $p$-adic Banach space of overconvergent modular forms, and use methods of $p$-adic analysis...

One of the simplest and fundamental distributed computing problems involving noise is the ``noisy broadcast problem'': There are n processors each holding a bit, and there is a special processor called receiver. Processors act according to a...

Let $f$ be a primitive cusp form of weight at least 2, and let $\rho_f$ be the $p$-adic Galois representation attached to $f$. If $f$ is $p$-ordinary, then it is known that the restriction of $\rho_f$ to a decomposition group at $p$ is `upper...

We study the multicommodity buy-at-bulk network design problem where the goal is to buy capacity on edges of a network so as to enable the demands between a given set of source-sink pairs to be routed - the objective is to minimize the cost of such...

Serre conjectured that all continuous, irreducible, odd $\rho:G_{\mathbf{Q}} \to \mathrm{GL}_2(\overline{\mathbf{F}}_p)$ arise from modular forms. If $\rho$ is modular, then proven refinements provide recipes for the possible weights and levels of...