International Student School CSEDays on algorithms and complexity theory

From June 29 to July 1, 2013, the international student’s CSEDays school on algorithms and complexity theory will be held in Yekaterinburg. The list of teachers turned out to be very impressive, let me tell you about them here literally in a few words.

	Konstantin Makarychev (Microsoft Research) Young, but already very successful scientist. Specialist in approximate algorithms and Unique games conjecture (a hypothesis from which non-approximability results are derived for many NP-hard problems).
	Alexander Shen (Montpellier Laboratory of Informatics, Robotics, and Microelectronics and IITP RAS) Probably needs no introduction. He is an expert in the field of complexity theory. He is the author of many wonderful textbooks, such as, for example, “Programming: theorems and problems”. He is also the translation editor (and, in fact, the chief translator) of the first edition of the classic Kormen, Leiserson, Rivest textbook Algorithms: Construction and Analysis.
	Mario Szegedy (Rutgers University) Twice winner of the Gödel Prize, awarded annually for outstanding articles in the field of theoretical computer science. The first time is for contributing to the proof of the PCP theorem (probabilistically verifiable evidence) and its application to the non-approximability results, the second for work in the field of streaming algorithms.
	Ryan Williams (Stanford University) Also a young star. His recent result that the NEXP class is not contained in the ACC 0 class is called one of the most significant advances in circuit complexity over the past 20 years. And this is not his only result. He also showed, for example, how to find the maximum cut in a graph faster than a complete search with an unexpected and elegant use of fast matrix multiplication.

In general, I highly recommend it. School attendance is free . The school will be held immediately after the 8th International Computer Science Symposium in Russia conference. School members can attend conference reports without paying an org. contribution.