BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information
Stock photo: cover may vary

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series) Hardback - 2009 - 1st Edition

by Dobrushkin, Vladimir A

Add to wish list
  • Used
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$120.46
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)
The BIBLIO Guarantee

Details

  • Title Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)
  • Author Dobrushkin, Vladimir A
  • Binding Hardback
  • Edition number 1st
  • Edition 1
  • Condition Used - Good
  • Pages 826
  • Volumes 1
  • Language ENG
  • Publisher CRC Press
  • Publication date 2009-11-01
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 1420068296.G
  • ISBN 9781420068290 / 1420068296
  • Weight 3.5 lbs (1.59 kg)
  • Dimensions 10 x 7.1 x 1.6 in (25.40 x 18.03 x 4.06 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Mathematics
  • Library of Congress subjects Computer science - Mathematics, Algorithms
  • Library of Congress Catalogue Number 2009031435
  • Dewey Decimal Code 518.1
  • Quantity available 1

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

Media reviews

Citations

  • Scitech Book News, 06/01/2010, Page 25

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

Please wait a moment while we load the requested page.

tracking-