Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains

[1]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[2]  A. Sinclair.  Randomised algorithms for counting and generating combinatorial structures , 1988 .

[3]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

[4]  Nicholas C. Wormald,et al.  Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..

[5]  P. Diaconis,et al.  Strong uniform times and finite random walks , 1987 .

[6]  D. Aldous.  On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.

[7]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[8]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[9]  Jin-Yi Cai,et al.  Exact Counting is as Easy as Approximate Counting , 1986 .

[10]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

[11]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[14]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs , 1984, J. Algorithms.

[15]  J. Dodziuk.  Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .

[16]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[17]  Eric Bach,et al.  How to generate random integers with known factorization , 1983, STOC.

[18]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[19]  Herbert S. Wilf,et al.  The Random Selection of Unlabeled Graphs , 1983, J. Algorithms.

[20]  Alain Guénoche.  Random Spanning Tree , 1983, J. Algorithms.

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[23]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[24]  Herbert S. Wilf.  The Uniform Selection of Free Trees , 1981, J. Algorithms.

[25]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[26]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[27]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[28]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[29]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[32]  Claus-Peter Schnorr,et al.  Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.

[33]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[34]  R. A. Silverman,et al.  Introductory Real Analysis , 1972 .

[35]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[36]  W. Feller.  An Introduction to Probability Theory and Its Applications , 1959 .

[37]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .