Algorithms and theory of computation handbook / edited by Mikhail J. Atallah.
Contributor(s): Atallah, Mikhail J
.
Material type: 
BookPublisher: Boca Raton : CRC Press, 1999Description: various pagings : ill. ; 26 cm.ISBN: 0849326494.Subject(s): Computer algorithms | Computer science | Computational complexityDDC classification: 511.3 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 511.3 (Browse shelf(Opens below)) | 1 | Available | 00075408 |
Enhanced descriptions from Syndetics:
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
Includes bibliographical references and index.
Algorithm design and analysis techniques -- Searching -- Sorting and order statistics -- Basic data structures -- Topics in data structures -- Basic graph algorithms -- Advanced combinatorial algorithms -- Dynamic graph algorithms -- Graph drawing algorithms -- On-line algorithms: competitive analysis and beyond -- Pattern matching and strings -- Text data compression algorithms -- General pattern matching -- Average case analysis of algorithms -- Randomized algorithms -- Algebraic algorithms -- Applications of FFT -- Multidimensional data structures -- Computational geometry I -- Computational geometry II -- Robot algorithms -- Vision and image processing algorithms -- VLSI layout algorithms -- Basic notions in computational complexity -- Formal grammars and languages -- Computability -- Complexity classes -- Reducibility and completeness -- Other complexity classes and measures -- Computational learning theory -- Linear programming -- Integer programming -- Convex optimization -- Approximation algorithms -- Scheduling algorithms -- Artificial intelligence search algorithms -- Simulated annealing techniques -- Cryptographic foundations -- Encryption schemes -- Crypto topics and applications I -- Crypto topics and applications II -- Cryptanalysis -- Pseudorandom sequences and stream ciphers -- Electronic cash -- Parallel computation -- Algorithmic techniques for networks of processors -- Parallel algorithms -- Distributed computing: a glimmer of a theory.