The 2nd Annual Mysore workshop in Theoretical Computer Science will be held from May 5 to May 9, 2011 at the Mysore Infosys campus.
Most of the recent advances in algorithms and complexity have borrowed techniques from several areas of mathematics, computer science, and operations research. These include the study of polynomials over finite fields, Fourier analysis of boolean functions, communication complexity, primal-dual methods in approximation algorithms, probability theory, metric embeddings, and many more. The bag of tools is ever-expanding and many of us, graduate students and researchers alike, have been feeling a growing need to assimilate these newer techniques through focussed workshops and schools.
In this workshop, we shall cover one technique (could be a mathematical technique, an algorithm, an idea, or a perspective) and its applications each of the 4 days. Typically, this will be done through a long tutorial talk in the morning followed by small talks on specific results in the afternoon.