An Introduction to the Analysis of Algorithms
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > An Introduction to the Analysis of Algorithms
22%
An Introduction to the Analysis of Algorithms

An Introduction to the Analysis of Algorithms


     0     
5
4
3
2
1



Out of Stock


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

"People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically...The appearance of this long-awaited book is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition." --D. E. Knuth This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on "average-case" or "probabilistic" analysis, although they also cover the basic mathematical tools required for "worst-case" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms. Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research being done to meet these challenges. Highlights: *Thorough, self-contained coverage for students and professionals in computer science and mathematics *Focus on mathematical techniques of analysis *Basic preparation for the advanced results covered in Knuth's books and the research literature *Classical approaches and results in the analysis of algorithms 020140009XB04062001

Table of Contents:
1. Analysis of Algorithms. Why Analyze an Algorithm? Computational Complexity. Analysis of Algorithms. Average-Case Analysis. Example: Analysis of Quicksort. Asymptotic Approximations. Distributions. Probabilistic Algorithms. 2. Recurrence Relations. Basic Properties. First-Order Recurrences. Nonlinear First-Order Recurrences. Higher-Order Recurrences. Methods for Solving Recurrences. Binary Divide-and-Conquer Recurrences and Binary Numbers. General Divide-and-Conquer Recurrences. 3. Generating Functions. Ordinary Generating Functions. Exponential Generating Functions. Generating Function Solution of Recurrences. Expanding Generating Functions. Transformations with Generating Functions. Functional Equations on Generating Functions. Solving the Quicksort Median-of-Three. Recurrence with OGFs. Counting with Generating Functions. The Symbolic Method. Lagrange Inversion. Probability Generating Functions. Bivariate Generating Functions. Special Functions. 4. Asymptotic Approximations. Notation for Asymptotic Approximations. Asymptotic Expansions. Manipulating Asymptotic Expansions. Asymptotic Approximations of Finite Sums. Euler-Maclaurin Summation. Bivariate Asymptotics. Laplace Method. “Normal” Examples from the Analysis of Algorithms. “Poisson” Examples from the Analysis of Algorithms. Generating Function Asymptotics. 5. Trees. Binary Trees. Trees and Forests. Properties of Trees. Tree Algorithms. Binary Search Trees. Average Path Length in Catalan Trees. Path Length in Binary Search Trees. Additive Parameters of Random Trees. Height. Summary of Average-Case Results on Properties of Trees. Representations of Trees and Binary Trees. Unordered Trees. Labelled Trees. Other Types of Trees. 6. Permutations. Basic Properties of Permutations. Algorithms on Permutations. Representations of Permutations. Enumeration Problems. Analyzing Properties of Permutations with CGFs. Inversions and Insertion Sorts. Left-to-Right Minima and Selection Sort. Cycles and In Situ Permutation. Extremal Parameters. 7. Strings and Tries. String Searching. Combinatorial Properties of Bitstrings. Regular Expressions. Finite-State Automata and Knuth-Morris-Pratt Algorithm. Context-Free Grammars. Tries. Trie Algorithms. Combinatorial Properties of Tries. Larger alphabets. 8. Words and Maps. Hashing with Separate Chaining. Basic Properties of Words. Birthday Paradox and Coupon Collector Problem. Occupancy Restrictions and Extremal Parameters. Occupancy Distributions. Open Addressing Hashing. Maps. Integer Factorization and Maps. 020140009XT04062001

About the Author :
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth. About Philippe Flajolet Philippe Flajolet is a Senior Research Director at INRIA, has taught at Ecole Polytechnique and Princeton University, and has held visiting positions at Stanford University, the University of Chile, and the Technical University of Vienna. He is a corresponding member of the French Academy of Sciences. 020140009XAB06262002


Best Sellers


Product Details
  • ISBN-13: 9780201400090
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison Wesley
  • Height: 169 mm
  • No of Pages: 512
  • Weight: 658 gr
  • ISBN-10: 020140009X
  • Publisher Date: 20 May 1996
  • Binding: Hardback
  • Language: English
  • Spine Width: 39 mm
  • Width: 242 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
An Introduction to the Analysis of Algorithms
Pearson Education (US) -
An Introduction to the Analysis of Algorithms
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.

An Introduction to the Analysis of Algorithms

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!