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

Publication list (pdf) ; see selected papers, books, popular expositions online and bibliographic links DBLP (Trier University), MathSciNet, Google Scholar.

Non-academic texts (mostly in Russian)

Project Team: ESCAPE (Complex systems, Automata and Tilings). Participating in ANR projects: NAFIT ANR-08-EMER-008-01 and EMC ANR-09-BLAN-0164-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

Curriculum vitae: pdf

Thésard (PhD student):

• Tarik Kaced (co-direction with Alexander Shen), 2009-2012