An Optimal Algorithm for Monte Carlo Estimation (1995)

Cached

Download Links

by Paul Dagum , Richard Karp , Michael Luby , Sheldon Ross
Citations:53 - 4 self

Active Bibliography

234 The Markov Chain Monte Carlo method: an approach to approximate counting and integration – Mark Jerrum, Alistair Sinclair - 1996
48 Markov Chains and Polynomial time Algorithms – Ravi Kannan - 1994
2 Counting in Lattices: Combinatorial Problems from Statistical Mechanics – Dana Randall - 1994
19 Approximating the Number of Monomer-Dimer Coverings of a Lattice – Claire Kenyon, Dana Randall, Alistair Sinclair - 1996
324 A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries – Mark Jerrum, Alistair Sinclair, Eric Vigoda - 2004
7 Random walks in convex sets – Benjamin James Morris - 2000
80 A Chernoff Bound For Random Walks On Expander Graphs – David Gillman - 1998
30 Mathematical foundations of the Markov chain Monte Carlo method – Mark Jerrum - 1998
248 Random Walks on Graphs: A Survey – L. Lovász - 1993
4 Convergence Rates For Monte Carlo Experiments – Alistair Sinclair - 1997
14 Clifford algebras and approximating the permanent – Extended Abstract Steve Chien, Lars Rasmussen, Alistair Sinclair - 2002
1 Monte Carlo And Markov Chain Techniques for Network Reliability and Sampling – Adam L. Buchsbaum, Milena Mihail - 1992
25 Approximating the Permanent of Graphs with Large Factors – Paul Dagum, Michael Luby - 1992
71 The Complexity of Counting in Sparse, Regular, and Planar Graphs – Salil P. Vadhan - 1997
49 Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions – Ben Morris, Alistair Sinclair - 2002
186 Improved bounds for mixing rates of Markov chains and multicommodity flow – Alistair Sinclair - 1992
2 A Sub-Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem – Martin Dyer, Alan Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh Vazirani - 1993
multidimensional – Martin Dyer, Leeds Ls Jt, Alan Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh Vazirani - 2006
4 Exact sampling from perfect matchings of dense regular bipartite graphs – Mark Huber