Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
Daniel H Greene; Donald Ervin Knuth
|Notes:||"Reprint of the 1990 edition."
"Originally published as volume 1 in the series Progress in computer science and applied logic"--Title page verso.
|Description:||viii, 132 pages : illustrations ; 24 cm.|
|Contents:||Preface Binomial Identities.- Summary of Useful Identities.- Deriving the Identities.- Inverse Relations.- Operator Calculus.- Hypergeometric Series.- Identities with the Harmonic Numbers Recurrence Relations.- Linear Recurrence Relations.- Nonlinear Recurrence Relations Operator Methods.- The Cookie Monster.- Coalesced Hashing.- Open Addressing: Uniform Hashing.- Open Addressing: Secondary Clustering Asymptotic Analysis.- Basic Concepts.- Stieltjes Integration and Asymptotics.- Asymptotics from Generating Functions Bibliography Appendices.- Schedule of Lectures.- Homework Assignments.- Midterm Exam I and Solutions.- Final Exam I and Solutions.- Midterm Exam II and Solutions.- Final Exam II and Solutions.- Midterm Exam III and Solutions.- Final Exam III and Solutions.- A Qualifying Exam Problem and Solution Index|
|Series Title:||Modern Birkhäuser classics.|
|Other Titles:||Progress in computer science and applied logic.|
|Responsibility:||Daniel H. Greene, Donald E. Knuth.|
"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