2008 |
31 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
Algorithmica 50(4): 418-445 (2008) |
30 | EE | 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 |
29 | EE | Daniel Stefankovic,
Santosh Vempala,
Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting.
FOCS 2007: 183-193 |
28 | EE | Thomas P. Hayes,
Juan Carlos Vera,
Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree.
STOC 2007: 450-458 |
27 | EE | Daniel Stefankovic,
Eric Vigoda:
Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions.
Journal of Computational Biology 14(2): 156-189 (2007) |
26 | EE | Ivona Bezáková,
Nayantara Bhatnagar,
Eric Vigoda:
Sampling binary contingency tables with a greedy start.
Random Struct. Algorithms 30(1-2): 168-205 (2007) |
25 | EE | Thomas P. Hayes,
Eric Vigoda:
Variable length path coupling.
Random Struct. Algorithms 31(3): 251-272 (2007) |
2006 |
24 | EE | Ivona Bezáková,
Alistair Sinclair,
Daniel Stefankovic,
Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.
ESA 2006: 136-147 |
23 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
LATIN 2006: 190-201 |
22 | EE | Ivona Bezáková,
Nayantara Bhatnagar,
Eric Vigoda:
Sampling binary contingency tables with a greedy start.
SODA 2006: 414-423 |
21 | EE | Ivona Bezáková,
Daniel Stefankovic,
Vijay V. Vazirani,
Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems.
SODA 2006: 900-907 |
20 | EE | Daniel Stefankovic,
Santosh Vempala,
Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
CoRR abs/cs/0612058: (2006) |
19 | EE | 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) |
2005 |
18 | EE | Thomas P. Hayes,
Eric Vigoda:
Coupling with the stationary distribution and improved sampling for colorings and independent sets.
SODA 2005: 971-979 |
17 | EE | Tomasz Luczak,
Eric Vigoda:
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings.
J. Discrete Algorithms 3(1): 92-100 (2005) |
2004 |
16 | EE | Martin E. Dyer,
Alan M. Frieze,
Thomas P. Hayes,
Eric Vigoda:
Randomly Coloring Constant Degree Graphs.
FOCS 2004: 582-589 |
15 | EE | Thomas P. Hayes,
Eric Vigoda:
Variable length path coupling.
SODA 2004: 103-110 |
14 | EE | Martin E. Dyer,
Alan M. Frieze,
Thomas P. Hayes,
Eric Vigoda:
Randomly coloring constant degree graphs
Electronic Colloquium on Computational Complexity (ECCC)(009): (2004) |
13 | EE | 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) |
12 | EE | 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) |
2003 |
11 | EE | Thomas P. Hayes,
Eric Vigoda:
A Non-Markovian Coupling for Randomly Sampling Colorings.
FOCS 2003: 618-627 |
2002 |
10 | EE | 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 |
9 | EE | Martin E. Dyer,
Mark Jerrum,
Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.
RANDOM 2002: 68-77 |
2001 |
8 | EE | 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 |
7 | EE | Eric Vigoda:
A Note on the Glauber Dynamics for Sampling Independent Sets.
Electr. J. Comb. 8(1): (2001) |
2000 |
6 | EE | Mark Jerrum,
Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Electronic Colloquium on Computational Complexity (ECCC) 7(79): (2000) |
1999 |
5 | EE | 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 |
4 | EE | Eric Vigoda:
Improved Bounds for Sampling Colorings.
FOCS 1999: 51-59 |
3 | | Michael Luby,
Eric Vigoda:
Fast convergence of the Glauber dynamics for sampling independent sets.
Random Struct. Algorithms 15(3-4): 229-241 (1999) |
1997 |
2 | EE | Michael Luby,
Eric Vigoda:
Approximately Counting Up To Four (Extended Abstract).
STOC 1997: 682-687 |
1996 |
1 | | Anant P. Godbole,
Sandra E. Thompson,
Eric Vigoda:
General upper bounds for covering numbers.
Ars Comb. 42: (1996) |