Xuangui Huang
PhD Student
Education
- MS, Shanghai Jiao Tong University – China
- BS, Shanghai Jiao Tong University – China
Biography
Xuangui Huang is a doctoral student at Northeastern University’s Khoury College of Computer Sciences, advised by Emanuele Viola. Xuangui is particularly interested in computational complexity. Prior to joining the doctoral program at Northeastern, Xuangui researched parameterized complexity, circuit complexity, and descriptive complexity while earning both his undergraduate and graduate degrees from Shanghai Jiao Tong University.
Recent Publications
-
Average-case rigidity lower bounds
Citation: Huang, Xuangui, and Emanuele Viola. "Average-case rigidity lower bounds." In International Computer Science Symposium in Russia (CSR 2021), pp. 186-205. Springer, Cham, 2021 -
Space Hardness of Solving Structured Linear Systems
Citation: Huang, Xuangui. "Space Hardness of Solving Structured Linear Systems." In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. -
Approximate Degree, Weight, and Indistinguishability
Citation: Huang, Xuangui, and Emanuele Viola. "Approximate Degree, Weight, and Indistinguishability." To appear in ACM Transactions on Computation Theory.