Previous Conferences & Workshops

In this talk we study the one-way multi-party communication model, in which each of the k parties speaks exactly once in its turn. For every fixed k, we prove a tight lower bound of Omega(n^(1/(k-1))) on the probabilistic communication complexity of...

This subject began in the late 1940s with the opus of Shannon [1948] and the short papers of Hamming [1950] and Golay [1949], followed a decade later by the powerful constructions of Bose-Chaudhuri-Hocquenghem and Reed-Solomon. A variety of...

In inverse problems in arithmetic combinatorics, one is interested in describing internal properties of those finite subsets $A$ of an algebraic structure that ``barely expand'' under its operations. One of the deepest results in the area is Freiman...

Consensus clustering is the problem of aggregating a list of clusterings of ground data into one clustering. I will present new approximation algorithms for this problem, building on techniques used for ranking problems (described in my previous...

Program checking, program self-correcting and program self-testing were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain confidence in software, by considering program correctness on an input by...

We show that Leopoldt's conjecture for totally real number fields implies Greenberg's conjecture on the uniform boundedness of the $p$-primary part of the class groups of the finite extensions along the cyclotomic tower of a totally real number...

In the last eight lectures, we have reduced the proof of the Bloch-Kato to an assertion about motivic cohomology operations. We will prove that this assertion is correct, and so complete the proof of the Bloch-Kato conjecture.

Originally number theoretic methods were used to construct optimal (explicit) expanders. Recently combinatorial methods have been utalized in proving that certain number theoretic graphs are expanders. We will explain some uses of such expanders in...

We develop a framework for obtaining (deterministic) Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic problems with either convex or monotone single-period cost functions. Using our framework, we give the first...

In 1957 Erdos asked what is the smallest maximum modulus of a trigonometric polynomial of degree n all whose coefficients have modulus 1. He thought that there should be a c>0 such that this max modulus is larger than (1+c)sqrt(n).In 1966 Littlewood...