ИСТИНА

• Охват: Международная
• Даты проведения: 5-7 июня 2013
• Место проведения: Standford, USA, United States
• Веб-сайт: http://computationalcomplexity.org/Archive/2013/program.html
• Описание конференции:

  The Twenty-Eighth Annual IEEE Conference on Computational Complexity held 5–7 June 2013 in Palo Alto, California. The conference is sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the European Association for Theoretical Computer Science (EATCS).

• Добавил в систему: Верещагин Николай Константинович

Доклады:

• 2013 Short lists with short programs in short time (Устный)
• Авторы: Bauwens Bruno, Zimand Marius, Vereshchagin Nikolay, Makhlin Anton

• 2013 Towards a Reverse Newman's Theorem in Interactive Information Complexity (Устный)
• Авторы: Brody Joshua, Buhrman Harry, Vereshchagin Nikolay, Loff Bruno, Speelman Florian, Koucky Michal