Random Walks and Convex Geometry

1. Logconcave Random Graphs (A. Frieze and J. Vera)
   Proc. of STOC 2008.
   
2. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting (D. Stefankovic and E. Vigoda)
   Proc. of the 48th IEEE Symposium on Foundations of Computer Science (FOCS '07), 2007.
   
3. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms (L. Rademacher)
   Proc. of the 47th IEEE Symposium on Foundations of Computer Science (FOCS '06), 2006.
   
4. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization (L. Lovasz)
   Proc. of the 47th IEEE Symposium on Foundations of Computer Science (FOCS '06), 2006.
   
5. Geometric Random Walks: A Survey.
   MSRI volume on Combinatorial and Computational Geometry.
   
6. Hit-and-run from a corner. (László Lovász)
   Proc. of the 36th ACM Symposium on the Theory of Computing (STOC '04), Chicago, 2004.
   SIAM J. Computing 35(4) 2006 (STOC '04 special issue).
   
7. Simulated annealing in convex bodies and an O*(n^4) volume algorithm. (László Lovász)
   Proc. of the 44th IEEE Foundations of Computer Science (FOCS '03), Boston, 2003.
   JCSS, 72(2), 2006 (FOCS '03 special issue).
   
8. Logconcave functions: Geometry and efficient sampling algorithms. (László Lovász)
   Proc. of the 44th IEEE Foundations of Computer Science (FOCS '03), Boston, 2003.
   To appear in Random Structures and Algorithms.
   
9. Simulated annealing for convex optimization . (Adam Kalai)
   To appear in Math of OR.
   
10. Solving convex programs by random walks. (Dimitris Bertsimas)
    Journal of the ACM (JACM) 51(4), 540--556, 2004.
    Proc. of the 34th ACM Symposium on the Theory of Computing (STOC '02), Montreal, 2002.
    
11. Testing geometric convexity. (Luis Rademacher)
    Proc. of the 24th FST & TCS, Chennai, 2004.
    
12. Efficient algorithms for universal portfolios. (Adam Kalai)
    J. Machine Learning Research, 3, (2002), 423--440 (invited).
    Proc. of the 41st Foundations of Computer Science (FOCS '00), Redondo Beach, 2000.
    
13. Sampling Lattice Points. (Ravi Kannan)
    Proc. 29th ACM Symposium on the Theory of Computing (STOC '97), El Paso, 1997.
    Invited for publication in Journal of Comp. and System Sciences.