Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion Z Chen, K Liu, E Vigoda The 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), 1537–1550, 2021 | 111 | 2021 |

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction Z Chen, K Liu, E Vigoda The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS …, 2020 | 76 | 2020 |

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization A Blanca, P Caputo, Z Chen, D Parisi, D Štefankovič, E Vigoda The 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3670–3692, 2022 | 72 | 2022 |

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions Z Chen, SS Vempala Theory of Computing 18 (1), 1–18, 2022 | 66 | 2022 |

Rapid mixing for colorings via spectral independence Z Chen, A Galanis, D Štefankovič, E Vigoda The 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1548–1557, 2021 | 60 | 2021 |

Fast algorithms at low temperatures via Markov chains Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda Random Structures & Algorithms 58 (2), 294–321, 2021 | 36 | 2021 |

Spectral Independence via Stability and Applications to Holant-Type Problems Z Chen, K Liu, E Vigoda The 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS …, 2022 | 27 | 2022 |

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. I Bezáková, A Blanca, Z Chen, D Štefankovič, E Vigoda Journal of Machine Learning Research 21 (25), 1–62, 2020 | 21 | 2020 |

Almost-linear planted cliques elude the metropolis process Z Chen, E Mossel, I Zadik Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 13 | 2023 |

Strong spatial mixing for colorings on trees and its algorithmic applications Z Chen, K Liu, N Mani, A Moitra 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 12 | 2023 |

NEMO: novel and efficient multicast routing schemes for hybrid data center networks X Gao, T Chen, Z Chen, G Chen Computer Networks 138, 149–163, 2018 | 12 | 2018 |

From Algorithms to Connectivity and Back: Finding a Giant Component in Random *k*-SATZ Chen, N Mani, A Moitra Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region Z Chen, A Galanis, D Štefankovič, E Vigoda The 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2198–2207, 2022 | 11 | 2022 |

FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system X Gao, B Li, Z Chen, M Yin, G Chen, Y Jin 2015 IEEE International Conference on Communications (ICC), 301–306, 2015 | 10 | 2015 |

Swendsen‐Wang dynamics for general graphs in the tree uniqueness region A Blanca, Z Chen, E Vigoda Random Structures & Algorithms 56 (2), 373–400, 2020 | 9 | 2020 |

The Swendsen-Wang Dynamics on Trees A Blanca, Z Chen, D Štefankovič, E Vigoda The 25th International Conference on Randomization and Computation (RANDOM …, 2021 | 8 | 2021 |

Fast Sampling of *b*-Matchings and *b*-Edge CoversZ Chen, Y Gu Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 6 | 2024 |

Structure Learning of H-Colorings A Blanca, Z Chen, D Štefankovič, E Vigoda ACM Transactions on Algorithms (TALG) 16 (3), 1–28, 2020 | 4 | 2020 |

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models A Blanca, Z Chen, D Štefankovič, E Vigoda The 33rd Conference on Learning Theory (COLT) 125, 514–529, 2020 | 3 | 2020 |

Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems Z Chen Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 2 | 2024 |