(In theoretical computer science, the list of authors is generally sorted in alphabetical order.)
Fine-Grained Complexity in a World Without Cryptography.
Josh Alman, Yizhi Huang, Kevin Yeo.
44th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2025).
Relative-error monotonicity testing.
Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco Servedio, Tianqi Yang.
36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025).
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren.
55th Annual ACM Symposium on Theory of Computing (STOC 2023).
Parallel Discrete Sampling via Continuous Walks.
Nima Anari, Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, Katherine Yu.
55th Annual ACM Symposium on Theory of Computing (STOC 2023).
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
Yizhi Huang, Rahul Ilango, Hanlin Ren.
55th Annual ACM Symposium on Theory of Computing (STOC 2023).