**Algorithms and Data Structures for External Memory**

by Jeffrey Scott Vitter

**Publisher**: Now Publishers 2008**ISBN/ASIN**: 1601981066**ISBN-13**: 9781601981066**Number of pages**: 191

**Description**:

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing.

Download or read it online for free here:

**Download link**

(1.1MB, PDF)

## Similar books

**Purely Functional Data Structures**

by

**Chris Okasaki**-

**Carnegie Mellon University**

This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.

(

**3075**views)

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

(

**11580**views)

**Average Case Analysis of Algorithms on Sequences**

by

**Wojciech Szpankowski**-

**Wiley-Interscience**

A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.

(

**6876**views)

**Randomized Algorithms**

by

**Wolfgang Merkle**-

**ESSLLI**

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.

(

**5469**views)