skip to content
Mathematics for the analysis of algorithms Preview this item
ClosePreview this item
Checking...

Mathematics for the analysis of algorithms

Author: Daniel H Greene; Donald Ervin Knuth
Publisher: Boston : Birkhäuser, ©2008.
Series: Modern Birkhäuser classics.
Edition/Format:   Print book : English : 3rd edView all editions and formats
Database:WorldCat
Summary:
"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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Daniel H Greene; Donald Ervin Knuth
ISBN: 0817647287 9780817647285
OCLC Number: 181090594
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.
More information:

Abstract:

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  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"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 Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/181090594> # Mathematics for the analysis of algorithms
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "181090594" ;
   library:placeOfPublication <http://dbpedia.org/resource/Boston> ; # Boston
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   rdfs:seeAlso <http://experiment.worldcat.org/entity/work/data/18139979#CreativeWork/progress_in_computer_science_and_applied_logic> ; # Progress in computer science and applied logic.
   schema:about <http://id.loc.gov/authorities/subjects/sh91000149> ; # Computer algorithms
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/18139979#Topic/computer_programming_mathematics> ; # Computer programming--Mathematics
   schema:bookEdition "3rd ed." ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/7466303> ; # Donald Ervin Knuth
   schema:copyrightYear "2008" ;
   schema:creator <http://viaf.org/viaf/44380278> ; # Daniel H. Greene
   schema:datePublished "2008" ;
   schema:description ""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."--Publisher's website."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/18139979> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/18139979#Series/modern_birkhauser_classics> ; # Modern Birkhäuser classics.
   schema:name "Mathematics for the analysis of algorithms"@en ;
   schema:productID "181090594" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/181090594#PublicationEvent/boston_birkhauser_2008> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/18139979#Agent/birkhauser> ; # Birkhäuser
   schema:workExample <http://worldcat.org/isbn/9780817647285> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/181090594> ;
    .


Related Entities

<http://dbpedia.org/resource/Boston> # Boston
    a schema:Place ;
   schema:name "Boston" ;
    .

<http://experiment.worldcat.org/entity/work/data/18139979#CreativeWork/progress_in_computer_science_and_applied_logic> # Progress in computer science and applied logic.
    a schema:CreativeWork ;
   schema:name "Progress in computer science and applied logic." ;
    .

<http://experiment.worldcat.org/entity/work/data/18139979#Series/modern_birkhauser_classics> # Modern Birkhäuser classics.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/181090594> ; # Mathematics for the analysis of algorithms
   schema:name "Modern Birkhäuser classics." ;
   schema:name "Modern Birkhäuser classics" ;
    .

<http://id.loc.gov/authorities/subjects/sh91000149> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/44380278> # Daniel H. Greene
    a schema:Person ;
   schema:birthDate "1955" ;
   schema:familyName "Greene" ;
   schema:givenName "Daniel H." ;
   schema:name "Daniel H. Greene" ;
    .

<http://viaf.org/viaf/7466303> # Donald Ervin Knuth
    a schema:Person ;
   schema:birthDate "1938" ;
   schema:familyName "Knuth" ;
   schema:givenName "Donald Ervin" ;
   schema:name "Donald Ervin Knuth" ;
    .

<http://worldcat.org/isbn/9780817647285>
    a schema:ProductModel ;
   schema:isbn "0817647287" ;
   schema:isbn "9780817647285" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.