Sponsored
Buy Used :
$30.00
$5.50 delivery Tuesday, October 13. Details
Or fastest delivery October 5 - 7. Details
Used: Very Good | Details
Sold by greymatterbooks
Condition: Used: Very Good
Comment: Publisher: Birkhauser
Date of Publication: 1990
Binding: hardcover
Edition:
Condition: Very Good
Description: Text is unmarked; pages are bright, though the page edges are foxed. Previous owner's signature in pen on the first free end page. Binding is sturdy. Covers show some light wear around the corners and are lightly shelf scuffed. The covers are also unevenly faded. No dust jacket, as issued.
Access codes and supplements are not guaranteed with used items.
Only 1 left in stock - order soon.
Added to

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Sponsored
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

  • Mathematics for the Analysis of Algorithms (Progress in Computer Science and Applied Logic)

Follow the authors

Follow authors for new release and deal updates, plus improved recommendations. See updates from all followed authors in Your Books.
Something went wrong. Please try your request again later.

Mathematics for the Analysis of Algorithms (Progress in Computer Science and Applied Logic)

4.3 out of 5 stars (6)

This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.

Editorial Reviews

Review

“This is a short cookbook of methods for analyzing the run time of computer algorithms, aimed at computer scientists … . a very erudite book, full of interesting things for both mathematicians and computer scientists … .” (Allen Stenger, MAA Reviews, September, 2015)

“Mathematics for the Analysis of Algorithms covers a variety of topics in a relatively small amount of pages. Despite its briefness, most of the topics are clearly and fully explained using detailed examples for better understanding. As such, the book is suitable for use as study material, as well as a good reference guide…The reviewer recommends this book to anyone interested in advanced theory of algorithms and the mathematics behind it, either as an exposition to the topic or as reference material in future work.” ―SIGACT NEWS

"This book collects some fundamental mathematical techniques which are required for the analysis of algorithms... This book arose from handouts for an advanced course on the analysis of algorithms at Standard University, and the appendices list lectures, homework assignments and problems for the midterm and the final exams with their solutions. In summary, this book is a very valuable collection of mathematical techniques for the analysis of algorithms and accompanies, as well as complements, the second author's series The Art of Computer Programming

." ―Mathematical Reviews

"The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace's techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." ―SIAM Review

"The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course...In this reviewer's opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." ― Computing Reviews

"The reader has probably heard of the expression 'good things come in small packages.' The validity of that maxim is no more in evidence than in the work under review, which is nothing less than a mathematical wellspring among the otherwise parched world of theoretical algorithm analysis. In only 76 pages (not counting the bibliography and amazing appendices), the authors cover four important topics in algorithm analysis, all from a rudimentary, but highly original,

point of view: Binomial Identities, Recurrence Relations, Operator Methods, and Asymptotic Analysis. Each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective... In summary, the book under review should not be underestimated in its powerful use of mathematics for the analysis of algorithms arising from computer science considerations." ―Timothy Hall, Process Quality Improvement Consulting

"The analysis of algorthms is possible on mathematical and on computer scientific ways. This [book] is a mathematical look at this topic. It is based on an advanced course in computer science at Stanford University... The Appendices contain further difficult problems for applying the methods of this outstanding, full-of-thoughts book." ―P.L. Erdos (Periodica Mathematica Hungarica)

From the Back Cover

A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.

"...a very valuable collection of mathematical techniques for the analysis of algorithms..." ― Mathematical Reviews

"The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace’s techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." ― SIAM Review

"The book presents a welcome selection a

nd careful exposition of material that can be (and is) covered in a single course...In this reviewer’s opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." ― Computing Reviews

Product details

  • Publisher ‏ : ‎ Birkhauser
  • Publication date ‏ : ‎ January 1, 1990
  • Edition ‏ : ‎ Subsequent
  • Language ‏ : ‎ English
  • Print length ‏ : ‎ 132 pages
  • ISBN-10 ‏ : ‎ 0817635157
  • ISBN-13 ‏ : ‎ 978-0817635152
  • Item Weight ‏ : ‎ 12 ounces
  • Dimensions ‏ : ‎ 6 x 0.75 x 9.25 inches
  • Best Sellers Rank: #4,773,219 in Books (See Top 100 in Books)
  • Customer Reviews:
    4.3 out of 5 stars (6)

About the authors

Follow authors for new release and deal updates, plus improved recommendations. See updates from all followed authors in Your Books.
Sponsored

Customer reviews

4.3 out of 5 stars
6 global ratings
Sponsored
Sign in to see customer reviews.