Jingcheng is in the final year of his PhD in the CS theory group at UC Berkeley, with an anticipated completion of summer 2019, under the supervision of Professor Alistair Sinclair. He is broadly interested in theoretical computer science. His current research focuses on the interplay between phase transitions in statistical physics, locations of zeros of graph polynomials, and algorithmic questions such as the tractable boundaries of approximate counting, sampling and inference. Before attending UC Berkeley, he completed his undergraduate studies in the ACM Honor Class of 2010, at Shanghai Jiao Tong University.
Geometry of Polynomials , Spring 2019Visiting Graduate Student
Counting Complexity and Phase Transitions , Spring 2016Visiting Graduate Student
Fine-Grained Complexity and Algorithm Design , Fall 2015Visiting Graduate Student