Valentine Kabanets

Valentine Kabanets is a Professor in the School of Computing Science at Simon Fraser University. He holds a Ph.D. in Computer Science from the University of Toronto (2000), M.Sc. from Simon Fraser University (1996), and B.Sc. from the National University of Kiev (1993). His research focuses on computational complexity theory, pseudorandomness, circuit lower bounds, and cryptography. He has received prestigious awards including the Nerode Prize (2013) and multiple best-paper awards at conferences like STOC and CCC.

Teaching includes courses on computability and complexity (CMPT 308), data structures and algorithms (CMPT 307), and advanced complexity theory. His research explores foundational questions such as derandomization of algorithms, connections between upper/lower bounds in complexity, and cryptographic hardness assumptions. He leads the Algorithms and Complexity Theory Lab and has supervised numerous graduate students and postdocs. Kabanets' work bridges theoretical insights with practical algorithmic advancements, contributing to both foundational computer science and applied cryptography.