General upper bounds for covering numbers. - Anant P. Godbole; Sandra E. Thompson; Eric Vigoda (Ars Comb., 1996)

Approximately Counting Up To Four (Extended Abstract). - Michael Luby; Eric Vigoda (STOC, 1997)

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. - Christian Borgs; Jennifer T. Chayes; Alan M. Frieze; Jeong Han Kim; Prasad Tetali; Eric Vigoda; Van H. Vu (FOCS, 1999)

Improved Bounds for Sampling Colorings. - Eric Vigoda (FOCS, 1999)

Fast convergence of the Glauber dynamics for sampling independent sets. - Michael Luby; Eric Vigoda (Random Struct. Algorithms, 1999)

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries - Mark Jerrum; Eric Vigoda (Electron. Colloquium Comput. Complex., 2000)

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. - Mark Jerrum; Alistair Sinclair; Eric Vigoda (STOC, 2001)

A Note on the Glauber Dynamics for Sampling Independent Sets. - Eric Vigoda (Electron. J. Comb., 2001)

Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. - Martin E. Dyer; Mark Jerrum; Eric Vigoda (RANDOM, 2002)

A Non-Markovian Coupling for Randomly Sampling Colorings. - Thomas P. Hayes; Eric Vigoda (FOCS, 2003)

Randomly coloring constant degree graphs - Martin E. Dyer; Alan M. Frieze; Thomas P. Hayes; Eric Vigoda (Electron. Colloquium Comput. Complex., 2004)

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. - Mark Jerrum; Alistair Sinclair; Eric Vigoda (J. ACM, 2004)

Mixing in time and space for lattice spin systems: A combinatorial view. - Martin E. Dyer; Alistair Sinclair; Eric Vigoda; Dror Weitz (Random Struct. Algorithms, 2004)

Coupling with the stationary distribution and improved sampling for colorings and independent sets. - Thomas P. Hayes; Eric Vigoda (SODA, 2005)

Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. - Tomasz Luczak 001; Eric Vigoda (J. Discrete Algorithms, 2005)

Randomly coloring sparse random graphs with fewer colors than the maximum degree. - Martin E. Dyer; Abraham D. Flaxman; Alan M. Frieze; Eric Vigoda (Random Struct. Algorithms, 2006)

Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. - Daniel Stefankovic; Eric Vigoda (J. Comput. Biol., 2007)

Sampling binary contingency tables with a greedy start. - Ivona Bezáková; Nayantara Bhatnagar; Eric Vigoda (Random Struct. Algorithms, 2007)

Variable length path coupling. - Thomas P. Hayes; Eric Vigoda (Random Struct. Algorithms, 2007)

Random Bichromatic Matchings. - Nayantara Bhatnagar; Dana Randall; Vijay V. Vazirani; Eric Vigoda (Algorithmica, 2008)

Mutations of Different Molecular Origins Exhibit Contrasting Patterns of Regional Substitution Rate Variation. - Navin Elango; Seong-Ho Kim; Eric Vigoda; Soojin V. Yi (PLoS Comput. Biol., 2008)

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. - Ivona Bezáková; Daniel Stefankovic; Vijay V. Vazirani; Eric Vigoda (SIAM J. Comput., 2008)

Adaptive simulated annealing: A near-optimal connection between sampling and counting. - Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (J. ACM, 2009)

Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. - Prasad Tetali; Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SODA, 2010)

Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species - Daniel Stefankovic; Eric Vigoda (CoRR, 2010)

An FPTAS for #Knapsack and Related Counting Problems. - Parikshit Gopalan; Adam R. Klivans; Raghu Meka; Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (FOCS, 2011)

Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. - Ricardo Restrepo; Jinwoo Shin; Prasad Tetali; Eric Vigoda; Linji Yang (FOCS, 2011)

Reconstruction for Colorings on Trees. - Nayantara Bhatnagar; Juan Carlos Vera 001; Eric Vigoda; Dror Weitz (SIAM J. Discret. Math., 2011)

Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. - Daniel Stefankovic; Eric Vigoda (SIAM J. Discret. Math., 2011)

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. - Ivona Bezáková; Alistair Sinclair; Daniel Stefankovic; Eric Vigoda (Algorithmica, 2012)

A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. - Daniel Stefankovic; Santosh S. Vempala; Eric Vigoda (SIAM J. Comput., 2012)

BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (CoRR, 2013)

Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (STOC, 2014)

Improved inapproximability results for counting independent sets in the hard-core model. - Andreas Galanis; Qi Ge; Daniel Stefankovic; Eric Vigoda; Linji Yang (Random Struct. Algorithms, 2014)

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. - Ricardo Restrepo; Daniel Stefankovic; Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SIAM J. Discret. Math., 2014)

Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (J. ACM, 2015)

