Workshop on Algorithms in Communication Complexity, Property Testing and Combinatorics

The workshop is devoted to algorithmical aspects in Communication Complexity, Property Testing, Combinatorics and related areas.

It is organized as part of the Special Semester Program on Computational Complexity.

Workshop dates:

    Meeting dates: April 11-13, 2016.
    Pre-workshop tutorials: April 9-10, 2016.

Organizers: Ilan Newman (University of Haifa) and Nikolay Vereshchagin (Moscow State University)

Local organizer: Vladimir Podolskii (Steklov Mathematical Institute, Higher School of Economics)

Associated Events:

The special semester and workshop are organized by St.Petersburg State University jointly with the Skolkovo Institute of Science and Technology and the Steklov Institute of Mathematics at St.Petersburg. Funding is provided by the Skolkovo Institute of Science and Technology, with additional funding from the US National Science Foundation for student support and from JSC Gazrom Neft for the Chebyshev Laboratory.