A Practical Introduction to Data Structures and Algorithm Analysis
by Clifford A. Shaffer
Publisher: Virginia Tech 2010
Number of pages: 638
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the data structure that will best solve a particular problem.
Home page url
Download or read it online for free here:
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Contents of the book: Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching.
by Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
by K. Mehlhorn, St. Näher - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
by Jeffrey Scott Vitter - Now Publishers
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, etc.