default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeng Guo 0001
Person information
- affiliation: University of Edinburgh, UK
- affiliation (2015 - 2017): Queen Mary University of London, UK
- affiliation (PhD 2015): University of Wisconsin - Madison, USA
- affiliation (former): Peking University, China
Other persons with the same name
- Heng Guo — disambiguation page
- Heng Guo 0002 — Purdue University, West Lafayette, IN, USA
- Heng Guo 0003
![[0000-0003-0047-3927]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-0047-3927")
— Osaka University, Japan (and 1 more) - Heng Guo 0004 — Nanyang Technological University, Singapore
- Heng Guo 0005 — Guangdong University of Technology, Guangzhou, Guangdong, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra:
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity. SIAM J. Discret. Math. 38(4): 2750-2811 (2024)- [c30]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. ICALP 2024: 11:1-11:20 - [c29]Weiming Feng, Heng Guo:
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. ICALP 2024: 62:1-62:19 - [i38]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang:
Rapid mixing of the flip chain over non-crossing spanning trees. CoRR abs/2409.07892 (2024) - 2023
- [j25]Heng Guo, Mark Jerrum:
Counting Vertices of Integral Polytopes Defined by Facets. Discret. Comput. Geom. 70(3): 975-990 (2023) - [j24]Weiming Feng, Heng Guo, Jiaheng Wang:
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. Inf. Comput. 294: 105066 (2023) - [j23]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023) - [c28]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. FOCS 2023: 1963-1990 - [c27]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA 2023: 343-347 - [i37]Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time. CoRR abs/2306.14867 (2023) - [i36]Weiming Feng, Heng Guo:
An FPRAS for two terminal reliability in directed acyclic graphs. CoRR abs/2310.00938 (2023) - 2022
- [j22]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. Theory Comput. Syst. 66(1): 143-308 (2022) - [j21]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. Random Struct. Algorithms 61(4): 678-709 (2022) - [j20]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. ACM Trans. Algorithms 18(3): 28:1-28:32 (2022) - [j19]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14(3-4): 1-33 (2022) - [c26]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved Bounds for Randomly Colouring Simple Hypergraphs. APPROX/RANDOM 2022: 25:1-25:17 - [c25]Zhuolin Yang, Zhikuan Zhao, Boxin Wang, Jiawei Zhang, Linyi Li, Hengzhi Pei, Bojan Karlas, Ji Liu, Heng Guo, Ce Zhang, Bo Li:
Improving Certified Robustness via Statistical Learning with Logical Reasoning. NeurIPS 2022 - [i35]Weiming Feng, Heng Guo, Jiaheng Wang:
Improved bounds for randomly colouring simple hypergraphs. CoRR abs/2202.05554 (2022) - [i34]Weiming Feng, Heng Guo, Jiaheng Wang:
Sampling from the ferromagnetic Ising model with external fields. CoRR abs/2205.01985 (2022) - [i33]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos:
Fast sampling of satisfying assignments from random k-SAT. CoRR abs/2206.15308 (2022) - [i32]Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR abs/2208.00740 (2022) - [i31]Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Towards derandomising Markov chain Monte Carlo. CoRR abs/2211.03487 (2022) - 2021
- [j18]Heng Guo, Mark Jerrum:
Approximately counting bases of bicircular matroids. Comb. Probab. Comput. 30(1): 124-135 (2021) - [j17]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime. J. ACM 68(6): 40:1-40:42 (2021) - [j16]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. SIAM J. Comput. 50(6): 1701-1738 (2021) - [j15]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant Problems: Locations and Algorithms. ACM Trans. Algorithms 17(1): 4:1-4:25 (2021) - [c24]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. SODA 2021: 1558-1577 - [i30]Heng Guo, Mark Jerrum:
Counting vertices of integer polytopes defined by facets. CoRR abs/2105.01469 (2021) - [i29]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of counting hypergraph colourings. CoRR abs/2107.05486 (2021) - 2020
- [j14]Heng Guo, Tyson Williams:
The complexity of planar Boolean #CSP with complex weights. J. Comput. Syst. Sci. 107: 1-27 (2020) - [j13]Heng Guo, Kun He:
Tight bounds for popping algorithms. Random Struct. Algorithms 57(2): 371-392 (2020) - [c23]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. ICALP 2020: 53:1-53:14 - [c22]Heng Guo, Jingcheng Liu, Pinyan Lu:
Zeros of ferromagnetic 2-spin systems. SODA 2020: 181-192 - [c21]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast sampling and counting k-SAT solutions in the local lemma regime. STOC 2020: 854-867 - [i28]Zhuolin Yang, Zhikuan Zhao, Hengzhi Pei, Boxin Wang, Bojan Karlas, Ji Liu, Heng Guo, Bo Li, Ce Zhang:
End-to-end Robustness for Sensing-Reasoning Machine Learning Pipelines. CoRR abs/2003.00120 (2020) - [i27]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid mixing from spectral independence beyond the Boolean domain. CoRR abs/2007.08091 (2020) - [i26]Heng Guo, Giorgos Mousa:
Local-to-Global Contraction in Simplicial Complexes. CoRR abs/2012.14317 (2020)
2010 – 2019
- 2019
- [j12]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform Sampling Through the Lovász Local Lemma. J. ACM 66(3): 18:1-18:31 (2019) - [j11]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48(2): 279-349 (2019) - [j10]Heng Guo, Mark Jerrum:
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. SIAM J. Comput. 48(3): 964-978 (2019) - [j9]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting Hypergraph Colorings in the Local Lemma Regime. SIAM J. Comput. 48(4): 1397-1424 (2019) - [c20]Mary Cryan, Heng Guo, Giorgos Mousa:
Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. FOCS 2019: 1358-1370 - [c19]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant problems: locations and algorithms. SODA 2019: 2262-2278 - [i25]Mary Cryan, Heng Guo, Giorgos Mousa:
Modified log-Sobolev inequalities for strongly log-concave distributions. CoRR abs/1903.06081 (2019) - [i24]Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. CoRR abs/1907.06033 (2019) - [i23]Heng Guo, Jingcheng Liu, Pinyan Lu:
Zeros of ferromagnetic 2-spin systems. CoRR abs/1907.06156 (2019) - [i22]Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR abs/1911.01319 (2019) - [i21]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting solutions to random CNF formulas. CoRR abs/1911.07020 (2019) - 2018
- [j8]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic algorithms beyond matchgates. Inf. Comput. 259(1): 102-129 (2018) - [j7]Jin-Yi Cai, Heng Guo, Tyson Williams:
Clifford gates in the Holant framework. Theor. Comput. Sci. 745: 163-171 (2018) - [j6]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ACM Trans. Comput. Theory 10(4): 17:1-17:25 (2018) - [c18]Heng Guo, Kaan Kara, Ce Zhang:
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond. AISTATS 2018: 178-187 - [c17]Heng Guo, Mark Jerrum:
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. ICALP 2018: 68:1-68:12 - [c16]Heng Guo, Mark Jerrum:
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. ICALP 2018: 69:1-69:10 - [c15]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting hypergraph colourings in the local lemma regime. STOC 2018: 926-939 - [i20]Heng Guo, Mark Jerrum:
Perfect simulation of the Hard Disks Model by Partial Rejection Sampling. CoRR abs/1801.07342 (2018) - [i19]Heng Guo, Kun He:
Tight bounds for popping algorithms. CoRR abs/1807.01680 (2018) - [i18]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant problems: locations and algorithms. CoRR abs/1807.09129 (2018) - [i17]Heng Guo, Mark Jerrum:
Approximately counting bases of bicircular matroids. CoRR abs/1808.09548 (2018) - 2017
- [j5]Leslie Ann Goldberg, Heng Guo:
The Complexity of Approximating complex-valued Ising and Tutte partition functions. Comput. Complex. 26(4): 765-833 (2017) - [c14]Heng Guo, Mark Jerrum:
Random cluster dynamics for the Ising model is rapidly mixing. SODA 2017: 1818-1827 - [c13]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform sampling through the Lovasz local lemma. STOC 2017: 342-355 - [p1]Heng Guo, Pinyan Lu:
On the Complexity of Holant Problems. The Constraint Satisfaction Problem 2017: 159-177 - [i16]Jin-Yi Cai, Heng Guo, Tyson Williams:
Clifford Gates in the Holant Framework. CoRR abs/1705.00942 (2017) - [i15]Heng Guo, Kaan Kara, Ce Zhang:
Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond. CoRR abs/1705.05154 (2017) - [i14]Heng Guo, Mark Jerrum:
A simple FPRAS for bi-directed reachability. CoRR abs/1709.08561 (2017) - [i13]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting hypergraph colorings in the local lemma regime. CoRR abs/1711.03396 (2017) - 2016
- [j4]Heng Guo:
Mapping the complexity of counting problems. Bull. EATCS 120 (2016) - [j3]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j2]Jin-Yi Cai, Heng Guo, Tyson Williams:
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. SIAM J. Comput. 45(5): 1671-1728 (2016) - [c12]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. APPROX-RANDOM 2016: 31:1-31:26 - [c11]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - [r1]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holant Problems. Encyclopedia of Algorithms 2016: 918-921 - [i12]Heng Guo, Mark Jerrum:
Random cluster dynamics for the Ising model is rapidly mixing. CoRR abs/1605.00139 (2016) - [i11]Heng Guo, Mark Jerrum, Jingcheng Liu:
Uniform Sampling through the Lovász Local Lemma. CoRR abs/1611.01647 (2016) - 2015
- [c10]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
A Holant Dichotomy: Is the FKT Algorithm Universal? FOCS 2015: 1259-1276 - [i10]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
A Holant Dichotomy: Is the FKT Algorithm Universal? CoRR abs/1505.02993 (2015) - [i9]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - [i8]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. CoRR abs/1511.00493 (2015) - 2014
- [c9]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM 2014: 582-595 - [c8]Jin-Yi Cai, Heng Guo, Tyson Williams:
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. FOCS 2014: 601-610 - [c7]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic Algorithms Beyond Matchgates. ICALP (1) 2014: 271-282 - [i7]Jin-Yi Cai, Heng Guo, Tyson Williams:
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. CoRR abs/1404.4020 (2014) - [i6]Leslie Ann Goldberg, Heng Guo:
The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation. CoRR abs/1409.5627 (2014) - 2013
- [j1]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42(1): 324-356 (2013) - [c6]Heng Guo, Tyson Williams:
The Complexity of Planar Boolean #CSP with Complex Weights. ICALP (1) 2013: 516-527 - [c5]Jin-Yi Cai, Heng Guo, Tyson Williams:
A complete dichotomy rises from the capture of vanishing signatures: extended abstract. STOC 2013: 635-644 - [i5]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic Algorithms Beyond Matchgates. CoRR abs/1307.7430 (2013) - [i4]Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum:
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR abs/1311.4451 (2013) - 2012
- [c4]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 - [i3]Jin-Yi Cai, Heng Guo, Tyson Williams:
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. CoRR abs/1204.6445 (2012) - [i2]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems. CoRR abs/1205.2934 (2012) - [i1]Heng Guo, Tyson Williams:
The Complexity of Planar Boolean #CSP with Complex Weights. CoRR abs/1212.2284 (2012) - 2011
- [c3]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 - [c2]Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia:
The Complexity of Weighted Boolean #CSP Modulo k. STACS 2011: 249-260
2000 – 2009
- 2009
- [c1]Heng Guo, Hanpin Wang, Zhongyuan Xu, Yongzhi Cao:
On Model Checking Boolean BI. CSL 2009: 302-316
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-03 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
