Unambiguous DNFs and Alon-Saks-Seymour
On Query-to-Communication Lifting for Adversary Bounds
Symmetries, Graph Properties, and Quantum Speedups
Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem
When Is Amplification Necessary for Composition in Randomized Query Complexity?
Classical Lower Bounds from Quantum Upper Bounds
Separating Quantum Communication and Approximate Rank
Low-Sensitivity Functions from Unambiguous Certificates
Separations in Communication Complexity Using Cheat Sheets and Information Complexity
Quantum Tokens for Digital Signatures
Separations in Query Complexity Using Cheat Sheets
Sculpting Quantum Speedups
Supporting Ranking Queries on Uncertain and Incomplete Data