Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. Rademacher, L. & Vempala, S. Electronic Colloquium on Computational Complexity (ECCC), 2006.
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms [link]Paper  bibtex   
@article{DBLP:journals/eccc/RademacherV06,
  author    = {Luis Rademacher and
               Santosh Vempala},
  title     = {Dispersion of Mass and the Complexity of Randomized Geometric Algorithms},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {102},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-102/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/RademacherV06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0