A funny bio
Mani Soma, A prof at UW, IEEE fellowhttp://faculty.washington.edu/manisoma/Read his Biosketch...:)

Jeff Erickson's list on "what a theorectical computer science student should know"
Things happened Last week included Mihai Pătraşcu's (yes, it was him again!) this contraversial blog post with 74+ comparably interesting comments! I highly recommend you to follow it a bit if you haven't done so.I would like to quote today a comment by Jeff Erickson on related post.It is a (a suprisingly long and diverse) list on "what he thinks a phd in theorectical computer science should know". Erickson is a computational geometrist. That is why his list contains a few of geometry results (or algebraic results that is useful in algebraic geometry?) that I never heard of, like persiste

TAOCP and the inversion table of a permutation.
Perhaps every body in Computer science knows Knuth's volumes of "the art of computer programming". Since I was not a in a cs undergraduate program, I knew this book even before any introductory algorithm book like "Introduction to Algorithms".Partly due to the comment made by Bill Gate on the back of the 1st volumes: "If you think you're a really good programmer . . . read (Knuth's) Art of Computer Programming . . . You should definitely send me a resume if you can read the whole thing.", I started reading the book, as my very first book on algorithms (I had read some books about c and vb programmin