\begin{thebibliography}{100}

\bibitem{broder:tree}
Andrei Broder.
\newblock Generating random spanning trees.
\newblock In {\em 30th Annual Symposium on Foundations of Computer Science},
  pages 442--447, 1989.

\bibitem{aldous:tree}
David~J. Aldous.
\newblock A random walk construction of uniform spanning trees and uniform
  labelled trees.
\newblock {\em SIAM Journal on Discrete Mathematics}, 3(4):450--465, 1990.

\bibitem{asmussen-glynn-thorisson:unknown-markov}
S{\o}ren Asmussen, Peter~W. Glynn, and Hermann Thorisson.
\newblock Stationary detection in the initial transient problem.
\newblock {\em ACM Transactions on Modeling and Computer Simulation},
  2(2):130--157, 1992.

\bibitem{aldous:unknown-markov}
David Aldous.
\newblock On simulating a {M}arkov chain stationary distribution when
  transition probabilities are unknown.
\newblock In David Aldous, Persi Diaconis, Joel Spencer, and J.~Michael Steele,
  editors, {\em Discrete Probability and Algorithms}, volume~72 of {\em IMA
  Volumes in Mathematics and its Applications}, pages 1--9. Springer-Verlag,
  1995.

\bibitem{randall-sinclair:testable}
Dana Randall and Alistair Sinclair.
\newblock Testable algorithms for self-avoiding walks.
\newblock In {\em Proceedings of the Fifth Annual ACM-SIAM Symposium on
  Discrete Algorithms}, pages 593--602, 1994.

\bibitem{lovasz-winkler:unknown-markov}
L\'aszl\'o Lov\'asz and Peter Winkler.
\newblock Exact mixing in an unknown {M}arkov chain.
\newblock {\em Electronic Journal of Combinatorics}, 2, 1995.
\newblock Paper \#R15.

\bibitem{propp-wilson:exact-sampling}
James~G. Propp and David~B. Wilson.
\newblock Exact sampling with coupled {M}arkov chains and applications to
  statistical mechanics.
\newblock {\em Random Structures and Algorithms}, 9(1\&2):223--252, 1996.

\bibitem{johnson:testing}
Valen~E. Johnson.
\newblock Studying convergence of {M}arkov chain {M}onte {C}arlo algorithms
  using coupled sample paths.
\newblock {\em Journal of the American Statistical Association},
  91(433):154--166, 1996.

\bibitem{luby-randall-sinclair:markov-lattice}
Michael Luby, Dana Randall, and Alistair Sinclair.
\newblock {M}arkov chain algorithms for planar lattice structures (extended
  abstract).
\newblock In {\em 36th Annual Symposium on Foundations of Computer Science},
  pages 150--159, 1995.

\bibitem{propp-wilson:unknown-markov-tree}
James~G. Propp and David~B. Wilson.
\newblock How to get a perfectly random sample from a generic {M}arkov chain
  and generate a random spanning tree of a directed graph.
\newblock {\em Journal of Algorithms}, 27:170--217, 1998.

\bibitem{Epp-TR-95-50}
David Eppstein.
\newblock {Representing all minimum spanning trees with applications to
  counting and generation}.
\newblock Technical Report 95-50, Univ. of California, Irvine, Dept. of
  Information {\&} Computer Science, Irvine, CA, 92697-3425, USA, 1995.

\bibitem{felsner-wernisch:linear-extension}
Stefan Felsner and Lorenz Wernisch.
\newblock Markov chains for linear extensions, the two-dimensional case.
\newblock In {\em Proceedings of the Eighth Annual ACM-SIAM Symposium on
  Discrete Algorithms}, pages 239--247, 1997.

\bibitem{kendall:area-interaction}
Wilfrid~S. Kendall.
\newblock Perfect simulation for the area-interaction point process.
\newblock In L.~Accardi and C.~C. Heyde, editors, {\em Probability Towards
  2000}, pages 218--234. Springer, 1998.

\bibitem{kendall:boolean}
Wilfrid~S. Kendall.
\newblock On some weighted {B}oolean models.
\newblock In D.~Jeulin, editor, {\em Advances in Theory and Applications of
  Random Sets}, pages 105--120. World Scientific Publishing Company, 1997.

\bibitem{fill:interruptible-stoc}
James~Allen Fill.
\newblock An interruptible algorithm for perfect sampling via {M}arkov chains.
\newblock In {\em Proceedings of the Twenty-Ninth Annual ACM Symposium on
  Theory of Computing}, pages 688--695, 1997.
\newblock To appear in {\em The Annals of Applied Probability}.

