Interruptible algorithm for perfect sampling via Markov chains

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 688-695

  Fill, James Allen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MONTE CARLO METHODS; POLYNOMIALS; PROBABILITY;

ATTRACTIVE SPIN SYSTEMS;

DATA COMMUNICATION SYSTEMS;

EID: 0030706549     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258664     Document Type: Conference Paper

References (35)