Skip to main content

License single eBooks

Building better eBook deals for libraries

Take our 5-minute survey to help shape smarter, more affordable eBook discounts for your library.

Start survey

Your results

Search and filter

Showing 1 - 1 of 1
0 eBooks €0

  • Daniel H. Greene; Donald E. Knuth
    978-0-8176-4729-2
    1990
    Edition 3
    • A collection of some fundamental mathematical techniques that are required for the analysis of algorithms
    • Is very well written; the style and the mathematical exposition make the book pleasant to read
    • A wide range of topics are covered, including many of the major paradigms used in the analysis of algorithms, in an extremely concise manner (one hundred plus pages)
    • Contains a wealth of highly original, instructive problems AND solutions, taken from actual examinations given at Stanford in various computer science courses
    • Presents a welcome selection and careful exposition of material that can be covered in a single course with a group of advanced students well-grounded in undergraduate mathematics and computer science
    • The authors cover four important topics in algorithm analysis, all from a rudimentary, but highly original, point of view; each of these topics is critical to understanding the modern analysis of algorithms, primarily from the speed of execution perspective
    €419 €377
    10% OFF

Is this helpful?

Survey

Survey to collect feedback on the helpfulness of this page.

Survey

Survey to collect feedback on the helpfulness of this page.