1. R. Bubley, M. E. Dyer, M. Jerrum: An elementary analysis of a procedure for \ sampling points in a convex body. Random Structures and Algorithms 12(3): 213-2\ 35 (1998).

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

3. 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

4. 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

5. L. Lovász and S. Vempala: The geometry of logconcave functions and an O*(n^3) sampling algorithm.

6. L. Lovász and S. Vempala: Hit-and-run is fast and fun.

7. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lov?sz and M. Simonovits: Approximation of diameters: Randomization doesn't help.

8. I. Barany and Z. Furedi: Computing the volume is difficult. Discrete and Computational Geometry, 2, 319-326, 1987.