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

**Design and Analysis of Algorithms**

by

**Herbert Edelsbrunner**-

**Duke University**

The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.

(

**12248**views)

**Knapsack Problems: Algorithms and Computer Implementations**

by

**Silvano Martello, Paolo Toth**-

**John Wiley & Sons**

The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.

(

**11230**views)

**Problem Solving with Algorithms and Data Structures Using Python**

by

**Brad Miller, David Ranum**-

**Franklin, Beedle & Associates**

This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

(

**5959**views)

**The Art of Computer Programming, Volume 4**

by

**Donald E. Knuth**-

**Addison-Wesley Professional**

This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.

(

**12312**views)