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
Randomized Algorithmsby 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.
(5998 views)
Knapsack Problems: Algorithms and Computer Implementationsby Silvano Martello, Paolo Toth - 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.
(11479 views)
Algorithms and Data Structures: With Applications to Graphics and Geometryby Jurg Nievergelt, Klaus Hinrichs - Prentice Hall
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.
(3096 views)
Design and Analysis of Algorithmsby 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.
(12538 views)