Algorithms and Theory of Computation Handbook (Chapman & Hall/CRC Applied Algorithms and Data Structures series) - Hardcover

Hardcover

ISBN 10: 0849326494 ISBN 13: 9780849326493

Publisher: CRC Press, 1998

Synopsis

Algorithms and Theory of Computation Handbook is a comprehensive collection of algorithms and data structures that also covers many theoretical issues. It offers a balanced perspective that reflects the needs of practitioners, including emphasis on applications within discussions on theoretical issues. Chapters include information on finite precision issues as well as discussion of specific algorithms where algorithmic techniques are of special importance, including graph drawing, robotics, forming a VLSI chip, vision and image processing, data compression, and cryptography. The book also presents some advanced topics in combinatorial optimization and parallel/distributed computing.

·           applications areas where algorithms and data structuring techniques are of special importance

·     graph drawing

·     robot algorithms

·     VLSI layout

·     vision and image processing algorithms

·     scheduling

·     electronic cash

·     data compression

·     dynamic graph algorithms

·     on-line algorithms

·     multidimensional data structures

·     cryptography

·     advanced topics in combinatorial optimization and parallel/distributed computing

About this title

Review

"highly recommended." -D.V. Feldman, Choice, October 1999 "excellent survey of the state of the arthighly recommended for anyone interested in algorithms, data structures and the theory of computationindispensable book of reference for all computer scientists, researchers and professional programmers." --R. Kemp, Zentralblatt MATH, Vol. 926

From the Author

A comprehensive compendium for researchers and practitioners
The Handbook on Algorithms and Theory of Computation is a comprehensive treatment of the subject for computer scientists, engineers, and other professionals in related scientific and engineering disciplines. Its focus is to provide a compendium of fundamental topics and techniques for professionals, including practicing engineers, students, and researchers. The handbook is organized around the main subject areas of the discipline, and also contains chapters from applications areas that illustrate how the fundamental concepts and techniques come together to provide elegant solutions to important practical problems.

The contents of each chapter were chosen so that the computer professional or engineer has a high probability of finding significant information on a topic of interest. While the reader may not find in a chapter all the specialized topics, nor will the coverage of each topic be exhaustive, the reader should be able to obtain sufficient information for initial inquiries and a number of references to the current in-depth literature. Each chapter contains a section on ``Research Issues and Summary'' where the reader is given a summary of research issues in the subject matter of the chapter, as well as a brief summary of the chapter. Each chapter also contains a section called ``Defining Terms'' that provides a list of terms and definitions that might be useful to the reader. The last section of each chapter is called ``Further Information'' and directs the reader to additional sources of information in the chapter's subject area; these are the sources that contain more detail than the chapter can possibly provide. As appropriate, they include information on societies, seminars, conferences, databases, journals, etc.

Table of Contents:

Chapter 1: ALGORITHM DESIGN AND ANALYSIS TECHNIQUES

Edward M. Reingold

Chapter 2: SEARCHING

Ricardo Baeza-Yates and Patricio Poblete

Chapter 3: SORTING AND ORDER STATISTICS

Vladimir Estivill-Castro

Chapter 4: BASIC DATA STRUCTURES

Brian Cantrill and Roberto Tamassia

Chapter 5: TOPICS IN DATA STRUCTURES

Giuseppe F. Italiano and Rajeev Raman

Chapter 6: BASIC GRAPH ALGORITHMS

Samir Khuller and Balaji Raghavachari

Chapter 7: ADVANCED COMBINATORIAL ALGORITHMS

Samir Khuller and Balaji Raghavachari

Chapter 8: DYNAMIC GRAPH ALGORITHMS

Giuseppe F. Italiano, David Eppstein, and Zvi Galil

Chapter 9: GRAPH DRAWING ALGORITHMS

Peter Eades and Petra Mutzel

Chapter 10: ON-LINE ALGORITHMS

Steven Phillips and Jeffrey Westbrook

Chapter 11: PATTERN MATCHING IN STRINGS

Maxime Crochemore and Christophe Hancart

Chapter 12: TEXT DATA COMPRESSION ALGORITHMS

Maxime Crochemore and Thierry Lecroq

Chapter 13: GENERAL PATTERN MATCHING

Alberto Apostolico

