HomeGroupsTalkExploreZeitgeist
Search Site
This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Loading...

The Art of Computer Programming, Volumes 1-3 Boxed Set

by Donald E. Knuth

Series: The Art of Computer Programming (Omnibus 1-3)

MembersReviewsPopularityAverage ratingMentions
512638,548 (4.58)3
Offering a description of classical computer science, this multi-volume work is a useful resource in programming theory and practice for students, researchers, and practitioners alike. For programmers, it offers cookbook solutions to their day-to-day problems.
  1. 00
    Introduction to Algorithms by Thomas H. Cormen (billmcn)
    billmcn: See this book for a shorter and more accessible but still mathematically rigorous overview of fundamental algorithms.
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

» See also 3 mentions

English (6)  Italian (1)  All languages (7)
Showing 1-5 of 6 (next | show all)


The mouseover to Randall's cartoon says:

'Dear Reader: Enclosed is a cheque for 98 cents. Using your work, I have proved this equals the amount you requested.'

Nick provides a proper review...http://www.goodreads.com/review/show/46996559

Oh. It's full of jokes, by the way. Just as well I didn't have my cup of tea in hand when I came upon this one:

4. [M50] Prove that when n is an integer, n > 2, the equation xn yn = zn has no solution in positive integers x, y, z. (NB the book was published in the 1960s.)
  bringbackbooks | Jun 16, 2020 |
"I thought that I was a perfectionist until I met Knuth." The previous sentence is from the renowned mathematician Fan Rong K Chung Graham and I think it also reflects the spirit of the masterpiece of Knuth, The Art of Computer Programming (TAOCP). Reading the book was pure intellectual indulgence and a striking experience for me. I'm not a computer scientist in the academic sense but rather a professional programmer with engineering and mathematics background so I don't think I can criticize the book at the level it deserves, I simply do not own that much technical breadth and depth. But I can easily say that this is one of the books which I can call a masterpiece without hesitation and unlike many other technical books I read, it broadened my horizons in fundamental aspects of computing science, such as randomness and relationships between superficially unrelated mathematical structures.

Some may think that this masterpiece is rather theoretical and not very applicable in daily programming tasks but did you also know that this book is mentioned in Mitnick's 'The Art of Intrusion: The Real Stories Behind the Exploits of Hackers, Intruders and Deceivers' where a group of hackers try to analyze some slot machines and one of them visits the library to learn more about the random number generation algorithms and picks up TAOCP?

I believe every programmer will find at least a few pages of pure hacker's delight in TAOCP and thus this book belongs to the shelf of every programmer. ( )
  EmreSevinc | Apr 12, 2011 |
Just seeing this title again brought back many memories of this being the "bible" of computer science back in my grad school days -- a very, very, very long time ago. Knuth's volumes were absolutely the "go to" books for many of our courses. Perhaps they's seem dated now, but still they'd provide a very solid foundation for anyone serious about programming / computing / software development / etc. ( )
  coclimber | Oct 1, 2010 |
I'd be smarter after reading the material in these volumes, but I'd also be much older... From one of the gurus...Very, very in-depth. Done from a textbook POV, with explanations and many exercises. Examples and presentation can be awkward. Sedgewick's Algorithms in Java may be a better one to tackle. ( )
  Murdocke23 | Jan 31, 2010 |
An amazing work. Requires more concentration than I routinely muster, though, so I'm only making progress in fits and starts. ( )
  aneel | May 9, 2007 |
Showing 1-5 of 6 (next | show all)
no reviews | add a review

Belongs to Series

You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Original language
Canonical DDC/MDS
Canonical LCC

References to this work on external resources.

Wikipedia in English

None

Offering a description of classical computer science, this multi-volume work is a useful resource in programming theory and practice for students, researchers, and practitioners alike. For programmers, it offers cookbook solutions to their day-to-day problems.

No library descriptions found.

Book description
Haiku summary

Popular covers

Quick Links

Rating

Average: (4.58)
0.5
1
1.5
2
2.5
3 4
3.5
4 22
4.5 2
5 46

Is this you?

Become a LibraryThing Author.

 

About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 170,104,135 books! | Top bar: Always visible