1. Generalizations of Matrix Multiplication can solve the Light Bulb Problem;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Removing Additive Structure in 3SUM-Based Reductions;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Sampling near neighbors in search for fairness;Communications of the ACM;2022-07-21
5. Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09