Vereshchagin Nikolay Konstantinovich

Presentations in Math-Net.Ru

1. Algorithmic statistics
   N. K. Vereshchagin
   Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences
   May 23, 2019 16:00   
2. Communication complexity of approximation of Kolmogorov complexity
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   December 16, 2013 16:45
3. High Entropy Random Selection Protocols
   N. K. Vereshchagin
   Symposium on logic and computability "Logic and Computation Day"
   June 7, 2013 11:00
4. Communicative information
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   April 8, 2013 16:45
5. Short lists with short programs in short time
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   December 17, 2012 16:45
6. Group representations and locally decodable codes
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   October 29, 2012 16:45
7. What we can compute given random strings as an oracle
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   April 28, 2012 16:45
8. The notion of zero knowledge
   N. K. Vereshchagin
   Kolmogorov seminar on computational complexity and descriptive complexity
   April 23, 2012 16:45
9. On abstract resource semantics and computabilty logic
   Nikolay Vereshchagin
   International workshop "Logical Models of Reasoning and Computation"
   February 2, 2012 12:45   
10. Algorithmic statistics
    N. K. Vereshchagin
    Globus Seminar
    November 24, 2011 15:40