Chapter 14: AVERAGE CASE ANALYSIS OF ALGORITHMS

Wojciech Szpankowski

Chapter 15: RANDOMIZED ALGORITHMS

Rajeev Motwani and Prabhakar Raghavan

Chapter 16: ALGEBRAIC ALGORITHMS

Angel Diaz, Ioannis Z. Emiris, Erich Kaltofen, Victor Y. Pan

Chapter 17: APPLICATIONS OF FFT

Victor Pan and Ioannis Z. Emiris

Chapter 18: MULTIDIMENSIONAL DATA STRUCTURES

Hanan Samet

Chapter 19: COMPUTATIONAL GEOMETRY I

D. T. Lee

Chapter 20: COMPUTATIONAL GEOMETRY II

D. T. Lee

Chapter 21: ROBOT ALGORITHMS

Dan Halperin, Lydia Kavraki, Jean-Claude Latombe

Chapter 22: VISION AND IMAGE PROCESSING ALGORITHMS

Concettina Guerra

Chapter 23: VLSI LAYOUT ALGORITHMS

Andrea LaPaugh

Chapter 24: BASIC NOTIONS IN COMPUTATIONAL COMPLEXITY

Tao Jiang, Ming Li, and Bala Ravikumar

Chapter 25: FORMAL GRAMMARS AND LANGUAGES

Tao Jiang, Ming Li, Bala Ravikumar, and Kenneth W. Regan

Chapter 26: COMPUTABILITY

Tao Jiang, Ming Li, Bala Ravikumar, and Kenneth W. Regan

Chapter 27: COMPLEXITY CLASSES

Eric Allender, Michael C. Loui, and Kenneth W. Regan

Chapter 28: REDUCIBILITY AND COMPLETENESS

Eric Allender, Michael C. Loui, and Kenneth W. Regan

Chapter 29: OTHER COMPLEXITY CLASSES AND MEASURES

Eric Allender, Michael C. Loui, and Kenneth W. Regan

Chapter 30: COMPUTATIONAL LEARNING THEORY

Sally Goldman

Chapter 31: LINEAR PROGRAMMING

Vijay Chandru and M.R. Rao

Chapter 32: INTEGER PROGRAMMING

Vijay Chandru and M.R. Rao

Chapter 33: CONVEX OPTIMIZATION

Stephen Vavasis

Chapter 34: APPROXIMATION ALGORITHMS FOR NP-HARD OPTIMIZATION PROBLEMS

Philip Klein and Neal Young

Chapter 35: SCHEDULING ALGORITHMS

David Karger, Cliff Stein, and Joel Wein

Chapter 36: ARTIFICIAL INTELLIGENCE SEARCH ALGORITHMS

Richard E. Korf

Chapter 37: SIMULATED ANNEALING TECHNIQUES

Albert Y. Zomaya and Rick Kazman

Chapter 38: CRYPTOGRAPHIC FOUNDATIONS

Yvo Desmedt

Chapter 39: ENCRYPTION SCHEMES

Yvo Desmedt

Chapter 40: CRYPTO TOPICS AND APPLICATIONS I

Jennifer Seberry, Chris Charnes, Josef Pieprzyk, Rei Safavi-Naini

Chapter 41: CRYPTO TOPICS AND APPLICATIONS II

Jennifer Seberry, Chris Charnes, Josef Pieprzyk, Rei Safavi-Naini

Chapter 42: CRYPTANALYSIS

Samuel S. Wagstaff

Chapter 43: PSEUDORANDOM SEQUENCES AND STREAM CYPHERS

Andrew Klapper

Chapter 44: ELECTRONIC CASH

Stefan Brands

Chapter 45: PARALLEL COMPUTATION: MODELS AND COMPLEXITY ISSUES

Ray Greenlaw and Jim Hoover

Chapter 46: ALGORITHMIC TECHNIQUES FOR NETWORKS OF PROCESSORS

Russ Miller and Quentin F. Stout

Chapter 47: PARALLEL ALGORITHMS

Guy Blelloch and Bruce Maggs

Chapter 48: DISTRIBUTED COMPUTING

Eli Gafni

Edition details

• Publisher: CRC Press
• Publication date: 1998
• ISBN 10: 0849326494
• ISBN 13: 9780849326493
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 1312
• Editor: Atallah Mikhail J.