Logo

Algorithms and Data Structures for External Memory

Large book cover: Algorithms and Data Structures for External Memory

Algorithms and Data Structures for External Memory
by

Publisher: Now Publishers
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

Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - 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.
(9239 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - 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.
(14510 views)
Book cover: Introduction to Design Analysis of AlgorithmsIntroduction to Design Analysis of Algorithms
by - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
(9126 views)
Book cover: Problem Solving with Algorithms and Data Structures Using PythonProblem Solving with Algorithms and Data Structures Using Python
by - 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.
(11687 views)