Heng Guo

Graduate Student
Computer Sciences Department
University of Wisconsin - Madison
Room 4352
1210 W. Dayton St., Madison, WI 53706
email: hguo AT cs

About Me

I am a third year Ph.D. student in Computer Sciences Department of University of Wisconsin, Madison. I am very fortunate to be advised by Jin-Yi Cai. Before coming to Madison, I obtained my M.S. in Computer Science and B.S. in Mathematics both from Peking University. Here is my cv.

Research

My current research interest mainly lies in the complexity of counting problems. In particular, I'm interested in the complexity of Holant problems, #CSP, and graph homomorphisms in exact, moduli, or approximation setting.

Papers

The Complexity of Planar Boolean #CSP with Complex Weights [pdf]
Joint work with Tyson Williams.
ICALP 2013, to appear

A Complete Dichotomy Rises from the Capture of Vanishing Signatures [pdf]
Joint work with Jin-Yi Cai and Tyson Williams.
STOC 2013, to appear

Inapproximability After Uniqueness Phase Transition in Two-Spin Systems [pdf]
Joint work with Jin-Yi Cai, Xi Chen, and Pinyan Lu.
COCOA 2012

The Complexity of Symmetric Boolean Parity Holant Problems [pdf]
Joint work with Pinyan Lu, Leslie G. Valiant.
ICALP 2011
SIAM Journal on Computing, 42(1), 324-356. 2013

The Complexity of Weighted Boolean #CSP Modulo k [pdf]
Joint work with Sangxia Huang, Pinyan Lu, Mingji Xia
STACS 2011

On Model Checking Boolean BI [pdf]
Joint work with Hanpin Wang, Zhongyuan Xu, Yongzhi Cao
CSL 2009

Last updated on Friday Apr 12th 2013