Lecture Notes on Bucket Algorithms
by Luc Devroye
Publisher: Birkhauser 1986
ISBN/ASIN: 0817633286
ISBN-13: 9780817633288
Number of pages: 142
Description:
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems, as well as on a variety of problems in computational geometry and operations research.
Download or read it online for free here:
Download link
(4MB, PDF)
Similar books
Algorithms and Data Structures: With Applications to Graphics and Geometryby Jurg Nievergelt, Klaus Hinrichs - Prentice Hall
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.
(11542 views)
Average Case Analysis of Algorithms on Sequencesby Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(14524 views)
Algorithms for Clustering Databy Anil K. Jain, Richard C. Dubes - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(23696 views)
Randomized Algorithmsby Wolfgang Merkle - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(13800 views)