Algorithms and Theory of Computation Handbook
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Algorithms and Theory of Computation Handbook: (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
Algorithms and Theory of Computation Handbook: (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

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


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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

Table of Contents:
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


Best Sellers


Product Details
  • ISBN-13: 9780849326493
  • Publisher: Taylor & Francis Inc
  • Publisher Imprint: CRC Press Inc
  • Height: 254 mm
  • No of Pages: 1312
  • Returnable: N
  • Weight: 2359 gr
  • ISBN-10: 0849326494
  • Publisher Date: 23 Nov 1998
  • Binding: Hardback
  • Language: English
  • No of Pages: 1312
  • Series Title: Chapman & Hall/CRC Applied Algorithms and Data Structures series
  • Width: 178 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms and Theory of Computation Handbook: (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
Taylor & Francis Inc -
Algorithms and Theory of Computation Handbook: (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

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

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!