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

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

(

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

(

**26179**views)

**Tabu Search**

by

**Wassim Jaziri**-

**InTech**

Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.

(

**13855**views)

**Open Data Structures: An Introduction**

by

**Pat Morin**-

**AU Press**

Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

(

**15381**views)