(In theoretical computer science, the list of authors is generally sorted in alphabetical order.)
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
Yizhi Huang, Rahul Ilango, Hanlin Ren.
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.
ACM Symposium on Theory of Computing (STOC) 2023.
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren.
ACM Symposium on Theory of Computing (STOC) 2023.