The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eric Vigoda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:136-147 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:218-229 [Conf]
  3. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly Coloring Constant Degree Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:582-589 [Conf]
  4. Thomas P. Hayes, Eric Vigoda
    A Non-Markovian Coupling for Randomly Sampling Colorings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:618-627 [Conf]
  5. Eric Vigoda
    Improved Bounds for Sampling Colorings. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:51-59 [Conf]
  6. Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
    Random Bichromatic Matchings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:190-201 [Conf]
  7. Martin E. Dyer, Mark Jerrum, Eric Vigoda
    Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:68-77 [Conf]
  8. Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
    Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:149-163 [Conf]
  9. Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda
    Sampling binary contingency tables with a greedy start. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:414-423 [Conf]
  10. Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
    Accelerating simulated annealing for the permanent and combinatorial counting problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:900-907 [Conf]
  11. Thomas P. Hayes, Eric Vigoda
    Variable length path coupling. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:103-110 [Conf]
  12. Thomas P. Hayes, Eric Vigoda
    Coupling with the stationary distribution and improved sampling for colorings and independent sets. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:971-979 [Conf]
  13. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:712-721 [Conf]
  14. Michael Luby, Eric Vigoda
    Approximately Counting Up To Four (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:682-687 [Conf]
  15. Anant P. Godbole, Sandra E. Thompson, Eric Vigoda
    General upper bounds for covering numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  16. Eric Vigoda
    A Note on the Glauber Dynamics for Sampling Independent Sets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  17. Mark Jerrum, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:79, pp:- [Journal]
  18. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly coloring constant degree graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:009, pp:- [Journal]
  19. Mark Jerrum, Alistair Sinclair, Eric Vigoda
    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:671-697 [Journal]
  20. Tomasz Luczak, Eric Vigoda
    Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:92-100 [Journal]
  21. Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
    Randomly coloring sparse random graphs with fewer colors than the maximum degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:450-465 [Journal]
  22. Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
    Mixing in time and space for lattice spin systems: A combinatorial view. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:4, pp:461-479 [Journal]
  23. Michael Luby, Eric Vigoda
    Fast convergence of the Glauber dynamics for sampling independent sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:229-241 [Journal]
  24. Thomas P. Hayes, Juan C. Vera, Eric Vigoda
    Randomly coloring planar graphs with fewer colors than the maximum degree. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:450-458 [Conf]
  25. Daniel Stefankovic, Santosh Vempala, Eric Vigoda
    Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  26. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. [Citation Graph (, )][DBLP]


  27. Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. [Citation Graph (, )][DBLP]


  28. Random Bichromatic Matchings. [Citation Graph (, )][DBLP]


  29. Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species [Citation Graph (, )][DBLP]


  30. Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees [Citation Graph (, )][DBLP]


  31. A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002