Algorithms and Theory of Computation Handbook
Crc Press Inc (Verlag)
978-0-8493-2649-3 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
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
Algorithm Design and Analysis Techniques, Edward M. Reingold
Searching, Ricardo Baeza-Yates and Patricio Poblete
Sorting and Order Statistics, Vladimir Estivill-Castro
Basic Data Structures, Brian Cantrill and Roberto Tamassia
Topics in Data Structures, Giuseppe F. Italiano and Rajeev Raman
Basic Graph Algorithms, Samir Khuller and Balaji Raghavachari
Advanced Combinatorial Algorithms, Samir Khuller and Balaji Raghavachari
Dynamical Graph Algorithms, Giuseppe F. Italiano, David Eppstein, and Zvi Galil
Graph Drawing Algorithms, Peter Eades and Petra Mutzel
On-Line Algorithms, Steven Phillips and Jeffrey Westbrook
Pattern Matching in Strings, Maxime Crochemore and Christophe Hancart
Text Data Compression Algorithms, Maxime Crochemore and Thierry Lecroq
General Pattern Matching, Alberto Apostolico
Average Case Analysis of Algorithms, Wojciech Szpankowski
Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan
Algebraical Algorithms, Angel Diaz, Ioannis Z. Emiris, Erich Kaltofen, and Victor Y. Pan
Applications of FFT, Victor Pan and Ioannis Z. Emiris
Multidimensional Data Structures, Hanan Samet
Computational Geometry I, D.T. Lee
Computational Geometry II, D.T. Lee
Robot Algorithms, Dan Halperin, Lydia Kavraki, Jean-Claude Latombe
Vision and Image Processing Algorithms, Concettina Guerra
VLSI Layout Algorithms, Andrea LaPaugh
Basic Notions in Computational Complexity, Tao Jiang, Ming Li, and Bala Ravikumar
Formal Grammars and Languages, Tao Jiang, Ming Li, Bala Ravikumar, and Kenneth W. Regan
Computability, Tao Jiang, Ming Li, Bala Ravikumar, and Kenneth W. Regan
Complexity Classes, Eric Allender, Michael C. Loui, and Kenneth W. Regan
Reducibility and Completeness, Eric Allender, Michael C. Loui, and Kenneth W. Regan
Other Complexity Classes and Measures, Eric Allender, Michael C. Loui, and Kenneth W. Regan
Computational Learning Theory, Sally Goldman
Linear Programming, Vijay Chandru and M.R. Rao
Integer Programming, Vijay Chandru and M.R. Rao
Convex Optimization, Stephen Vavasis
Approximation Algorithms for NP-Hard Optimization Problems, Philip Klein and Neal Young
Scheduling Algorithms, David Karger, Cliff Stein, and Joel Wein
Artificial Intelligence Search Algorithms, Richard E. Korf
Simulated Annealing Techniques, Albert Y. Zomaya and Rick Kazman
Cryptographic Foundations, Yvo Desmedt
Encryption Schemes, Yvo Desmedt
Crypto Topics and Applications I, Jennifer Seberry, Chris Charnes, Josef Pieprzyk, and Rei Safavi-Naini
Crypto Topics and Applications II, Jennifer Seberry, Chris Charnes, Josef Pieprzyk, and Rei Safavi-Naini
Cryptanalysis, Samuel S. Wagstaff
Psuedorandom Sequences and Stream Cyphers, Andrew Klapper
Electronic Cash, Stefan Brands
Parallel Computation: Models and Complexity Issues, Ray Greenlaw and Jim Hoover
Algorithmic Techniques for Networks of Processors, Russ Miller and Quentin F. Stout
Parallel Algorithms, Guy Blelloch and Bruce Maggs
Distributed Computing, Eli Gafni
| Erscheint lt. Verlag | 23.11.1998 |
|---|---|
| Reihe/Serie | Chapman & Hall/CRC Applied Algorithms and Data Structures series |
| Zusatzinfo | 39 Tables, black and white |
| Verlagsort | Bosa Roca |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Gewicht | 2359 g |
| Einbandart | gebunden |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| ISBN-10 | 0-8493-2649-4 / 0849326494 |
| ISBN-13 | 978-0-8493-2649-3 / 9780849326493 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
