UCSD CS Theory Lunch
The theory lunch is a weekly meeting for theory students and faculty to hang out, eat food, and talk about CS theory. Each week, someone will give a short, informal talk about a problem or an idea that's been on their mind. Food will be provided.Organizers: Anthony Ostuni, Christopher Ye, Jack Morris
Fall 2025:
-
Sep 26 2025: Christopher Ye
Distribution Testing with (Very) Noisy Data -
Oct 03 2025: Farzan Byramji
Do Parities Help to Find Collisions? -
Oct 10 2025: Yinzhan Xu
Optimal Graph Reconstruction with Connected Component Queries -
Oct 17 2025: Lukshya Ganjoo
The Bad Science Problem -
Oct 24 2025: Jack Morris
The Truth About QAC^0 -
Oct 31 2025: Zihan Hao
Does space help to break a hash function? -
Nov 07 2025: Eric Binnendyk
NP-completeness of Determining Unit Distance Graphs with Integer Coordinates -
Nov 14 2025: Jyun-Jie
Multi-source Extractors in Adversarial Setting -
Nov 21 2025: Bingbing Hu
A Suspiciously Simple Approximation Scheme for Edit Distance -
Dec 05 2025: Davin Choo
Test-and-Act: Recipe for Learning-Augmented Algorithms Inspired by Sublinear Thinking