A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries M Jerrum, A Sinclair, E Vigoda Journal of the ACM (JACM) 51 (4), 671-697, 2004 | 989 | 2004 |

Improved bounds for sampling colorings E Vigoda 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 284 | 1999 |

Phylogenetic MCMC algorithms are misleading on mixtures of trees E Mossel, E Vigoda Science 309 (5744), 2207-2209, 2005 | 188 | 2005 |

Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models A Galanis, D Štefankovič, E Vigoda Combinatorics, Probability and Computing 25 (4), 500-559, 2016 | 156 | 2016 |

Adaptive simulated annealing: A near-optimal connection between sampling and counting D Štefankovič, S Vempala, E Vigoda Journal of the ACM (JACM) 56 (3), 1-36, 2009 | 133 | 2009 |

Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics C Borgs, JT Chayes, A Frieze, JH Kim, P Tetali, E Vigoda 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 218-229, 1999 | 132 | 1999 |

Accelerating simulated annealing for the permanent and combinatorial counting problems I Bezáková, D Štefankovič, VV Vazirani, E Vigoda SIAM Journal on Computing 37 (5), 1429-1454, 2008 | 131 | 2008 |

Fast convergence of the Glauber dynamics for sampling independent sets M Luby, E Vigoda Random Structures and Algorithms 15 (3-4), 229-241, 1999 | 130 | 1999 |

Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion Z Chen, K Liu, E Vigoda 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), 2021, 1537-1550, 2021 | 122 | 2021 |

Mixing in time and space for lattice spin systems: A combinatorial view M Dyer, A Sinclair, E Vigoda, D Weitz Random Structures & Algorithms 24 (4), 461-479, 2004 | 118 | 2004 |

Randomly coloring sparse random graphs with fewer colors than the maximum degree M Dyer, AD Flaxman, AM Frieze, E Vigoda Random Structures & Algorithms 29 (4), 450-465, 2006 | 117 | 2006 |

Approximately counting up to four M Luby, E Vigoda 29th Annual ACM Symposium on Theory of Computing (STOC), 1997, 682-687, 1997 | 111 | 1997 |

Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains M Jerrum, JB Son, P Tetali, E Vigoda Annals of Applied Probability 14 (4), 1741-1765, 2004 | 110 | 2004 |

Heterogeneous genomic molecular clocks in primates SH Kim, N Elango, C Warden, E Vigoda, SV Yi PLoS genetics 2 (10), e163, 2006 | 106 | 2006 |

Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region A Galanis, D Štefankovič, E Vigoda Journal of the ACM (JACM) 62 (6), 1-60, 2015 | 102 | 2015 |

A deterministic polynomial-time approximation scheme for counting knapsack solutions D Štefankovič, S Vempala, E Vigoda SIAM Journal on Computing 41 (2), 356-366, 2012 | 101* | 2012 |

A non-Markovian coupling for randomly sampling colorings TP Hayes, E Vigoda 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003 …, 2003 | 98 | 2003 |

Randomly coloring constant degree graphs M Dyer, A Frieze, TP Hayes, E Vigoda Random Structures & Algorithms 43 (2), 181-200, 2013 | 92* | 2013 |

A survey on the use of Markov chains to randomly sample colourings A Frieze, E Vigoda Oxford Lecture Series in Mathematics and its Applications 34, 53, 2007 | 91 | 2007 |

Mutations of different molecular origins exhibit contrasting patterns of regional substitution rate variation N Elango, SH Kim, NISC Comparative Sequencing Program, E Vigoda, ... PLoS Computational Biology 4 (2), e1000015, 2008 | 89 | 2008 |