Algorithms and Theory of Computation Handbook

Overview

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, ...

See more details below
Available through our Marketplace sellers.
Other sellers (Hardcover)
  • All (12) from $19.36   
  • New (3) from $151.18   
  • Used (9) from $19.36   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$151.18
Seller since 2014

Feedback rating:

(281)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand New Item.

Ships from: Chatham, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$155.00
Seller since 2014

Feedback rating:

(178)

Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$155.00
Seller since 2014

Feedback rating:

(178)

Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by
Sending request ...

Overview

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

Read More Show Less

Editorial Reviews

Booknews
Two and a half inches thick, a comprehensive reference on the subject for computer scientists, engineers, and other professionals in related scientific and engineering disciplines. Focuses on fundamental topics and techniques, providing topic-specific references for more detailed information. Organized around 48 main themes, among them sorting and order statistics, randomized algorithms, formal grammars and languages, cryptographic foundations, and electronic cash. Each chapter defines terms, without indicating pronunciation, and summarizes, and identifies research issues. The page numbers start over with each chapter, but the index is not daunted. Annotation c. by Book News, Inc., Portland, Or.
Read More Show Less

Product Details

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

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)