Mathematics for the Analysis of Algorithms - Daniel H. Greene, Donald E. Knuth

Mathematics for the Analysis of Algorithms

Buch | Hardcover
140 Seiten
1990 | 3rd Revised edition
Birkhauser Boston Inc (Verlag)
978-0-8176-3515-2 (ISBN)
85,59 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
This monograph collects fundamental mathematical techniques required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present major paradigms used in the precise analysis of algorithms.
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.

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

Erscheint lt. Verlag 1.9.1990
Reihe/Serie Progress in Theoretical Computer Science ; v. 1
Zusatzinfo illustrations
Verlagsort Secaucus
Sprache englisch
Maße 155 x 235 mm
Gewicht 389 g
Einbandart gebunden
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Analysis
ISBN-10 0-8176-3515-7 / 0817635157
ISBN-13 978-0-8176-3515-2 / 9780817635152
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99