Shuai Shao
Scholar

Shuai Shao

Google Scholar ID: Lh-UKzcAAAAJ
University of Science and Technology of China
Complexity TheoryInformation Theory
Citations & Impact
All-time
Citations
104
 
H-index
6
 
i10-index
4
 
Publications
11
 
Co-authors
6
list available
Resume (English only)
Academic Achievements
  • Published several research articles, including 'From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity' (with Xiaowei Ye), 'Eulerian orientations and Hadamard codes: A novel connection via counting' (with Zhuxiao Tang), 'A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees' (with Standa Živný), among others.
Research Experience
  • Currently a faculty member at the School of Computer Science and Technology, University of Science and Technology of China. Previously, a postdoc at the University of Edinburgh and a postdoc and junior research fellow at the University of Oxford.
Education
  • Ph.D., M.A. in Math, and M.Sc. in CS from the University of Wisconsin at Madison, supervised by Prof. Jin-Yi Cai; B.Sc. degree from the HUA Loo-Keng talent program in mathematics (honors program) at the School of the Gifted Young, USTC.
Background
  • Research interests lie in theoretical computer science, particularly in the complexity classification of counting/decision/optimization problems in the Holant (edge-CSP) framework. Interested in the connections between Holant problems and quantum theory, as well as approximate counting algorithms and their links with phase transitions in statistical physics.
Miscellany
  • Glad to work with self-motivated students with strong backgrounds in theoretical computer science, statistical physics, quantum theory, or any fields of mathematics.