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

**Data Structures and Algorithms**

by

**John Morris**

The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.

(

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

(

**4589**views)

**A Practical Introduction to Data Structures and Algorithm Analysis**

by

**Clifford A. Shaffer**-

**Virginia Tech**

A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.

(

**9175**views)

**Vector Models for Data-Parallel Computing**

by

**Guy Blelloch**-

**The MIT Press**

Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.

(

**7787**views)