Posts by Collection
portfolio
Portfolio item number 2
publications
ProportionNet: Balancing Fairness and Revenue for Auction Design with Deep Learning
with Kevin Kuo, Elizabeth Horishny, Michael J. Curry, Samuel Dooley, Ping-yeh Chiang, Tom Goldstein, and John P. Dickerson
Manuscript, 2020
The Toughness of Kneser Graphs
with Amartya Banerjee, Sebastian Cioabă, Nathan Hayes, Davin Park, Tanay Wakhare, and Wiseley Wong
Discrete Mathematics, 2021
Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees
with Sebastian M. Cioabă, Davin Park, Sriya Potluri, Tanay Wakhare, and Wiseley Wong
The Electronic Journal of Combinatorics, 2022
Locality Bounds for Sampling Hamming Slices
with Daniel M. Kane and Kewen Wu
Symposium on Theory of Computing (STOC), 2024
Refuting Approaches to the Log-Rank Conjecture for XOR Functions
with Hamed Hatami, Kaave Hosseini, and Shachar Lovett
International Colloquium on Automata, Languages, and Programming (ICALP), 2024
A Tight Lower Bound on Non-Adaptive Group Testing Estimation
with Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos, and Hamed Hatami
Discrete Applied Mathematics, 2025
Locally Sampleable Uniform Symmetric Distributions
with Daniel M. Kane and Kewen Wu
Symposium on Theory of Computing (STOC), 2025
Strong Bounds for Skew-Corner-Free Sets
with Michael Jaber and Shachar Lovett
Discrete Analysis, 2025
Quasipolynomial Bounds for the Corners Theorem
with Michael Jaber, Yang P. Liu, Shachar Lovett, and Mehtaab Sawhney
Symposium on Foundations of Computer Science (FOCS) - Best Paper, 2025
Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
with Daniel Grier, Daniel M. Kane, Jackson Morris, and Kewen Wu
Quantum Information Processing (QIP), 2026
Innovations in Theoretical Computer Science (ITCS), 2026
Symmetric Distributions from Shallow Circuits
with Daniel M. Kane and Kewen Wu
International Conference on Randomization and Computation (RANDOM), 2026
Hard-to-Sample Distributions from Robust Extractors
with Farzan Byramji, Daniel M. Kane, and Jackson Morris
International Conference on Randomization and Computation (RANDOM), 2026
On the Advantage of Adaptivity for Sampling with Cell Probes
with Farzan Byramji, Daniel M. Kane, and Jackson Morris
International Conference on Randomization and Computation (RANDOM), 2026
talks
Talk 1 on Relevant Topic in Your Field
UC San Francisco, Department of Testing
Tutorial 1 on Relevant Topic in Your Field
UC-Berkeley Institute for Testing Science
Talk 2 on Relevant Topic in Your Field
London School of Testing
Conference Proceeding talk 3 on Relevant Topic in Your Field
Testing Institute of America 2014 Annual Conference
teaching
CMSC 250: Discrete Structures
University of Maryland, Spring 2018 & Fall 2019
CMSC 389V: Ethics of Artificial Intelligence and Machine Learning
University of Maryland, Spring 2020 & Fall 2020 & Spring 2021
New Horizons in Theoretical Computer Science
Toyota Technological Institute at Chicago, Summer 2022
CSE 101: Introduction to Algorithms
UC San Diego, Winter 2023
CSE 200: Computability and Complexity
UC San Diego, Fall 2023
CSE 291E: Additive Combinatorics and its Applications
UC San Diego, Fall 2024
Extremal and Probabilistic Combinatorics - From Sunflowers to Thresholds
Park City Math Institute Graduate Summer School, Summer 2025
CSE 203A: Randomized Algorithms
UC San Diego, Spring 2026