Lecture Notes on Bucket Algorithms

Small book cover: Lecture Notes on Bucket Algorithms

Lecture Notes on Bucket Algorithms

Publisher: Birkhauser
ISBN/ASIN: 0817633286
ISBN-13: 9780817633288
Number of pages: 142

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.

Home page url

Download or read it online for free here:
Download link
(4MB, PDF)

Similar books

Book cover: AlgorithmsAlgorithms
by - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
Book cover: Randomized AlgorithmsRandomized Algorithms
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.
Book cover: Average Case Analysis of Algorithms on SequencesAverage Case Analysis of Algorithms on Sequences
by - 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.
Book cover: Introduction to Design Analysis of AlgorithmsIntroduction to Design Analysis of Algorithms
by - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.