In honour of ALEXANDER SHEN and NIKOLAY VERESHCHAGIN’s 60th birthday
The workshop will take place in Moscow Independent University (for 2 days) and Higher School of Economics (for 1 day) on June 12-14 (see "Venue" above for exact adresses).
If you wish to participate, please send an e-mail to ric-organizers@computability.fr; you can propose a talk by submitting an abstract (around 1 page), before May 1st.
Tentative list of speakers
- Eric Allender (Rutgers University, US)
- Harry Buhrman (CWI, Netherlands)
- Enrico Formenti (Université Côte d'Azur, France)
- Lance Fortnow (Georgia Tech university, US)
- Peter Gács (Boston University, US)
- Jarkko Kari (Turun Yliopisto, Finland)
- Michal Koucký (Univerzita Karlova, Czech Rep.)
- Leonid Levitov (MIT, US)
- Wolfgang Merkle (Universität Heidelberg, Germany)
- Alexey Milovanov (HSE, Russia)
- Alexander Razborov (Chicago University, US) [to be confirmed]
- Marius Zimand (Towson University, US)
Topics
- Automata
- Kolmogorov complexity
- Computational complexity
- Algorithmic randomness
- Communication complexity
- …
Support
We have funding to support some students or early-stage researchers. Please contact us as early as possible, with a cover letter and short CV.
Visas
Please note that if you need a visa (whether or not you intend to give a talk), then you should register as soon as possible : it can take about 5 weeks to issue an invitation (then it will take a week to deliver the invitation and another week for the embassy to issue the visa, once the application is made), so you should plan this in advance. For questions about visas, please email to Dina Chernyshova.
Related event
The workshop will immediately follow the Russian Workshop on Complexity and Model Theory (in MIPT, Moscow) on June 9-11.
