Yimeng(Kobe) Wang

Photo credit to dear friend Paul Lou.

Hi! I am a PhD candidate in Computer Science at UCLA where I am fortunate to be advised by Raghu Meka. I also work closely with Shachar Lovett.

I am broadly interested in theoretical computer science. My main research interests include communication complexity, extremal combinatorics and things related to diffusion / sampling algorithms. I completed my Masters degree at UC Berkeley under the wise guidance of Prasad Raghavendra. Before that, I was an undergraduate student at UC Berkeley working with the amazing Alistair Sinclair.

Fall 2026, I am visiting Simons Institute for the Spectral Theory Beyond Graphs and the Pseudorandomness & High-Dimensional Expansion programs.

Contact: kobewang1359[AT]ucla.edu

Publications

The weighted union-set conjecture is false.
Yimeng Wang
Preprint, 2026.
An Explicit Optimal Separation of BPP from NP in Number-on-Forehead Communication Complexity.
Haoyu Wang, Yimeng Wang, and Pei Wu
Preprint, 2026.
Moonflowers and code sparsification.
Shachar Lovett, Raghu Meka, and Yimeng Wang.
Preprint, 2026.
Algorithms for robust linear models against strong adversarial corruptions.
Yimeng Wang (advised by Prof. Prasad Raghavendra).
Masters thesis, 2022
Lower Bounds on Lattice Triangulations.
Yimeng Wang (advised by Prof. Alistair Sinclair)
EECS Honors thesis, 2021

Teaching

Summer 2026: FinDS 2026 Linear Algebra (co-instructor) @ UCLA notes

Spring 2026: CS 260B (Algorithmic Machine Learning) (TA) @ UCLA

Winter 2026: Student Coding Theory Seminar (Organizer) @ UCLA notes

Fall 2025: CS 181 (Introduction to Theory of Computing) (TA) @ UCLA

Spring 2025: CS 260B (Algorithmic Machine Learning) (TA) @ UCLA - notes.

Fall 2024: CS 181 (Introduction to Theory of Computing) (TA) @ UCLA

Fall 2023: CS 181 (Introduction to Theory of Computing) (TA) @ UCLA

Previous courses taught at UC Berkeley

Data 102 (Data, Inference, and Decisions): Fall 2021, Fall 2020

Data 100 (Principles and Techniques of Data Science): Fall 2019, Spring 2020

CS 70 (Discrete Mathematics and Probability Theory): Summer 2019

Tutor / Readers for courses at UC Berkeley

CS 172 (Computability and Complexity)

CS 189 (Introduction to Machine Learning)

CS 170 (Efficient Algorithms and Intractable Problems)