**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

**Efficient Algorithms for Sorting and Synchronization**

by

**Andrew Tridgell**-

**samba.org**

This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.

(

**13577**views)

**A=B**

by

**Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger**-

**AK Peters, Ltd.**

The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.

(

**26488**views)

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**AK Peters, Ltd.**

An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.

(

**21351**views)

**Data Structures and Algorithms**

by

**Catherine Leung**-

**GitBook**

This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.

(

**12237**views)