Book by Greene, Daniel H
"synopsis" may belong to another edition of this title.
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“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)
"About this title" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: Roundabout Books, Greenfield, MA, U.S.A.
hardcover. Condition: Very Good. Condition Notes: Clean, unmarked copy with some edge wear. Good binding. Dust jacket included if issued with one. We ship in recyclable American-made mailers. 100% money-back guarantee on all orders. Seller Inventory # 1628835
Quantity: 1 available
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.76. Seller Inventory # G3764330465I4N00
Quantity: 1 available
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.76. Seller Inventory # G3764330465I4N00
Quantity: 1 available
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_361834182
Quantity: 1 available
Seller: ccbooksellers, Front Royal, VA, U.S.A.
hardcover. Condition: good. 107 pp. cover shows minor signs of shelf wear. pages are slightly dirty but unmarked. 1. Seller Inventory # SM0000023123
Quantity: 1 available
Seller: Bargain Treasures, Iona, ID, U.S.A.
Hardcover. Condition: Fair. ***PLEASE READ THIS FIRST!!!**** Has original purple cover. Book has water exposure and staining on inner back and bottom of pages. Customer service is our goal! Seller Inventory # TXT-SAB-1-10930
Quantity: 1 available
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Condition: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear. Seller Inventory # GWSVV.3764330465.G
Quantity: 1 available
Seller: The Media Foundation, BEAVERTON, OR, U.S.A.
Hardcover. Condition: Fine. Book is in great condition. Cover shows light edge wear and shelfwear. Pages are crisp and clean, binding tight. 100% Satisfaction Guaranteed. Orders received before 3PM PT typically ship same day. All profits support the non-profit community. Seller Inventory # mon0000026318
Quantity: 1 available
Seller: suspiratio - online bücherstube, Basel, Switzerland
Hardcover. Condition: Gut. einband hat leichte lagerspuren, sosnt gut, 107 seiten - nur a-835. Seller Inventory # c-167-gOl
Quantity: 1 available
Seller: dsmbooks, Liverpool, United Kingdom
Hardcover. Condition: Very Good. Very Good. book. Seller Inventory # D7S9-1-M-3764330465-6
Quantity: 1 available