Raghu Meka is a Professor of Computer Science at UCLA. Prof. Meka joined UCLA in 2015 having spent a year at Microsoft Research, Silicon Valley. Prof. Meka did his PhD at UT Austin (2011, PhD advisor: David Zuckerman, thesis: Computational Applications of Invariance Principles) and a postdoctoral fellowship at the Institute for Advanced Study, Princeton, and DIMACS, Rutgers University. Prof. Meka works at the intersection of probability theory, learning theory, combinatorics, and theoretical computer science. He has received the best paper award at the IEEE Symposium on Foundations of Computer Science (FOCS) 2023, and the Conference on Learning Theory (COLT) 2024.
2025 W. Wallace McDowell Award
“For contributions to complexity theory, pseudo randomness, communication complexity, and for establishing new connections between computer science and combinatorics, probability theory.”
Learn more about the W. Wallace McDowell Award
