The departments' next distinguished colloquium will be delivered by Professor Mark Sapir from Vanderbilt University. Professor Sapir has been an invited speaker in many conferences including the ICM-2006 (Madrid). His research interests include algorithmic problems in algebra, geometric and asymptotic group theory. There are several asymptotic invariants of geomeric nature that measure algorithmic complexity of a group: the Dehn function, the depth function, the length function, etc. He will talk about the relations between computational complexity of a group and the growth of these functions. For more info please visit the events page.