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
-
Slicewise definability in first-order logic with bounded quantifier rank
Citation: Chen, Yijia, Joerg Flum, and Xuangui Huang. "Slicewise Definability in First-order Logic with Bounded Quantifier Rank." 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017. -
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. -
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