reviews
Feb 20, 2009
Perfection itself. Every few months I have to go back to my Knuth for some forgotten analysis or modeling, and it's always a savory treat -- I know no other books so dense and overflowing with rare and obscenely useful tricks, so immense in their scope and successful in coverage thereof; there's really nothing approachable in computer science or, so far as I know, in any field (the Hilbert-Courant volumes or Thorne's Gravitation might compare, if their subjects weren't so much vaster than comput
More...
0 comments
like
(3 people liked it)
Nov 24, 2011
All three volumes of The Art of Computer Programming (TAOCP), are classic. Each is IMHO a book that every CS student should try to study reimplementing example by example. Not many will succeed to finish even half of one volume, but if you do please buy all three of them :-).
I think it's very important to study Vol 1. It gives enough exposition to the Donald Knuth style and brilliant thinking. It is the level of thinking of the author that represents the main value of the book: you in More...
I think it's very important to study Vol 1. It gives enough exposition to the Donald Knuth style and brilliant thinking. It is the level of thinking of the author that represents the main value of the book: you in More...
Dec 05, 2010
I got the first edition of this book more than 10 years back. I have read (and re-read) the series in book in parts over the years, and every time I was impressed by the scholarly mastery and precision of the author. This arguably, is `the' most important text in computer science.
AOCP, along with Computer Algorithms by Corman, Leiserson and Rivest are the first books I turn to whenever I have an upcoming challenge or interview. Pinnacle of Precision!
AOCP, along with Computer Algorithms by Corman, Leiserson and Rivest are the first books I turn to whenever I have an upcoming challenge or interview. Pinnacle of Precision!
Aug 11, 2011
I haven't read these all the way through mind you, but these books along with the five Fascicles make up the greatest programing reference available, not for any language mind you, but programing in general, meta-programing if you well. Algorithms galore, sorting, and searching, and etc. If your looking for a solution to a programing problem its probibly here. Required for intermediate level skill and up, not for beginners.
Apr 16, 2011
I remember finding this book at a university library and, having heard of it, picked it to see why was it special. The book had a profound and lasting effect on the way I had to write computer programs, both academically and professionally. A must for computer science lovers.
Nov 15, 2010
Diciamocelo. Come potremmo vivere senza La Bibbia? Poi magari non riuscirò mai a leggerli, ma sapere che ci sono e che posso trovare l'algoritmo che mi serve è una coperta di Linus favolosa.
Apr 28, 2011
What's old is new again; techniques developed for Memory Drum and Tape based machines that fell out of favor are showing their worth again in data heavy and cloud based environments.
Jul 24, 2008
This is one of those sets of books you put on your shelf so that people will recognize you as a Serious Programmer. I don't know anyone who has actually READ them, other than college students who were forced to do it. I actually used it as a reference once when I was writing a sort, but then I tossed my code and used library code, because when it comes down to it, who wants to write a sort by yourself???
I've read some other stuff Knuth has written, and he's actually a pretty good More...
I've read some other stuff Knuth has written, and he's actually a pretty good More...
Jan 25, 2012
I'd give this book more than 5 stars if I could. If you ever thought writing a piece of code is eerily similar to painting.. or writing a poem, this is the book for you.
Jan 21, 2011

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 positiv More...
Jul 24, 2008
The definitive work on programming; without a doubt there is no more important book on Computer Science. However, it's almost totally impenetrable. I haven't read even a quarter of this, and fully understood much less, but that's nothing to be ashamed of, as probably no one else has either. All the examples are in a made up assembly language, and Knuth invented his own typesetting system to publish it, which became widespread and famous.
The perfect Coffee table book.
The perfect Coffee table book.
Nov 23, 2010
Knuth cannot be compared to anything else. It's both the beginning and the end of computer science -- you could spend months just trying to understand a single chapter. I love it, but I barely understand a single math equation.
Jul 16, 2007
Say hello to the monograph on computer programming. Don't roll your own without it.
I expect this'll be on my "currently reading" shelf for a few years. It's not exactly quick going.
I expect this'll be on my "currently reading" shelf for a few years. It's not exactly quick going.
Aug 03, 2008
Jesus christ, this is some heavy duty stuff. As a calculus 2 dropout, I might hit the wall early, but I really want to fight through this as much as I can before my head explodes.
Dec 17, 2009
I may never get all the way through these books, but they're fascinating and difficult. Any self-respecting hacker should have these books and have at least thumbed through them.
Oct 19, 2008
Reading it as a book for Advanced programming reference. But I think I'll read it completely when it's last day of my life
Oct 16, 2007
What I learned? That I need more freaking math and I shouldn't expect to read more than 10-20 pages in a given sitting. =D
Nov 04, 2010
I'm going to order this to hold up my monitor and then hold the inner world and dream a dream with you.
Feb 11, 2012
Feb 08, 2012
Feb 08, 2012
Feb 07, 2012
Jan 31, 2012
