Regular biography
Heng Guo is a Reader in Algorithms and Complexity at The University of Edinburgh, Department of Computer Science. His research focuses on algorithms and complexity, though specific details are not provided. He is affiliated with the university and can be contacted via email at Heng.Guo@ed.ac.uk. His professional profile is available at https://www.ed.ac.uk/Heng_Guo.html.
Scholar-generated biography
Heng Guo is a researcher at the University of Edinburgh, specializing in algorithms and complexity. His work focuses on the design and analysis of efficient algorithms for complex computational problems, particularly in the areas of sampling, counting, and approximation. Guo's research includes the application of the Lovász local lemma, spectral independence, and correlation decay techniques to problems such as Ising models, Tutte partition functions, and Boolean #CSP. His contributions span both theoretical and applied aspects of computational complexity, with an emphasis on understanding the limits and capabilities of approximation algorithms.