Greene Daniel H Knuth Donald E (20 results)

Hard Cover. Condition: Fine. Dust Jacket Condition: Not Issued with a Dust Jacket. The second edition, 123 pages. "Now in an expanded, updated edition, this book builds on the fundamental of complex variable theory and combinatorial analysis, presenting many of the major problems used in the precise analysis of algorithms. With coverage of binomial identities, recurrence relations, and asymptotic analysis, this book presents information in a useful format: terse enough fo easy referece, yet detailed enough for those with little background." FINE HARDCOVER. Size: 8vo - over 7¾" - 9¾" tall.…

hardcover. Condition: good. 107 pp. cover shows minor signs of shelf wear. pages are slightly dirty but unmarked. 1.

Hardcover. Condition: Good+. No Dust Jacket. Clean pages except for mild foxing at endpapers and edges; no owners' marks; square, tight binding, the purple hard cover showing small bumps and wrinkling at top free corners, mild sunning along the spine, and small scuffs at corners and spine ends, otherwise sound. 107pp. incl. index.; Progress in Computer Science Series. …

Trade Paperback. Condition: Used Very Good.

Condition: As New. Unread book in perfect condition.

Condition: New.

Paperback. Condition: New. Third Edition 1990. 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. …

Paperback. Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Good. 3rd Edition. This book has been read. However all pages intact with no highlighting or writing contained within. The spine remains undamaged with tight binding and the book is generally in good condition. Fast dispatch within and from the UK. 100% money back guarantee.

Condition: New. pp. 144 3rd Edition.

Condition: New. 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. Series: Modern Birkhauser Classics. Num Pages: 132 pages, biography. BIC Classification: PBKS. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 7. Weight in Grams: 470. . 2007. 3rd Edition. paperback. . . . .…

Condition: New. 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. Series: Modern Birkhauser Classics. Num Pages: 132 pages, biography. BIC Classification: PBKS. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 7. Weight in Grams: 470. . 2007. 3rd Edition. paperback. . . . . Books ship from the US and Ireland.…

Paperback. Condition: New. Third Edition 1990. 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. The book contains a wealth of highly original, instructive problems and solutions taken from actual examinations given at Stanford in various computer science courses.…

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: New. Print on Demand pp. 144 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, inc.…

Condition: New. PRINT ON DEMAND pp. 144.