**Purely Functional Data Structures**

by Chris Okasaki

**Publisher**: Carnegie Mellon University 1996**ISBN/ASIN**: 0521663504**Number of pages**: 162

**Description**:

This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. The author includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages.

Download or read it online for free here:

**Download link**

(620KB, PDF)

## Similar books

**Algorithms for Modular Elliptic Curves**

by

**J. E. Cremona**-

**Cambridge University Press**

The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.

(

**11021**views)

**Lecture Notes on Bucket Algorithms**

by

**Luc Devroye**-

**Birkhauser**

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.

(

**7057**views)

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**11082**views)

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

(

**9057**views)