Random generation of combinatorial structures from a uniform
Theoretical Computer Science
How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Computing the volume is difficult
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Asymptotic theory of finite dimensional normed spaces
Asymptotic theory of finite dimensional normed spaces
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the complexity of computing the volume of a polyhedron
SIAM Journal on Computing
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
A technique for lower bounding the cover time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Counting linear extensions is #P-complete
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the number of Eularian orientations of a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient stopping rules for Markov chains
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Faster mixing via average conductance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Monte Carlo sampling plan based on product form estimation
WSC '91 Proceedings of the 23rd conference on Winter simulation
Markov chains for linear extensions, the two-dimensional case
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Method for Real-Time Scheduling Problems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Blocking Conductance and Mixing in Random Walks
Combinatorics, Probability and Computing
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Sorting and selection with random costs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A O(1/ε2)n-time sieving algorithm for approximate integer programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
Mathematical and Computer Modelling: An International Journal
Lower bounds for hit-and-run direct search
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
On the complexity of trial and error
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within K.