Research topics: Kolmogorov complexity and algorithmic information theory, algorithmic randomness, computational complexity, tilings.

Publication list (pdf) ;
publication since 2008 in doc-format ;
official report for 2014-2016
see also selected papers, books, popular expositions online and bibliographic links
DBLP (Trier University),
MathSciNet,
Google Scholar.

Textbook on Kolmogorov complexity
(Russian, published in 2013, minor corrections)
(English translation to be published by AMS, draft) (Scan of the printed book)

Non-academic texts (mostly in Russian)

singapore.pdf

Project Team: ESCAPE (Complex systems, Automata and Tilings).
Participating in ANR projects:
NAFIT ANR-08-EMER-008-01
EMC ANR-09-BLAN-0164-01
RaCAF ANR-15-CE40-0016-01

Contacts

LIRMM
161 rue Ada
F-34095 Montpellier Cedex 5, France

e-mail: Alexander.Shen@lirmm.fr

homepage: www.lirmm.fr/~ashen/

On leave from Institute of Problems of Information Transmission (IITP RAS), Moscow.

Teaching

Lectures:

• Kolmogorov seminar (Moscow, 1982-)
• Teleenseignement: Algorithms, 2006, 2007 (LIF Marseille)
• Computability theory (with Laurent Bienvenu), Cours de recherche (niveau master) at the ENS de Lyon, January 2011
• Introduction to Computer Science (Online course, in Russian, stepic.org)

Curriculum vitae: pdf

Thésards (former PhD students):

• Andrei Rumyantsev (Moscow, with Nikolay Verehchshagin)
• Laurent Bienvenu (Marseille, co-direction with Bruno Durand)
• Daniil Musatov (Moscow, with Nikolay Verehchshagin)
• Tarik Kaced (co-direction with Andrei Romashchenko), 2009-2012
• Mikhail Andreev (Moscow, with Nikolay Verehchshagin)