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
"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