Randomly coloring planar graphs with fewer colors than the maximum degree. - Thomas P. Hayes; Juan Carlos Vera 001; Eric Vigoda (Random Struct. Algorithms, 2015)

Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. - Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SIAM J. Discret. Math., 2015)

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2016)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. - Jin-Yi Cai; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Mark Jerrum; Daniel Stefankovic; Eric Vigoda (J. Comput. Syst. Sci., 2016)

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda; Linji Yang (SIAM J. Comput., 2016)

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. - Sejun Park; Yunhun Jang; Andreas Galanis; Jinwoo Shin; Daniel Stefankovic; Eric Vigoda (AISTATS, 2017)

On Counting Perfect Matchings in General Graphs. - Daniel Stefankovic; Eric Vigoda; John Wilmes (LATIN, 2018)

Spatial Mixing and Non-local Markov chains. - Antonio Blanca; Pietro Caputo; Alistair Sinclair; Eric Vigoda (SODA, 2018)

Sampling Random Colorings of Sparse Random Graphs. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (SODA, 2018)

Random-Cluster Dynamics in Z2: Rapid Mixing with General Boundary Conditions. - Antonio Blanca; Reza Gheissari; Eric Vigoda (APPROX-RANDOM, 2019)

Improved Strong Spatial Mixing for Colorings on Trees. - Charilaos Efthymiou 001; Andreas Galanis; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (APPROX-RANDOM, 2019)

Spatial mixing and nonlocal Markov chains. - Antonio Blanca; Pietro Caputo; Alistair Sinclair; Eric Vigoda (Random Struct. Algorithms, 2019)

Swendsen-Wang algorithm on the mean-field Potts model. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Random Struct. Algorithms, 2019)

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda; Yitong Yin (SIAM J. Comput., 2019)

The complexity of approximating averages on bounded-degree graphs. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (FOCS, 2020)

Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. - Ivona Bezáková; Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (J. Mach. Learn. Res., 2020)

Swendsen-Wang dynamics for general graphs in the tree uniqueness region. - Antonio Blanca; Zongchen Chen; Eric Vigoda (Random Struct. Algorithms, 2020)

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. - Antonio Blanca; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic; Eric Vigoda; Kuan Yang 001 (SIAM J. Discret. Math., 2020)

Structure Learning of H-Colorings. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (ACM Trans. Algorithms, 2020)

Random Walks on Small World Networks. - Martin E. Dyer; Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum; Eric Vigoda (ACM Trans. Algorithms, 2020)

Rapid Mixing for Colorings via Spectral Independence. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2021)

Entropy decay in the Swendsen-Wang dynamics on ℤd. - Antonio Blanca; Pietro Caputo; Daniel Parisi; Alistair Sinclair; Eric Vigoda (STOC, 2021)

Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. - Zongchen Chen; Kuikui Liu; Eric Vigoda (STOC, 2021)

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (J. Mach. Learn. Res., 2021)

Fast algorithms at low temperatures via Markov chains. - Zongchen Chen; Andreas Galanis; Leslie Ann Goldberg; Will Perkins 001; James Stewart 001; Eric Vigoda (Random Struct. Algorithms, 2021)

Metastability of the Potts Ferromagnet on Random Regular Graphs. - Amin Coja-Oghlan; Andreas Galanis; Leslie Ann Goldberg; Jean Bernoulli Ravelomanana; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

Approximating Observables Is as Hard as Counting. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. - Antonio Blanca; Pietro Caputo; Zongchen Chen; Daniel Parisi; Daniel Stefankovic; Eric Vigoda (SODA, 2022)

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2022)

Identity Testing for High-Dimensional Distributions via Entropy Tensorization. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (CoRR, 2022)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time. - Úrsula Hébert-Johnson; Daniel Lokshtanov; Eric Vigoda (ESA, 2023)

Improved Distributed Algorithms for Random Colorings. - Charlie Carlson; Daniel Frishberg; Eric Vigoda (OPODIS, 2023)

Spectral Independence Lecture Notes. - Daniel Stefankovic; Eric Vigoda (CoRR, 2023)

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. - Zongchen Chen; Kuikui Liu; Eric Vigoda (SIAM J. Comput., 2023)

The Swendsen-Wang dynamics on trees. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (Random Struct. Algorithms, 2023)

Spectral Independence via Stability and Applications to Holant-Type Problems. - Zongchen Chen; Kuikui Liu; Eric Vigoda (TheoretiCS, 2024)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. - Charlie Carlson; Xiaoyu Chen; Weiming Feng 001; Eric Vigoda (SODA, 2025)

Flip Dynamics for Sampling Colorings: Improving (11/6 - ε) Using A Simple Metric. - Charlie Carlson; Eric Vigoda (SODA, 2025)

Optimal mixing via tensorization for random independent sets on arbitrary trees. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2025)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. - Antonio Blanca; Zongchen Chen; Daniel Stefankovic; Eric Vigoda (ACM Trans. Algorithms, 2025)