Within this Book Full site



Filter my results

ISBN of the Book

Material or Process Book or Chapter Title Author or Editor Publication dates

Algorithms and Theory of Computation Handbook

General Concepts and Techniques

Edited by: Mikhail J. Atallah , Marina Blanton

Print publication date:  November  2009
Online publication date:  November  2009

Print ISBN: 9781584888222
eBook ISBN: 9781584888239
Adobe ISBN:

 Cite  Marc Record

Book description

Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains four new chapters that cover external memory and parameterized algorithms as well as computational number theory and algorithmic coding theory.

This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics.

Table of contents

Chapter  1:  Algorithm Design and Analysis Techniques Download PDF
Chapter  2:  Searching Download PDF
Chapter  3:  Sorting and Order Statistics Download PDF
Chapter  4:  Basic Data Structures  Download PDF
Chapter  5:  Topics in Data Structures Download PDF
Chapter  6:  Multidimensional Data Structures for Spatial Applications  Download PDF
Chapter  7:  Basic Graph Algorithms Download PDF
Chapter  8:  Advanced Combinatorial Algorithms Download PDF
Chapter  9:  Dynamic Graph Algorithms Download PDF
Chapter  10:  External-Memory Algorithms and Data Structures Download PDF
Chapter  11:  Average Case Analysis of Algorithms  Download PDF
Chapter  12:  Randomized Algorithms  Download PDF
Chapter  13:  Pattern Matching in Strings Download PDF
Chapter  14:  Text Data Compression Algorithms Download PDF
Chapter  15:  General Pattern Matching Download PDF
Chapter  16:  Computational Number Theory Download PDF
Chapter  17:  Algebraic and Numerical Algorithms Download PDF
Chapter  18:  Applications of FFT and Structured Matrices Download PDF
Chapter  19:  Basic Notions in Computational Complexity Download PDF
Chapter  20:  Formal Grammars and Languages Download PDF
Chapter  21:  Computability Download PDF
Chapter  22:  Complexity Classes Download PDF
Chapter  23:  Algorithm Design and Analysis Techniques Download PDF
Chapter  24:  Other Complexity Classes and Measures Download PDF
Chapter  25:  Parameterized Algorithms Download PDF
Chapter  26:  Computational Learning Theory  Download PDF
Chapter  27:  Algorithmic Coding Theory Download PDF
Chapter  28:  Parallel Computation: Models and Complexity Issues Download PDF
Chapter  29:  Distributed Computing: A Glimmer of a Theory Download PDF
Chapter  30:  Linear Programming  Download PDF
Chapter  31:  Integer Programming  Download PDF
Chapter  32:  Convex Optimization Download PDF
Chapter  33:  Simulated Annealing Techniques Download PDF
Chapter  34:  Approximation Algorithms for NP-Hard Optimization Problems Download PDF
prelims Download PDF
Search for more...

Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.