The use of statistical methods In the design and analysis of discrete algorithms is explored. Among the design tools are randomization, ranking, sampling and subsampling, density estimation, and "cell" or "bucket" techniques. The analysis techniques include those based on the design methods as well as the use of stochastic convergence concepts and order statistics.

Скачать книгу бесплатно (djvu, 1.57 Mb)

---

Читать «Statistical methods in algorithm design and analysis (thesis)»