Raghu Meka is a professor of computer science at UCLA, which he joined in 2015 after a year at Microsoft Research Silicon Valley, working at the intersection of probability theory, learning theory, combinatorics and theoretical computer science. He completed his PhD at the University of Texas at Austin in 2011 under David Zuckerman, with a thesis on computational applications of invariance principles, followed by postdoctoral fellowships at the Institute for Advanced Study and DIMACS at Rutgers University. In 2025 he received the IEEE W. Wallace McDowell Award for his contributions to complexity theory, pseudorandomness and communication complexity, and for establishing new connections between computer science, combinatorics and probability.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.