Cover image for Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Atallah, Mikhail J.
Publication Information:
Boca Raton : CRC Press, [1999]

Physical Description:
1 volume (various pagings) : illustrations ; 26 cm
Added Author:
Format :


Call Number
Material Type
Home Location
Item Holds
QA76.9.A43 A43 1999 Adult Non-Fiction Central Closed Stacks-Non circulating

On Order



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

Reviews 1

Choice Review

In 48 chapters spanning 1,256 pages, 67 authors outline the state of the art in foundational computer science. General surveys cover the design and analysis of algorithms, data structures, complexity theory, randomization, approximation, simulated annealing, FFT (fast Fourier transforms), and parallelism. More specialized chapters focus on classes of important specialized algorithms associated with particular applications such as pattern matching, geometry, robotics, VLSI (very large scale integration) layout, linear and integer programming, scheduling, artificial intelligence, and cryptography. At the expense of some repetition, each essay stands on its own. A detailed, unified index helps readers find their way about. Often one finds that chapters with common authors fit together in stylistically unified suites that offer coverage of monographic scope. Especially for a college library with only a modest collection in theoretical computer science, this single volume could fill many gaps. It will obviously attract the attention of computer science students, but also students of the physical sciences, mathematics, and engineering. Highly recommended. Undergraduates and up. D. V. Feldman University of New Hampshire