Edition 
Third edition 
Descript 
1 online resource (viii, 132 pages) : illustrations 

text txt rdacontent 

computer c rdamedia 

online resource cr rdacarrier 
Series 
Modern Birkhäuser classics 

Modern Birkhäuser classics

Note 
Includes bibliographical references and index 

Reprinted from the 1990 edition 

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 

Print version record 
Link 
Print version: Greene, Daniel H. Mathematics for the Analysis of Algorithms.
Dordrecht : Springer, ©2009 9780817635152

Subject 
Computer programming  Mathematics


Computer algorithms


Electronic books

Alt Author 
Knuth, Donald Ervin, 1938 author

