We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other important illustrations of randomized algo rithms in other areas of the… Expand

This paper examines the problem of sampling (almost) uniformly from the set of linear extensions of a partial order, a classic problem in the theory of approximate sampling, using a slightly different Markov chain.Expand

In this paper we illustrate new techniques for bounding the mixing rates of certain Markov chains. Whereas previous techniques have required extensive insight into the combinatorics of the problem in… Expand

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability.Expand

We consider random walks on graph colourings of an nvertex graph and disprove the conjecture that k 2 2A was a natural barrier to the mixing of colourings.Expand

In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling almost uniformly at random from a convex body in high dimension.Expand

In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches… Expand