Alexander Razborov

Alexander Razborov is the Andrew MacLeish Distinguished Service Professor in the Department of Computer Science at the University of Chicago, a position he has held since 2008. Concurrently, he serves as Professor at the Toyota Technological Institute at Chicago (TTIC) and retains the title of Principal Researcher at the Steklov Mathematical Institute in Moscow, where he began his career in 1987.

His research portfolio centers on the theoretical foundations of computer science, spanning circuit complexity, proof complexity, communication complexity, quantum computation, extremal combinatorics, and discrete mathematics. Razborov’s groundbreaking work has fundamentally shaped modern complexity theory, introducing powerful techniques for lower-bound proofs and establishing deep connections between combinatorics and computational limits.

Honours & Awards

• Fellow of the American Academy of Arts and Sciences (AAAS), 2020
• David P. Robbins Prize, American Mathematical Society, 2013
• Gödel Lecturer, Association for Symbolic Logic, 2010
• Gödel Prize, EATCS & ACM SIGACT, 2007
• Corresponding Member, Russian Academy of Sciences, 2000
• Erdős Lecturer, Hebrew University of Jerusalem, 1998
• Rolf Nevanlinna Prize, International Mathematical Union, 1990

Across more than three decades, Razborov has held successive ranks at Steklov—Researcher, Leading Researcher, and Principal Researcher—while also maintaining visiting and adjunct affiliations. The provided material does not enumerate specific doctoral students, funded projects, or laboratory teams, but his sustained dual appointment between Chicago and Moscow underscores an enduring international collaboration network.