Raghu Meka is an Assistant Professor in the CS department at UCLA. He is broadly interested in complexity theory, learning and probability theory. He got his PhD at UT Austin under the guidance of David Zuckerman. After that, he spent two years in Princeton as a postdoctoral fellow at the Institute for Advanced Study with Avi Wigderson, and at DIMACS, at Rutgers. And after that, he spent an enjoyable year as a researcher at the Microsoft Research Silicon Valley Lab.
- Causality, Spring 2022. Visiting Scientist and Workshop Organizer.
- Computational Complexity of Statistical Inference, Fall 2021. Visiting Scientist.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist.
- Pseudorandomness, Spring 2017. Visiting Scientist and Workshop Organizer.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist.