Professor, Simon Fraser University
Valentine Kabanets is currently a Professor of Computing Science at Simon Fraser University in Burnaby, BC, Canada. His research interests are in computational complexity theory: circuit complexity, pseudorandomness, computational learning, and meta-algorithms (SAT, learning, MCSP, etc.), and (circuit) lower bounds connections.
Meta-Complexity , Spring 2023Visiting Scientist and Program Organizer
Extended Reunion: Satisfiability , Spring 2023Visiting Scientist
Satisfiability: Theory, Practice, and Beyond , Spring 2021Visiting Scientist
Lower Bounds in Computational Complexity , Fall 2018Visiting Scientist
Pseudorandomness , Spring 2017Visiting Scientist
Fine-Grained Complexity and Algorithm Design , Fall 2015Visiting Scientist