Algorithms and Theory of Computation Handbook, Volume 1: General Concepts and Techniques

— —

Mikhail J. Atallah (Purdue University, West Lafayette, Indiana, USA) Marina Blanton (University of Notre Dame, Indiana, USA)

Algorithms and Theory of Computation Handbook, Volume 1

General Concepts and Techniques

Mikhail J. Atallah (Purdue University, West Lafayette, Indiana, USA), Marina Blanton (University of Notre Dame, Indiana, USA)

$158

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

CRC Press
31 May 2017

Number systems; Computer programming & software development; Algorithms & data structures

Series: Chapman & Hall/CRC Applied Algorithms and Data Structures series

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.

By: Mikhail J. Atallah (Purdue University West Lafayette Indiana USA), Marina Blanton (University of Notre Dame, Indiana, USA)
Imprint: CRC Press
Country of Publication: United Kingdom
Edition: 2nd edition
Dimensions: Height: 254mm, Width: 178mm, Spine: 50mm
Weight: 453g
ISBN: 9781138113930
ISBN 10: 113811393X
Series: Chapman & Hall/CRC Applied Algorithms and Data Structures series
Pages: 988
Publication Date: 31 May 2017
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

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

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