Home > Store > Programming > Algorithms

Fundamentals of Algorithmics

Register your product to gain access to bonus material or receive a coupon.

Fundamentals of Algorithmics

Book

  • Your Price: $172.55
  • List Price: $203.00
  • We're temporarily out of stock, but order now and we'll send it to you later.

About

Features

  • structures material by techniques employed, not by the application area, so students can progress from the underlying abstract concepts to the concrete application essentials.
  • begins with a compact, but complete introduction to some necessary math, and also includes a long introduction to proofs by contradiction and mathematical induction. This serves to fill the gaps that many undergraduates have in their mathematical knowledge.
  • gives a paced, thorough introduction to the analysis of algorithms, and uses coherent notation and unusually detailed treatment of solving recurrences.
  • includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms, both of which are becoming increasingly important.
  • approaches the analysis and design of algorithms by type rather than by application.

Description

  • Copyright 1996
  • Dimensions: 7 X 9 1/4
  • Pages: 524
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-335068-1
  • ISBN-13: 978-0-13-335068-5

This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. KEY TOPICS: Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.

Sample Content

Table of Contents



 1. Preliminaries.


 2. Elementary Algorithmicss.


 3. Asymptotic Notation.


 4. Analysis of Algorithms.


 5. Some Data Structures.


 6. Greedy Algorithms.


 7. Divide-And-Conquer.


 8. Dynamic Programming.


 9. Exploring Graphs.


10. Probabilistic Algorithms.


11. Parallel Algorithms.


12. Computational Complexity.


13. Heuristic and Approximate Algorithms.


References.


Index.

Updates

Submit Errata

More Information

Unlimited one-month access with your purchase
Free Safari Membership