BN.com Gift Guide

Methods in Algorithmic Analysis / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $62.50
Usually ships in 1-2 business days
(Save 40%)
Other sellers (Hardcover)
  • All (10) from $62.50   
  • New (4) from $89.13   
  • Used (6) from $62.49   

Overview

Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science
A flexible, interactive teaching format enhanced by a large selection of examples and exercises

Developed from the author’s own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.

After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes’ theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.

Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students’ understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.

Read More Show Less

Editorial Reviews

From the Publisher
…helpful to any mathematics student who wishes to acquire a background in classical probability and analysis … This is a remarkably beautiful book that would be a pleasure for a student to read, or for a teacher to make into a year's course.

—Harvey Cohn, Computing Reviews, May 2010

Read More Show Less

Product Details

Meet the Author

Vladimir A. Dobrushkin is a professor in the Division of Applied Mathematics at Brown University and a professor in the Department of Computer Science at Worcester Polytechnic Institute.

Read More Show Less

Table of Contents

PRELIMINARIES

Why Do We Analyze Algorithms?

Proofs

Iteration and Recursion

COMBINATORICS

Properties of Summation

Multiple Sums

Principles of Counting

Permutations and Combinations

Binomial Coefficients

Binomial Coefficient and Hypergeometric Functions

Stirling Approximation

PROBABILITY

Set Operations

Sample Space and Random Variables

Calculating Probabilities

Random Variables

Conditional Probabilities

Independence

Joint Distributions

Dependent Random Variables

MORE ABOUT PROBABILITY

Special Distributions

Types of Probabilistic Convergence

The Theorem of Total Probability

Bayes’ Theorem

Convolution

Order Statistics

Chebyshev Inequality

Sundry Examples

RECURRENCES OR DIFFERENCE EQUATIONS

How Do Difference Equations Arise?

Properties of Difference Equations

First Order Linear Difference Equations

Divide-and-Conquer Recurrences

Quicksort Recurrence

Recurrences in Numerical Analysis

Continued Fractions

Partial Difference Equations

Some Applications

INTRODUCTION TO GENERATING FUNCTIONS

Generating Functions—Definitions

Extraction of Coefficients

Counting Binary Trees

Solving Recurrences

Snake Oil Summation

Applications in Probability

The Langrage Inversion Theorem

ENUMERATION WITH GENERATING FUNCTIONS

Definition of Enumerators

Sum and Product Rules

Counting Compositions of Integers

Further Set Operations

Partition of Integers

Exponential Enumerators

FURTHER ENUMERATION METHODS

Enumeration of Trees

Occupancy Enumeration

The Principle of Inclusion and Exclusion (PIE)

Extensions and Further Applications of the PIE

Probabilistic Inclusion-Exclusion Principle

Runs in Permutations

Special Topics

COMBINATORICS OF STRINGS

Operations on Languages

Regular Languages

Counting Regular Languages

Waiting Time Probabilistic Problems

Algorithms and Markov Chains

INTRODUCTION TO ASYMPTOTICS

Asymptotic Notation and Applications

The Critical Range Method

Rice’s Method

The Euler Summation Formula

Finding Primes

Asymptotics from Recurrences

Limit Laws in Probability

ASYMPTOTICS AND GENERATING FUNCTIONS

Elementary Bounds from Generating Functions

Estimates from Singularities

Estimates from Entire Functions

Examples and Exercises

REVIEW OF ANALYTIC TECHNIQUES

Complex Numbers

Review of Power Series

Functions of a Complex Variable: Basic Concepts

Differential Operators

Partial Fraction Decomposition

Some Special Functions

Stieltjes Integrals

APPENDICES

BIBLIOGRAPHY

ANSWERS/HINTS TO SELECTED PROBLEMS

INDEX

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)