default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Vigoda
Person information
- affiliation: University of California, Santa Barbara, CA, USA
- affiliation (former): Georgia Institute of Technology, Atlanta GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. TheoretiCS 3 (2024)- [i42]Charlie Carlson, Xiaoyu Chen, Weiming Feng, Eric Vigoda:
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. CoRR abs/2407.04576 (2024) - [i41]Charlie Carlson, Eric Vigoda:
Flip Dynamics for Sampling Colorings: Improving (11/6-ε) Using a Simple Metric. CoRR abs/2407.04870 (2024) - 2023
- [j39]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang dynamics on trees. Random Struct. Algorithms 62(4): 791-831 (2023) - [j38]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. SIAM J. Comput. 52(1): 196-237 (2023) - [c55]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM 2023: 33:1-33:16 - [c54]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT 2023: 1774-1790 - [c53]Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda:
Counting and Sampling Labeled Chordal Graphs in Polynomial Time. ESA 2023: 58:1-58:17 - [c52]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. OPODIS 2023: 13:1-13:18 - [i40]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR abs/2307.07727 (2023) - [i39]Daniel Stefankovic, Eric Vigoda:
Spectral Independence Lecture Notes. CoRR abs/2307.13826 (2023) - [i38]Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda:
Counting and Sampling Labeled Chordal Graphs in Polynomial Time. CoRR abs/2308.09703 (2023) - [i37]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. CoRR abs/2309.07859 (2023) - 2022
- [c51]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP 2022: 45:1-45:20 - [c50]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating Observables Is as Hard as Counting. ICALP 2022: 63:1-63:18 - [c49]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. SODA 2022: 2198-2207 - [c48]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. SODA 2022: 3670-3692 - [i36]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts ferromagnet on random regular graphs. CoRR abs/2202.05777 (2022) - [i35]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating observables is as hard as counting. CoRR abs/2206.11606 (2022) - [i34]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR abs/2207.09102 (2022) - 2021
- [j37]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. 22: 152:1-152:56 (2021) - [j36]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - [c47]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM 2021: 43:1-43:15 - [c46]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. FOCS 2021: 149-160 - [c45]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. SODA 2021: 1548-1557 - [c44]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. STOC 2021: 1537-1550 - [c43]Antonio Blanca, Pietro Caputo, Daniel Parisi, Alistair Sinclair, Eric Vigoda:
Entropy decay in the Swendsen-Wang dynamics on ℤd. STOC 2021: 1551-1564 - [i33]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR abs/2103.07459 (2021) - [i32]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR abs/2105.01784 (2021) - [i31]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Spectral Independence via Stability and Applications to Holant-Type Problems. CoRR abs/2106.03366 (2021) - 2020
- [j35]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. J. Mach. Learn. Res. 21: 25:1-25:62 (2020) - [j34]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang dynamics for general graphs in the tree uniqueness region. Random Struct. Algorithms 56(2): 373-400 (2020) - [j33]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. 34(1): 742-793 (2020) - [j32]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-Colorings. ACM Trans. Algorithms 16(3): 36:1-36:28 (2020) - [j31]Martin E. Dyer
, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. ACM Trans. Algorithms 16(3): 37:1-37:33 (2020) - [c42]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT 2020: 514-529 - [c41]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. FOCS 2020: 1307-1318 - [c40]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. FOCS 2020: 1345-1355 - [i30]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction. CoRR abs/2004.09083 (2020) - [i29]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. CoRR abs/2004.09238 (2020) - [i28]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR abs/2004.10805 (2020) - [i27]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. CoRR abs/2007.08058 (2020) - [i26]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. CoRR abs/2007.08068 (2020) - [i25]Zongchen Chen, Kuikui Liu, Eric Vigoda:
Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion. CoRR abs/2011.02075 (2020)
2010 – 2019
- 2019
- [j30]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms 54(1): 82-147 (2019) - [j29]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial mixing and nonlocal Markov chains. Random Struct. Algorithms 55(3): 584-614 (2019) - [j28]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48(2): 581-643 (2019) - [c39]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [c38]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM 2019: 48:1-48:16 - [c37]Antonio Blanca, Reza Gheissari, Eric Vigoda:
Random-Cluster Dynamics in Z2: Rapid Mixing with General Boundary Conditions. APPROX-RANDOM 2019: 67:1-67:19 - [c36]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - [i24]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR abs/1901.07361 (2019) - [i23]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. CoRR abs/1909.07059 (2019) - 2018
- [c35]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of ${H}$-colorings. ALT 2018: 152-185 - [c34]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. APPROX-RANDOM 2018: 32:1-32:18 - [c33]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM 2018: 33:1-33:15 - [c32]Daniel Stefankovic, Eric Vigoda, John Wilmes:
On Counting Perfect Matchings in General Graphs. LATIN 2018: 873-885 - [c31]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. SODA 2018: 1759-1771 - [c30]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial Mixing and Non-local Markov chains. SODA 2018: 1965-1980 - [i22]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR abs/1804.08111 (2018) - [i21]Antonio Blanca, Zongchen Chen, Eric Vigoda:
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. CoRR abs/1806.04602 (2018) - 2017
- [c29]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. AISTATS 2017: 440-449 - [i20]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. CoRR abs/1704.02232 (2017) - [i19]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. CoRR abs/1707.02467 (2017) - [i18]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. CoRR abs/1707.03796 (2017) - [i17]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial Mixing and Non-local Markov chains. CoRR abs/1708.01513 (2017) - [i16]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-colorings. CoRR abs/1708.05118 (2017) - [i15]Daniel Stefankovic, Eric Vigoda, John Wilmes:
On Counting Perfect Matchings in General Graphs. CoRR abs/1712.07504 (2017) - 2016
- [j27]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Comb. Probab. Comput. 25(4): 500-559 (2016) - [j26]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) - [j25]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. 45(6): 2004-2065 (2016) - [c28]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS 2016: 704-713 - [i14]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR abs/1604.01422 (2016) - 2015
- [j24]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM 62(6): 50:1-50:60 (2015) - [j23]Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree. Random Struct. Algorithms 47(4): 731-759 (2015) - [j22]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. SIAM J. Discret. Math. 29(4): 1895-1915 (2015) - [c27]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM 2015: 815-828 - [i13]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang Algorithm on the Mean-Field Potts Model. CoRR abs/1502.06593 (2015) - 2014
- [j21]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1): 78-110 (2014) - [j20]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. 28(2): 835-861 (2014) - [c26]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 - [c25]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM 2014: 677-691 - [c24]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. STOC 2014: 823-831 - 2013
- [j19]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Random Struct. Algorithms 43(2): 181-200 (2013) - [c23]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. APPROX-RANDOM 2013: 699-713 - [i12]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region. CoRR abs/1305.2902 (2013) - [i11]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. CoRR abs/1306.0431 (2013) - [i10]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. CoRR abs/1311.4839 (2013) - 2012
- [j18]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - [j17]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. SIAM J. Comput. 41(2): 356-366 (2012) - [i9]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. CoRR abs/1203.2226 (2012) - 2011
- [j16]Nayantara Bhatnagar, Juan Carlos Vera, Eric Vigoda, Dror Weitz:
Reconstruction for Colorings on Trees. SIAM J. Discret. Math. 25(2): 809-826 (2011) - [j15]Daniel Stefankovic, Eric Vigoda:
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. SIAM J. Discret. Math. 25(3): 1194-1211 (2011) - [c22]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578 - [c21]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. FOCS 2011: 140-149 - [c20]Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826 - [c19]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SODA 2011: 945-956 - [i8]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. CoRR abs/1105.0914 (2011) - [i7]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. CoRR abs/1105.5131 (2011) - 2010
- [c18]Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA 2010: 1646-1656 - [i6]Daniel Stefankovic, Eric Vigoda:
Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. CoRR abs/1003.5964 (2010) - [i5]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. CoRR abs/1007.2255 (2010) - [i4]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions. CoRR abs/1008.1687 (2010)
2000 – 2009
- 2009
- [j14]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
Adaptive simulated annealing: A near-optimal connection between sampling and counting. J. ACM 56(3): 18:1-18:36 (2009) - 2008
- [j13]Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings. Algorithmica 50(4): 418-445 (2008) - [j12]Navin Elango, Seong-Ho Kim, Eric Vigoda, Soojin V. Yi:
Mutations of Different Molecular Origins Exhibit Contrasting Patterns of Regional Substitution Rate Variation. PLoS Comput. Biol. 4(2) (2008) - [j11]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37(5): 1429-1454 (2008) - 2007
- [j10]Daniel Stefankovic, Eric Vigoda:
Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. J. Comput. Biol. 14(2): 156-189 (2007) - [j9]Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda:
Sampling binary contingency tables with a greedy start. Random Struct. Algorithms 30(1-2): 168-205 (2007) - [j8]Thomas P. Hayes, Eric Vigoda:
Variable length path coupling. Random Struct. Algorithms 31(3): 251-272 (2007) - [c17]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. FOCS 2007: 183-193 - [c16]Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree. STOC 2007: 450-458 - 2006
- [j7]Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda:
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4): 450-465 (2006) - [c15]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147 - [c14]Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings. LATIN 2006: 190-201 - [c13]Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda:
Sampling binary contingency tables with a greedy start. SODA 2006: 414-423 - [c12]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907 - [i3]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. CoRR abs/cs/0612058 (2006) - 2005
- [j6]Tomasz Luczak, Eric Vigoda:
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. J. Discrete Algorithms 3(1): 92-100 (2005) - [c11]Thomas P. Hayes, Eric Vigoda:
Coupling with the stationary distribution and improved sampling for colorings and independent sets. SODA 2005: 971-979 - 2004
- [j5]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4): 671-697 (2004) - [j4]Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct. Algorithms 24(4): 461-479 (2004) - [c10]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly Coloring Constant Degree Graphs. FOCS 2004: 582-589 - [c9]Thomas P. Hayes, Eric Vigoda:
Variable length path coupling. SODA 2004: 103-110 - [i2]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c8]Thomas P. Hayes, Eric Vigoda:
A Non-Markovian Coupling for Randomly Sampling Colorings. FOCS 2003: 618-627 - 2002
- [c7]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM 2002: 68-77 - [c6]Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM 2002: 149-163 - 2001
- [j3]Eric Vigoda:
A Note on the Glauber Dynamics for Sampling Independent Sets. Electron. J. Comb. 8(1) (2001) - [c5]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Graphs, Morphisms and Statistical Physics 2001: 87-95 - [c4]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC 2001: 712-721 - 2000
- [i1]Mark Jerrum, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j2]Michael Luby, Eric Vigoda:
Fast convergence of the Glauber dynamics for sampling independent sets. Random Struct. Algorithms 15(3-4): 229-241 (1999) - [c3]Eric Vigoda:
Improved Bounds for Sampling Colorings. FOCS 1999: 51-59 - [c2]Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu:
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS 1999: 218-229 - 1997
- [c1]Michael Luby, Eric Vigoda:
Approximately Counting Up To Four (Extended Abstract). STOC 1997: 682-687 - 1996
- [j1]Anant P. Godbole, Sandra E. Thompson, Eric Vigoda:
General upper bounds for covering numbers. Ars Comb. 42 (1996)
Coauthor Index
[j39] [c55] [c54] [i40] [i39] [c51] [c50] [c49] [c48] [i36] [i35] [i34] [j37] [c47] [c45] [i33] [i32] [j35] [j33] [j32] [c42] [c40] [i29] [i28] [i27] [i26] [j30] [j28] [c38] [c36] [i24] [i23] [c35] [c33] [c32] [c31] [i22] [c29] [i20] [i18] [i16] [i15] [j27] [j26] [j25] [c28] [i14] [j24] [c27] [i13] [j21] [j20] [c26] [c25] [c24] [i12] [i10] [j18] [j17] [i9] [j15] [c22] [c20] [c19] [i7] [i6] [i5] [i4] [j14] [j11] [j10] [c17] [c15] [c12] [i3]
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-09-13 01:42 CEST 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:
