| A complete dichotomy rises from the capture of vanishing signatures JY Cai, H Guo, T Williams SIAM Journal on Computing 45 (5), 1671-1728, 2016 | 81 | 2016 |
| Uniform sampling through the Lovász local lemma H Guo, M Jerrum, J Liu Journal of the ACM (JACM) 66 (3), 1-31, 2019 | 72 | 2019 |
| Random cluster dynamics for the Ising model is rapidly mixing H Guo, M Jerrum Annals of Applied Probability 28 (2), 1292-1313, 2018 | 69 | 2018 |
| The complexity of approximating complex-valued Ising and Tutte partition functions LA Goldberg, H Guo computational complexity 26 (4), 765-833, 2017 | 58 | 2017 |
| Rapid mixing from spectral independence beyond the Boolean domain W Feng, H Guo, Y Yin, C Zhang ACM Transactions on Algorithms (TALG) 18 (3), 1-32, 2022 | 52 | 2022 |
| Modified log-Sobolev inequalities for strongly log-concave distributions M Cryan, H Guo, G Mousa Annals of Probability 49 (1), 506-525, 2021 | 52 | 2021 |
| # BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region JY Cai, A Galanis, LA Goldberg, H Guo, M Jerrum, D Štefankovič, ... Journal of Computer and System Sciences 82 (5), 690-711, 2016 | 48 | 2016 |
| A polynomial-time approximation algorithm for all-terminal network reliability H Guo, M Jerrum SIAM Journal on Computing 48 (3), 964–978, 2017 | 42 | 2017 |
| The complexity of planar Boolean# CSP with complex weights H Guo, T Williams Journal of Computer and System Sciences 107, 1-27, 2020 | 40* | 2020 |
| FKT is not universal—A planar Holant dichotomy for symmetric constraints JY Cai, Z Fu, H Guo, T Williams Theory of Computing Systems, 2021 | 38* | 2021 |
| The complexity of symmetric Boolean parity Holant problems H Guo, P Lu, LG Valiant SIAM Journal on Computing 42 (1), 324-356, 2013 | 36 | 2013 |
| Approximation via correlation decay when strong spatial mixing fails I Bezáková, A Galanis, LA Goldberg, H Guo, D Stefankovic SIAM Journal on Computing 48 (2), 279-349, 2019 | 34 | 2019 |
| The complexity of weighted Boolean #CSP modulo k H Guo, S Huang, P Lu, M Xia 28th International Symposium on Theoretical Aspects of Computer Science …, 2011 | 31 | 2011 |
| Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime W Feng, H Guo, Y Yin, C Zhang Journal of the ACM (JACM) 68 (6), 1-42, 2021 | 26 | 2021 |
| Zeros of Holant problems: locations and algorithms H Guo, C Liao, P Lu, C Zhang ACM Transactions on Algorithms (TALG) 17 (1), 1-25, 2020 | 24 | 2020 |
| The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems JY Cai, H Guo, T Williams Research in the Mathematical Sciences 3 (1), 18, 2016 | 24 | 2016 |
| Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems H Guo, P Lu ACM Transactions on Computation Theory (TOCT) 10 (4), 17, 2018 | 21 | 2018 |
| Counting solutions to random CNF formulas A Galanis, LA Goldberg, H Guo, K Yang SIAM Journal on Computing 50 (6), 1701-1738, 2021 | 18 | 2021 |
| Counting hypergraph colorings in the local lemma regime H Guo, C Liao, P Lu, C Zhang SIAM Journal on Computing 48 (4), 1397-1424, 2019 | 17 | 2019 |
| Tight bounds for popping algorithms H Guo, K He Random Structures & Algorithms 57 (2), 371-392, 2020 | 16 | 2020 |
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
