Combinatorics, Probability and Computing

Abstract

The main theme of this workshop was the use of probabilistic methods in combinatorics and theoretical computer science. This area is evolving extremely quickly, with the introduction of powerful new methods and the development of increasingly sophisticated techniques, and there have been a number of very significant breakthroughs in the area in recent years. The workshop emphasized several of these recent breakthroughs, which include applications of probabilistic techniques to extremal questions, and of combinatorial techniques to areas of discrete probability theory, such as random matrices and planar percolation.