An interruptible algorithm for perfect sampling via Markov chains

  • Authors:
  • James Allen Fill

  • Affiliations:
  • Johns Hopkins University, Baltimore, MD

  • Venue:
  • STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract