1. Mark Jerrum, Alistair Sinclair, Eric Vigoda: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries.
ps

2. Ben Morris, Alistair Sinclair. Random Walks on Truncated Cubes and Sampling 0-1 knapsack solutions. Proc. of FOCS 1999.

3. Eric Vigoda, Improved Bounds for Sampling Colorings. FOCS 1999.

4. L. Lovász and P. Winkler: Efficient Stopping Rules for Markov Chains [Proc. 1995 ACM STOC, 76-82.]
ps

5. Lovasz, L. and M. Simonovits (1993). Random walks in a convex body and an improved volume algorithm. Random Structures and Algorithms 4, 359--412.

6. L. Lovász, R. Kannan and M. Simonovits: Isoperimetric problems for convex bodies and a localization lemma [Disc. Comput. Geometry 13 (1995), 541-559.]
ps

7. L. Lovász and R. Kannan: Faster mixing via average conductance [Proc. 31st Annual ACM Symp. on Theory of Computing, ACM, 1999, 282-287.]
ps