Algorithms and Theory of Computation Handbook, Second Edition 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.
New to the Second EditionAlong with updating and revising many of the existing chapters, this second edition contains more than 20 new chapters. This edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, computational number theory, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives.
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.
Rezensionen / Stimmen
... a compilation that will appeal to professionals and students alike; together with those engaged in research and especially those contemplating embarking upon research. ... This second edition contains twenty-one new chapters and a thorough updating and revision of many of the chapters from the first edition. A consistent style has been adopted ... the sections detailing research issues and sources for further information will ensure that this edition remains an excellent reference source for years to come. I recommend this text as both a teaching aid and a reference source whose utility can only but increase in the coming years.
-International Statistical Review (2011), 79, 1
The detailed treatment of algorithmic foundations for various subfields of computer science makes the handbook relevant for abroad community of researchers in computer science, operations research, and optimization ... the handbook is a useful reference and presents a broad outlook on the vast field of algorithms and the theory of computation.
-Computing Reviews, May 2010
Praise for the First Edition... excellent survey of the state of the art ... highly recommended for anyone interested in algorithms, data structures and the theory of computation ... indispensable book of reference for all computer scientists, researchers and professional programmers.
-R. Kemp, Zentralblatt MATH, Vol. 926
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Professional
Produkt-Hinweis
Illustrationen
400 s/w Abbildungen
400 Illustrations, black and white
Maße
Höhe: 254 mm
Breite: 178 mm
Gewicht
ISBN-13
978-1-58488-818-5 (9781584888185)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
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.
Herausgeber*in
Purdue University, West Lafayette, Indiana, USA
University of Notre Dame, Indiana, USA
General Concepts and Techniques: Algorithms Design and Analysis Techniques. Searching. Sorting and Order Statistics. Basic Data Structures. Topics in Data Structures. Multidimensional Data Structures for Spatial Applications. Basic Graph Algorithms. Advanced Combinatorial Algorithms. Dynamic Graph Algorithms. On-Line Algorithms. External Memory Algorithms and Data Structures. Average Case Analysis of Algorithms. Randomized Algorithms. Pattern Matching in Strings. Text Data Compression Algorithms. General Pattern Matching. Computational Number Theory. Algebraic and Numerical Algorithms. Applications of FFT and Structured Matrices. Basic Notions in Computational Complexity. Formal Grammars and Languages. Computability. Complexity Classes. Reducibility and Completeness. Other Complexity Classes and Measures. Parameterized Algorithms. Computational Learning Theory. Algorithmic Coding Theory. Parallel Computation. Distributed Computing. Linear Programming. Integer Programming. Convex Optimization. Simulated Annealing Techniques. Approximation Algorithms for NP-Hard Optimization Problems. Special Topics and Techniques: Computational Geometry I. Computational Geometry II. Computational Topology. Robot Algorithms. Vision and Image Processing Algorithms. Graph Drawing Algorithms. Algorithmics in Intensity-Modulated Radiation Therapy. VLSI Layout Algorithms. Cryptographic Foundations. Encryption Schemes. Cryptanalysis. Crypto Topics and Applications I. Crypto Topics and Applications II. Secure Multi-Party Computation. Electronic Cash. Voting Schemes. Auction Protocols. Pseudorandom Sequences and Stream Ciphers. Theory of Privacy and Anonymity. Database Theory. Scheduling Algorithms. Computational Game Theory. Artificial Intelligence Search Algorithms. Algorithmic Aspects of Natural Language Processing. Algorithmic Techniques for Regular Networks of Processors. Parallel Algorithms. Self-Stabilizing Algorithms. Theory of Communication Networks. Network Algorithmics. Algorithmic Issues in Grid Computing. Uncheatable Grid Computing. DNA Computing. Computational Systems Biology. Pricing Algorithms for Financial Derivatives.
