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: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(9348 views)
Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - 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.
(11169 views)
Book cover: Data Structures and AlgorithmsData Structures and Algorithms
by
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
(8891 views)
Book cover: Efficient Algorithms for Sorting and SynchronizationEfficient Algorithms for Sorting and Synchronization
by - 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.
(8566 views)