Algorithms and Theory of Computation Handbook, Volume 1: General Concepts and Techniques: Chapman & Hall/CRC Applied Algorithms and Data Structures series
Autor Mikhail J. Atallah, Marina Blantonen Limba Engleză Hardback – 20 noi 2009
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 422.44 lei 43-57 zile | |
CRC Press – 31 mai 2017 | 422.44 lei 43-57 zile | |
Hardback (1) | 1160.99 lei 43-57 zile | |
CRC Press – 20 noi 2009 | 1160.99 lei 43-57 zile |
Preț: 1160.99 lei
Preț vechi: 1683.08 lei
-31% Nou
Puncte Express: 1741
Preț estimativ în valută:
222.21€ • 231.60$ • 184.98£
222.21€ • 231.60$ • 184.98£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781584888222
ISBN-10: 1584888229
Pagini: 988
Ilustrații: 227 b/w images, 22 tables and 900 plus equations - PPI 606
Dimensiuni: 178 x 254 x 50 mm
Greutate: 2 kg
Ediția:2
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Chapman & Hall/CRC Applied Algorithms and Data Structures series
ISBN-10: 1584888229
Pagini: 988
Ilustrații: 227 b/w images, 22 tables and 900 plus equations - PPI 606
Dimensiuni: 178 x 254 x 50 mm
Greutate: 2 kg
Ediția:2
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Chapman & Hall/CRC Applied Algorithms and Data Structures series
Public țintă
ProfessionalNotă biografică
Mikhail J. Atallah is a distinguished professor of computer science at Purdue University.
Marina Blanton is an assistant professor in the computer science and engineering department at the University of Notre Dame
Marina Blanton is an assistant professor in the computer science and engineering department at the University of Notre Dame
Cuprins
Preface, Editors, Contributors, 1 Algorithm Design and Analysis Techniques, 2 Searching, 3 Sorting and Order Statistics, 4 Basic Data Structures, 5 Topics in Data Structures, 6 Multidimensional Data Structures for Spatial Applications, 7 Basic Graph Algorithms, 8 Advanced Combinatorial Algorithms, 9 Dynamic Graph Algorithms, 10 External-Memory Algorithms and Data Structures, 11 Average Case Analysis of Algorithms, 12 Randomized Algorithms, 13 Pattern Matching in Strings, 14 Text Data Compression Algorithms, 15 General Pattern Matching, 16 Computational Number Theory, 17 Algebraic and Numerical Algorithms, 18 Applications of FFT and Structured Matrices, 19 Basic Notions in Computational Complexity, 20 Formal Grammars and Languages, 21 Computability, 22 Complexity Classes, 23 Reducibility and Completeness, 24 Other Complexity Classes and Measures, 25 Parameterized Algorithms, 26 Computational Learning Theory, 27 Algorithmic Coding Theory, 28 Parallel Computation: Models and Complexity Issues, 29 Distributed Computing: A Glimmer of a Theory, 30 Linear Programming, 31 Integer Programming, 32 Convex Optimization, 33 Simulated Annealing Techniques, 34 Approximation Algorithms for NP-Hard Optimization Problems
Descriere
This handbook 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. 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. Along with updating and revising many of the existing chapters, this edition contains four new chapters that cover external memory and parameterized algorithms as well as computational number theory and algorithmic coding theory.