Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Page Not Found

Home

Archive Layout with Content

Posts by Category

Posts by Collection

CV

CV

Markdown

Page not in menu

Page Archive

Portfolio

Publications

Service

Sitemap

Posts by Tags

Talk map

Talks

Teaching

Terms and Privacy Policy

Blog posts

Jupyter notebook markdown generator

Posts

Future Blog Post

Blog Post number 1

portfolio

Portfolio item number 1

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.

arXiv: 2010.06398

The Toughness of Kneser Graphs

with Amartya Banerjee, Sebastian Cioabă, Nathan Hayes, Davin Park, Tanay Wakhare, and Wiseley Wong

Discrete Mathematics, 2021.

arXiv: 2008.08183

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.

arXiv: 2104.01665

Locality Bounds for Sampling Hamming Slices

with Daniel M. Kane and Kewen Wu

Symposium on Theory of Computing (STOC), 2024.

arXiv: 2402.14278

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.

arXiv: 2312.09400

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.

arXiv: 2309.10286

Locally Sampleable Uniform Symmetric Distributions

with Daniel M. Kane and Kewen Wu

Symposium on Theory of Computing (STOC), 2025.

arXiv: 2411.08183

Strong Bounds for Skew-Corner-Free Sets

with Michael Jaber and Shachar Lovett

Discrete Analysis, 2025.

arXiv: 2404.07380

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.

arXiv: 2504.07006

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals

with Daniel Grier, Daniel M. Kane, Jackson Morris, and Kewen Wu

Submitted, 2025.

arXiv: 2510.07808

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.

CSE101: 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.