If you are interested in giving a talk, email Russell Impagliazzo (rimpagliazzo@ucsd.edu). For previous talks, please see the theory seminar archive. For more on the theory group, please see the theory group website.
All talks are on Monday 2-3pm in CSE 4258 unless otherwise announced.
Fall 2025
Trisha Datta (Stanford)
Monday, September 29, 2025, 2:00pm
Efficient Vector Range Proofs and Their Applications
Details
Monday, October 6, 2025, 2:00pm
Social gathering
Shachar Lovett (UCSD)
Monday, October 13, 2025, 2:00pm
Polynomial sparsity of boolean functions, certificate trees, and applications
Details
Russell Impagliazzo (UCSD)
Monday, October 20, 2025, 2:00pm
Near-Optimal Hardness Amplification from HDX
Details
Farzan Byramji (UCSD)
Monday, October 27, 2025, 2:00pm
Lower bounds for the Bit Pigeonhole Principle in Bounded-Depth Resolution over Parities
Details
Shyan Akmal (Max Planck Institute for Informatics)
Monday, November 3, 2025, 2:00pm
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
Details
Yinzhan Xu (UCSD)
Monday, November 10, 2025, 2:00pm
Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
Details
Adrian Ong (UCSD)
Monday, November 17, 2025, 2:00pm
A Survey of Context Engineering for Large Language Models
Ido Nachum (University of Haifa)
Monday, November 24, 2025, 2:00pm
The Structure of Cross-Validation Error: Stability, Covariance, and Minimax Limits
Details
Chris Ye (UCSD)
Monday, December 1, 2025, 2:00pm
TBD