\bibitem{fill:interruptible}
James~Allen Fill.
\newblock An interruptible algorithm for perfect sampling via {M}arkov chains.
\newblock {\em The Annals of Applied Probability}, 8(1):131--162, 1998.

\bibitem{glynn-heidelberger:budget}
Peter~W. Glynn and Philip Heidelberger.
\newblock Bias properties of budget constrained simulations.
\newblock {\em Operations Research}, 38(5):801--814, 1990.

\bibitem{fill:move-to-front-tr}
James~Allen Fill.
\newblock The move-to-front rule: A case study for two exact sampling
  algorithms.
\newblock Technical Report 566, Department of Mathematical Sciences, The Johns
  Hopkins University, 1996.
\newblock To appear in {\em Probability in the Engineering and Informational
  Sciences\/} in 1998 (issue 3).

\bibitem{fill:move-to-front}
James~Allen Fill.
\newblock The move-to-front rule: A case study for two exact sampling
  algorithms.
\newblock {\em Probability in the Engineering and Informational Sciences},
  12:283--302, 1998.

\bibitem{haggstrom-lieshout-moller:exact-spatial-tr}
O.~{H\"aggstr\"om}, M.~N.~M. van Lieshout, and J.~M{\o}ller.
\newblock Characterisation results and {M}arkov chain {M}onte {C}arlo
  algorithms including exact simulation for some spatial point processes.
\newblock Technical Report R-96-2040, Aalborg University, 1996.
\newblock To appear in {\em Bernoulli}.

\bibitem{haggstrom-lieshout-moller:exact-spatial}
O.~{H\"aggstr\"om}, M.~N.~M. van Lieshout, and J.~M{\o}ller.
\newblock Characterisation results and {M}arkov chain {M}onte {C}arlo
  algorithms including exact simulation for some spatial point processes.
\newblock {\em Bernoulli}, 5(4):641--658, 1999.

\bibitem{moller:point-process}
Jesper M{\o}ller.
\newblock Markov chain {M}onte {C}arlo and spatial point processes.
\newblock In W.~S. Kendall, O.~E. Barndorff-Nielsen, and M.~N.~M. van Lieshout,
  editors, {\em Stochastic Geometry: Likelihood and Computation}, Monographs on
  Statistics and Applied Probability \#80, pages 141--172. Chapman and Hall /
  CRC Press, 1998.

\bibitem{propp:expository}
James Propp.
\newblock Generating random elements of a finite distributive lattice.
\newblock {\em Electronic Journal of Combinatorics}, 4(2), 1997.
\newblock Paper \#R15. arXiv:math.CO/9801066.

\bibitem{haggstrom-nelander:antimonotone}
Olle {H\"aggstr\"om} and Karin Nelander.
\newblock Exact sampling from anti-monotone systems.
\newblock {\em Statistica Neerlandica}, 52:360--380, 1998.

\bibitem{luby-vigoda:independent}
Michael Luby and Eric Vigoda.
\newblock Approximately counting up to four (extended abstract).
\newblock In {\em Proceedings of the Twenty-Ninth Annual ACM Symposium on
  Theory of Computing}, pages 682--687, 1997.

\bibitem{murdoch-green:continuous}
D.~J. Murdoch and P.~J. Green.
\newblock Exact sampling from a continuous state space.
\newblock {\em Scandinavian Journal of Statistics}, 25(3):483--502, 1998.

\bibitem{kendall-moller:exact-spatial}
Wilfrid~S. Kendall and Jesper M{\o}ller.
\newblock Perfect simulation using dominating processes on ordered spaces, with
  application to locally stable point processes.
\newblock {\em Advances in Applied Probability}, 32(3):844--865, 2000.

\bibitem{cai:metropolis}
Haiyan Cai.
\newblock A note on an exact sampling algorithm and {M}etropolis {M}arkov
  chains.
\newblock Technical report, University of Missouri, St. Louis, 1997.

\bibitem{foss-tweedie:srs-cftp}
S.~G. Foss and R.~L. Tweedie.
\newblock Perfect simulation and backward coupling.
\newblock {\em Stochastic Models}, 14(1-2):187--203, 1998.

\bibitem{lund-wilson:storage}
Robert~B. Lund and David~B. Wilson.
\newblock Exact sampling algorithms for storage systems, 1997.
\newblock Manuscript.

\bibitem{moller:conditional}
Jesper M{\o}ller.
\newblock Perfect simulation of conditionally specified models.
\newblock {\em Journal of the Royal Statistical Society {\rm B}},
  61(1):251--264, 1999.

\bibitem{kendall:spatial}
W.~S. Kendall.
\newblock Perfect simulation for spatial point processes.
\newblock In {\em Bulletin of the International Statistical Institute
  $51^{\hbox{st}}$ Session, Istanbul (August 1997)}, volume~3, pages 163--166,
  1997.

\bibitem{foss-tweedie-corcoran:regeneration}
S.~G. Foss, R.~L. Tweedie, and J.~N. Corcoran.
\newblock Simulating the invariant measures of {M}arkov chains using backward
  coupling at regeneration times.
\newblock {\em Probability in the Engineering and Informational Sciences},
  12:303--320, 1998.

\bibitem{thonnes:points}
Elke {Th\"onnes}.
\newblock Perfect simulation of some point processes for the impatient user.
\newblock {\em Advances in Applied Probability, Stochastic Geometry and
  Statistical Applications}, 31(1):69--87, 1999.

\bibitem{propp-wilson:cftp-aug}
James Propp and David Wilson.
\newblock Coupling from the past: a user's guide.
\newblock In D.~Aldous and J.~Propp, editors, {\em Microsurveys in Discrete
  Probability}, volume~41 of {\em DIMACS Series in Discrete Mathematics and
  Theoretical Computer Science}, pages 181--192. American Mathematical Society,
  1998.

\bibitem{haggstrom-nelander:random-fields}
Olle {H\"aggstr\"om} and Karin Nelander.
\newblock On exact simulation of {M}arkov random fields using coupling from the
  past.
\newblock {\em Scandinavian Journal of Statistics}, 26(3):395--411, 1999.

\bibitem{berg-steif:codings}
J.~van~den Berg and J.~E. Steif.
\newblock On the existence and nonexistence of finitary codings for a class of
  random fields.
\newblock {\em The Annals of Probability}, 27(3):1501--1522, 1999.

\bibitem{corcoran-tweedie:perfect-harris}
J.~N. Corcoran and R.~L. Tweedie.
\newblock Perfect sampling of ergodic {H}arris chains.
\newblock {\em Annals of Applied Probability}, 11(2):438--451, 2001.

\bibitem{exact-bibliography}
David~B. Wilson.
\newblock Annotated bibliography of perfectly random sampling with \char77arkov
  chains.
\newblock In D.~Aldous and J.~Propp, editors, {\em Microsurveys in Discrete
  Probability}, volume~41 of {\em DIMACS Series in Discrete Mathematics and
  Theoretical Computer Science}, pages 209--220. American Mathematical Society,
  1998.
\newblock Updated versions to appear at {\tt
  http://dimacs.rutgers.edu/\char126dbwilson/exact}.

\bibitem{fismen:exact}
Morten Fismen.
\newblock Exact simulation using {M}arkov chains.
\newblock Technical Report 6/98, Institutt for Matematiske Fag, 1998.
\newblock Diploma-thesis.

\bibitem{green-murdoch:bayesian}
Peter~J. Green and Duncan~J. Murdoch.
\newblock Exact sampling for {B}ayesian inference: towards general purpose
  algorithms (with discussion).
\newblock In J.~M. Bernardo, J.~O. Berger, A.~P. Dawid, and A.~F.~M. Smith,
  editors, {\em Bayesian Statistics 6}, pages 301--321. Oxford University
  Press, 1999.
\newblock Presented as an invited paper at the 6th Valencia International
  Meeting on Bayesian Statistics, Alcossebre, Spain, June 1998.

\bibitem{kendall-thonnes:geometry}
W.~S. Kendall and Elke {Th\"onnes}.
\newblock Perfect simulation in stochastic geometry.
\newblock {\em Pattern Recognition}, 32(9):1569--1586, 1999.
\newblock Special issue on random sets.

\bibitem{corcoran-tweedie:perfect-independent}
J.~N. Corcoran and R.~L. Tweedie.
\newblock Perfect sampling from independent {M}etropolis-{H}astings chains.
\newblock {\em Journal of Statistical Planning and Inference}, 104(2):297--314,
  2002.

\bibitem{diaconis-freedman:rfuncs-tr}
Persi Diaconis and David Freedman.
\newblock Iterated random functions.
\newblock Technical Report 511, Department of Statistics, University of
  California at Berkeley, 1998.

\bibitem{diaconis-freedman:rfuncs}
Persi Diaconis and David Freedman.
\newblock Iterated random functions.
\newblock {\em SIAM Review}, 41(1):45--76, 1999.

\bibitem{editors:diaconis-freedman}
The Editors.
\newblock Graphical illustration of some examples related to the article
  ``{I}terated random functions'' by {D}iaconis and {F}reedman.
\newblock {\em SIAM Review}, 41(1):77--82, 1999.

\bibitem{moller-schladitz:fill}
Jesper M{\o}ller and Katja Schladitz.
\newblock Extensions of {F}ill's algorithm for perfect simulation.
\newblock {\em Journal of the Royal Statistical Society {\rm B}},
  61(4):955--969, 1999.

\bibitem{huber:techniques}
Mark Huber.
\newblock Exact sampling and approximate counting techniques.
\newblock In {\em Proceedings of the 30th Annual ACM Symposium on the Theory of
  Computing}, pages 31--40, 1998.

\bibitem{nelander:beach}
Karin Nelander.
\newblock A {M}arkov chain {M}onte {C}arlo study of the beach model.
\newblock {\em Markov Processes and Related Fields}, 5(3):345--369, 2000.

\bibitem{burdzy-kendall:couplings}
Krzysztof Burdzy and Wilfrid~S. Kendall.
\newblock Efficient {M}arkovian couplings: examples and counterexamples.
\newblock {\em The Annals of Applied Probability}, 10(2):362--409, 2000.

\bibitem{huber:swendsen-wang}
Mark Huber.
\newblock A bounding chain for {Swendsen-Wang}.
\newblock {\em Random Structure and Algorithms}, 22(1):43--59, 2003.

\bibitem{murdoch-rosenthal:efficient}
Duncan~J. Murdoch and Jeffrey~S. Rosenthal.
\newblock Efficient use of exact samples.
\newblock {\em Statistics and Computing}, 10(3):237--243, 2000.

\bibitem{fill-machida-murdoch-rosenthal:fill-xabs}
James~Allen Fill, Motoya Machida, Duncan~J. Murdoch, and Jeffrey~S. Rosenthal.
\newblock Extension of {F}ill's perfect rejection sampling algorithm to general
  chains (extended abstract).
\newblock In Neil Madras, editor, {\em Monte Carlo Methods}, volume~26 of {\em
  Fields Institute Communications}, pages 37--52. American Mathematical
  Society, 2000.

\bibitem{fill-machida-murdoch-rosenthal:fill}
James~Allen Fill, Motoya Machida, Duncan~J. Murdoch, and Jeffrey~S. Rosenthal.
\newblock Extension of {F}ill's perfect rejection sampling algorithm to general
  chains.
\newblock {\em Random Structures \& Algorithms}, 17(3\&4):290--316, 2000.

\bibitem{haggstrom-steif:finitary}
Olle {H\"aggstr\"om} and Jeffrey~E. Steif.
\newblock {P}ropp-{W}ilson algorithms and finitary codings for high noise
  {M}arkov random fields.
\newblock {\em Combinatorics, Probability and Computing}, 9(5):425--439, 2000.

\bibitem{hobert-robert-titterington:mixtures}
James~P. Hobert, Christian~P. Robert, and D.~M. Titterington.
\newblock On perfect simulation for some mixtures of distributions.
\newblock {\em Statistics and Computing}, 9(4):287--298, 1999.

\bibitem{holmes-mallick:orthogonal}
C.~C. Holmes and B.~K. Mallick.
\newblock Perfect simulation for orthogonal model mixing, 1998.
\newblock Preprint.

\bibitem{mira-moller-roberts:slice}
A.~Mira, J.~M{\o}ller, and G.~O. Roberts.
\newblock Perfect slice samplers, 2001.

\bibitem{mcmc-convergence}
Christian~P. Robert, editor.
\newblock {\em Discretization and MCMC Convergence Assessment}.
\newblock Lecture Notes in Statistics \# 135. Springer, 1998.

\bibitem{muri-chauveau-cellier:dna}
Florence Muri, Didier Chauveau, and Dominique Cellier.
\newblock Convergence assessment in latent variable models: {DNA} applications.
\newblock In Christian~P. Robert, editor, {\em Discretization and MCMC
  Convergence Assessment}, Lecture Notes in Statistics \# 135, pages 127--146.
  Springer, 1998.

\bibitem{fill-machida:monotonicity}
James~A. Fill and Motoya Machida.
\newblock Stochastic monotonicity and realizable monotonicity.
\newblock Technical Report 573, Department of Mathematical Sciences, The Johns
  Hopkins University, 1998.

\bibitem{huber:independent}
Mark Huber.
\newblock Exact random sampling from independent sets, 1998.
\newblock Preprint.

\bibitem{huber:fill}
Mark Huber.
\newblock Interruptible exact sampling and construction of strong stationary
  times for {M}arkov chains, 1998.
\newblock Preprint.

\bibitem{roehrl:parallel-cftp}
Armin S.~A. {R\"ohrl}.
\newblock Fast, portable, parallel and scalable exact simulation using {M}arkov
  chains, 1999.
\newblock Preprint.

\bibitem{kendall-moller:exact-spatial-implementation}
Wilfrid~S. Kendall and Jesper M{\o}ller.
\newblock Perfect implementation of a {M}etropolis-{H}astings simulation of
  {M}arkov point processes, 1999.
\newblock Preprint.

\bibitem{machida:monotonicity}
Motoya Machida.
\newblock {\em Stochastic Monotonicity and Realizable Monotonicity}.
\newblock PhD thesis, The Johns Hopkins University, Department of Mathematical
  Sciences, 1999.

\bibitem{moller-nicholls:perfect-tempering}
Jesper M{\o}ller and G.~K. Nicholls.
\newblock Perfect simulation for sample-based inference, 1999.
\newblock \textit{Statistics and Computing,} to appear.

\bibitem{huber:swap}
Mark Huber.
\newblock The swap move: a tool for building faster {M}arkov chains, 1999.
\newblock Preprint.

\bibitem{huber:fill-2}
Mark Huber.
\newblock Perfect sampling without a lifetime commitment, 1999.
\newblock Preprint.

\bibitem{wilson:rocftp}
David~B. Wilson.
\newblock How to couple from the past using a read-once source of randomness.
\newblock {\em Random Structures and Algorithms}, 16(1):85--113, 2000.
\newblock arXiv:math.PR/9910050.

\bibitem{meng:multistage-backwards}
Xiao-Li Meng.
\newblock Towards a more general {Propp-Wilson} algorithm: Multistage backward
  coupling.
\newblock In Neil Madras, editor, {\em Monte Carlo Methods}, volume~26 of {\em
  Fields Institute Communications}. American Mathematical Society, 2000.
\newblock To appear.

\bibitem{casella-mengersen-robert-titterington:perfect-mixture}
G.~Casella, K.~L. Mengersen, C.~P. Robert, and D.~M. Titterington.
\newblock Perfect slice samplers for mixtures of distributions.
\newblock {\em Journal of the Royal Statistical Society {\rm B}},
  64(4):777--790, 2002.

\bibitem{georgii:continuum-ising}
Hans-Otto Georgii.
\newblock Phase transition and percolation in {G}ibbsian particle models, 1999.
\newblock arXiv:math.PR/9910005.

\bibitem{murdoch:exact-bayesian}
D.~J. Murdoch.
\newblock Exact sampling for {B}ayesian inference: Unbounded state spaces.
\newblock In Neil Madras, editor, {\em Monte Carlo Methods}, volume~26 of {\em
  Fields Institute Communications}. American Mathematical Society, 2000.
\newblock To appear.

\bibitem{wilson:multishift}
David~B. Wilson.
\newblock Layered multishift coupling for use in perfect sampling algorithms
  (with a primer on {CFTP}).
\newblock In Neil Madras, editor, {\em Monte Carlo Methods}, volume~26 of {\em
  Fields Institute Communications}, pages 141--176. American Mathematical
  Society, 2000.
\newblock arXiv:math.PR/9912225.

\bibitem{cai:exact-auxillary}
Haiyan Cai.
\newblock Exact sampling using auxiliary variables, 1999.
\newblock To Appear in the Statistical Computation Section of the ASA
  Proceedings.

\bibitem{guglielmi-holmes-walker:continuous-unbounded}
Alessandra Guglielmi, Chris~C. Holmes, and Stephen~G. Walker.
\newblock Perfect simulation involving functionals of a {Dirichlet} process.
\newblock {\em Journal of Computational and Graphical Statistics},
  11(2):306--310, 2002.

\bibitem{dimakos:guide-exact}
Xeni~K. Dimakos.
\newblock A guide to exact simulation.
\newblock {\em International Statistical Review}, 69(1):27--48, 2001.

\bibitem{novotny:intro-exact}
M.~A. Novotny.
\newblock Introduction to the {Propp-Wilson} method of exact sampling for the
  {Ising} model.
\newblock In D.~P. Landau, S.~P. Lewis, and H.-B. {Sch\"uttler}, editors, {\em
  Computer Simulation Studies in Condensed Matter Physics XII}, volume~85 of
  {\em Springer Proceedings in Physics}, pages 179--184. Springer Verlag, 2000.
\newblock arXiv:cond-mat/9905195.

\bibitem{thonnes:primer}
Elke {Th\"onnes}.
\newblock A primer on perfect simulation.
\newblock In {\em Statistical Physics and Spatial Statistic}, Springer Lecture
  Notes in Physics \#554, pages 349--378. Springer Verlag, 2000.

\bibitem{harvey:thesis}
Michael Harvey.
\newblock {Monte Carlo} inference for belief networks using coupling from the
  past, 1999.
\newblock Master's thesis, department of computer science, University of
  Toronto.

\bibitem{sorensen:thesis}
Tine~M{\o}ller S{\o}rensen.
\newblock A study of {Propp \& Wilson's} method for exact {Markov chain Monte
  Carlo} sampling, 1997.
\newblock Master's thesis in computational statistics, University of Bath.

\bibitem{fernandez-ferrari-garcia:perfect}
Roberto Fern\'andez, Pablo~A. Ferrari, and Nancy~L. Garcia.
\newblock Perfect simulation for interacting point processes, loss networks and
  {Ising} models, 1999.
\newblock arXiv:math.PR/9911162.

\bibitem{straatman:thesis}
Bas Straatman.
\newblock Exact sampling and applications to a mite dispersal model, 1998.
\newblock Master's thesis, Utrecht.

\bibitem{lund-thonnes:point-process}
Jens Lund and Elke {Th\"onnes}.
\newblock Perfect simulation and inference for point processes given noisy
  observations.
\newblock {\em Computational Statistics}, 19(2):317--336, 2004.

\bibitem{lund:thesis}
Jens Lund.
\newblock {\em Statistical inference and perfect simulation for point processes
  observed with noise}.
\newblock PhD thesis, The Royal Veterinary and Agricultural University,
  Copenhagen, Department of Statistics, 1999.

\bibitem{gibbs:mixing-time}
Alison Gibbs.
\newblock Bounding the convergence time of the {Gibbs} sampler in {Bayesian}
  image restoration, 2000.

\bibitem{gibbs:thesis}
Alison Gibbs.
\newblock {\em Convergence of {Markov} Chain {Monte} {Carlo} Algorithms with
  Applications to Image Restoration}.
\newblock PhD thesis, University of Toronto, Department of Statistics, 1999.

\bibitem{fearnhead:genetic}
Paul Fearnhead.
\newblock Perfect simulation from population genetic models with selection.
\newblock {\em Theoretical Population Biology}, 59:263--279, 2001.

\bibitem{moller:thesis}
Jesper M{\o}ller.
\newblock Aspects of spatial statistics, stochastic geometry and {Markov} chain
  {Monte Carlo} methods, 1999.
\newblock Thesis for doctoral degree in Natural Sciences, Aalborg University.

\bibitem{zhu-mumford:vision}
Song~Chun Zhu and David Mumford.
\newblock Learning generic prior models for visual computation, 1997.
\newblock To appear in \textit{IEEE Transactions on Pattern Analysis and
  Machine Intelligence}.

\bibitem{childs-patterson-mackay:summary-states}
Andrew~M. Childs, Ryan~B. Patterson, and David J.~C. MacKay.
\newblock Exact sampling from non-attractive distributions using summary
  states.
\newblock {\em Physical Review E}, 63:036113, 2001.
\newblock arXiv:cond-mat/0005132.

\bibitem{devroye-fill-neininger:quicksort}
Luc Devroye, James~A. Fill, and Ralph Neininger.
\newblock Perfect simulation from the quicksort limit distribution, 2000.
\newblock Preprint.

\bibitem{casella-lavine-robert:explain-perfect}
George Casella, Michael Lavine, and Christian Robert.
\newblock Explaining the perfect sampler, 2001.

\bibitem{haggstrom:course}
Olle {H\"aggstr\"om}.
\newblock {\em Finite {M}arkov Chains and Algorithmic Applications}.
\newblock Cambridge University Press, 2002.
\newblock Based on lecture notes.

\bibitem{van-zwet:stochastic-em}
Erik van Zwet.
\newblock Perfect stochastic {EM}.
\newblock In M.~C.~M. de~Gunst, C.~A.~J. Klaassen, and A.~W. van~der Vaart,
  editors, {\em State of the Art in Probability and Statistics}, IMS Lecture
  Notes \#36, pages 607--616, 2001.

\bibitem{cooper-tweedie:perfect-inventory}
W.~L. Cooper and R.~L. Tweedie.
\newblock Perfect simulation of an inventory model for perishable products.
\newblock {\em Stochastic Models}, 18(2):229--243, 2002.

\bibitem{moller:review}
Jesper M{\o}ller.
\newblock A review of perfect simulation in stochastic geometry.
\newblock In I.V. Basawa, C.C. Heyde, and R.L. Taylor, editors, {\em Selected
  Proceedings of the Symposium on Inference for Stochastic Processes},
  volume~37 of {\em IMS Lecture Notes \& Monographs Series}, pages 333--355,
  2001.

\bibitem{comets-fernandez-ferrari:perfect}
Francis Comets, Roberto Fern\'andez, and Pablo~A. Ferrari.
\newblock Processes with long memory: Regenerative construction and perfect
  simulation, 2000.
\newblock arXiv:math.PR/0009204.

\bibitem{huber-fill:randomness-recycler}
James~A. Fill and Mark Huber.
\newblock The randomness recycler: A new technique for perfect sampling.
\newblock In {\em 41st Annual Symposium on Foundations of Computer Science},
  pages 503--511, 2000.
\newblock arXiv:math.PR/0009242.

\bibitem{fill-machida:inverse-pr-trans}
James~A. Fill and Motoya Machida.
\newblock Realizable monotonicity and inverse probability transform, 2000.
\newblock arXiv:math.PR/0010026.

\bibitem{loizeaux-mckeague:spatial}
Marc~A. Loizeaux and Ian~W. McKeague.
\newblock Bayesian inference for spatial point processes via perfect sampling,
  2000.
\newblock Preprint.

\bibitem{lieshout-zwet:bombing}
M.~N.~M. van Lieshout and E.~W. van Zwet.
\newblock Maximum likelihood estimation for the bombing model, 2000.
\newblock Preprint.

\bibitem{hobert-robert:moralizing}
James~P. Hobert and Christian~P. Robert.
\newblock Moralizing perfect sampling, 2000.
\newblock Preprint.

\bibitem{schneider:sampling}
Michael~K. Schneider.
\newblock Exact and approximate sampling from the stationary distribution of a
  markov chain, 1998.
\newblock Area exam report.

\bibitem{athreya-stenflo:doeblin}
Krishna~B. Athreya and {\"O}rjan Stenflo.
\newblock Perfect sampling for {Doeblin} chains.
\newblock {\em Sankhya -- The Indian Journal of Statistics}, 65(4), 2003.

\bibitem{linde-moore-nordahl:rhombus}
Joakim Linde, Cristopher Moore, and Mats~G. Nordahl.
\newblock An $n$-dimensional generalization of the rhombus tiling, 2001.
\newblock Preprint.

\bibitem{berthelsen-moller:jump}
Kasper~K. Berthelsen and Jesper M{\o}ller.
\newblock Spatial jump processes and perfect simulation, 2001.
\newblock Preprint.

\bibitem{moller-waagepetersen:spatial}
Jesper M{\o}ller and Rasmus~P. Waagepetersen.
\newblock Simulation-based inference for spatial point processes, 2001.
\newblock Preprint.

\bibitem{berthelsen-moller:primer}
Kasper~K. Berthelsen and Jesper M{\o}ller.
\newblock A primer on perfect simulation for spatial point processes, 2001.
\newblock Preprint.

\bibitem{besag:endives}
Julian Besag.
\newblock Likelihood analysis of binary data in space and time, 2001.
\newblock Manuscript.

\bibitem{wilson:nlm}
David~B. Wilson.
\newblock Mixing times of lozenge tiling and card shuffling {Markov} chains,
  2001.
\newblock arXiv:math.PR/0102193.

\bibitem{berthelsen-moller:perfect-spatial}
Kasper~K. Berthelsen and Jesper M{\o}ller.
\newblock Perfect simulation and inference for spatial point processes, 2002.
\newblock Manuscript.

\bibitem{murdoch-meng:mixture}
Duncan~J. Murdoch and Xiao-Li Meng.
\newblock Towards perfect sampling for {Bayesian} mixture priors.
\newblock In {\em Bayesian Methods with Applications to Science, Policy, and
  Official Statistics. Selected papers from ISBA 2000: the sixth world meeting
  of the International Society for Bayesian Analysis.}, pages 381--390, 2001.

\bibitem{craiu-meng:antithetic}
Radu~V. Craiu and Xiao-Li Meng.
\newblock Antithetic coupling for perfect sampling.
\newblock In {\em Bayesian Methods with Applications to Science, Policy, and
  Official Statistics. Selected papers from ISBA 2000: the sixth world meeting
  of the International Society for Bayesian Analysis.}, pages 99--108, 2001.

\bibitem{garcia:spatial}
Nancy~L. Garcia.
\newblock Perfect simulation of spatial processes.
\newblock {\em Resenhas - IME-USP}, 4(3):281--324, 2000.

\bibitem{cho-goel:scheduling}
Sung-Woo Cho and Ashish Goel.
\newblock Exact sampling in machine scheduling problems.
\newblock In Michel~X. Goemans, Klaus Jansen, Jos\'e D.~P. Rolim, and Luca
  Trevisan, editors, {\em Approximation Randomization and Combinatorial
  Optimization: Algorithms and Techniques}, volume 2129 of {\em Lecture Notes
  in Computer Science}, pages 202--210, 2001.

\bibitem{goel-mitzenmacher:tcp}
Ashish Goel and Michael Mitzenmacher.
\newblock Exact sampling of {TCP} window states, 2002.
\newblock To appear in IEEE Infocom.

\bibitem{crank-fill:interruptible}
Keith Crank and James~A. Fill.
\newblock Interruptible exact sampling in the passive case, 2002.
\newblock arXiv:math.PR/0202136.

\bibitem{dobrow-fill:fmmr}
Robert~P. Dobrow and James~A. Fill.
\newblock Speeding up the {FMMR} perfect sampling algorithm: {A} case study
  revisited.
\newblock {\em Random Structures and Algorithms}, 23(4):434--452, 2003.
\newblock arXiv:math.PR/0205120.

\bibitem{philippe-robert:gauss}
Anne Philippe and Christian~P. Robert.
\newblock Perfect simulation of positive {Gaussian} distributions.
\newblock {\em Statistics and Computing}, 13(2):179--186, 2003.

\bibitem{roberts-rosenthal:identities}
Gareth~O. Roberts and Jeffrey~S. Rosenthal.
\newblock Combinatorial identities associated with {CFTP}, 2002.

\bibitem{breyer-roberts:fields}
L.~A. Breyer and G.~O. Roberts.
\newblock A new method for coupling random fields.
\newblock {\em LMS Journal of Computation and Mathematics}, 5:77--94, 2002.

\bibitem{breyer-roberts:catalytic}
L.~A. Breyer and G.~O. Roberts.
\newblock Catalytic perfect simulation.
\newblock {\em Methodology and Computing in Applied Probability},
  3(2):161--177, 2001.

\bibitem{mackay}
David J.~C. MacKay.
\newblock {\em Information Theory, Inference, and Learning Algorithms}.
\newblock Cambridge University Press, 2003.

\bibitem{ambler:thesis}
Graeme~K. Ambler.
\newblock {\em Dominated Coupling From The Past and Some Extensions of the
  Area-Interaction Process}.
\newblock PhD thesis, University of Bristol, Department of Mathematics, 2002.

\bibitem{sokal:monte-carlo}
Alan~D. Sokal.
\newblock {M}onte {C}arlo methods in statistical mechanics: Foundations and new
  algorithms, 1989.
\newblock Lecture notes from Cours de Troisi\`eme Cycle de la Physique en
  Suisse Romande. Updated in 1996 for the Carg\`ese Summer School on
  ``Functional Integration: Basics and Applications''.

\bibitem{diaconis-saloff-coste:metropolis}
Persi Diaconis and Laurent Saloff-Coste.
\newblock What do we know about the {M}etropolis algorithm?
\newblock In {\em Proceedings of the Twenty-Seventh Annual ACM Symposium on
  Theory of Computing}, pages 112--129, 1995.

\bibitem{jerrum-sinclair:survey}
Mark Jerrum and Alistair Sinclair.
\newblock The {M}arkov chain {M}onte {C}arlo method: an approach to approximate
  counting and integration.
\newblock In D.~S. Hochbaum, editor, {\em Approximation Algorithms for
  {NP}-hard Problems}. PWS Publishing, 1996.

\bibitem{aldous-diaconis:shuffling}
David Aldous and Persi Diaconis.
\newblock Shuffling cards and stopping times.
\newblock {\em American Mathematical Monthly}, 93(5):333--348, 1986.

\bibitem{diaconis-fill:stationary}
Persi Diaconis and James~A. Fill.
\newblock Strong stationary times via a new form of duality.
\newblock {\em The Annals of Probability}, 18:1483--1522, 1990.

\bibitem{letac:contraction}
G\'erard Letac.
\newblock A contraction principle for certain {M}arkov chains and its
  applications.
\newblock In {\em Random Matrices and Their Applications}, volume~50 of {\em
  Contemporary Mathematics}, pages 263--273. American Mathematical Society,
  1986.

\bibitem{thorisson:backwards}
Herman Thorisson.
\newblock Backward limits.
\newblock {\em The Annals of Probability}, 16(2):914--924, 1988.

\bibitem{borovkov-foss:srs}
A.~A. Borovkov and S.~G. Foss.
\newblock Stochastically recursive sequences and their generalizations.
\newblock {\em Siberian Advances in Mathematics}, 2(1):16--81, 1992.
\newblock Translated from PRIM.

\bibitem{aldous-fill:book}
David~J. Aldous and James~A. Fill.
\newblock {\em {Reversible {M}arkov Chains and Random Walks on Graphs}}.
\newblock Book in preparation,
  \texttt{http://www.stat.berkeley.edu/\char126aldous/book.html}, 200X.

\end{thebibliography}