Difference between revisions of "Clifford Stein"
Nonsensical (talk | contribs) (New page: thumb|200px|Clifford Stein {{wp-also}} {{dir-also|cs2035}} {{culpa-also|1342}} '''Clifford Stein''' is a professor in both the IEOR and [[C...) |
|||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
[[Image:CliffordStein.jpg|thumb|200px|Clifford Stein]] | [[Image:CliffordStein.jpg|thumb|200px|Clifford Stein]] | ||
| + | [[Image:CLRS.jpg|thumb|150px|''Introduction to Algorithms'' by Thomas Cormen, Charles Leiserson, Ron Rivest, Clifford Stein]] | ||
{{wp-also}} | {{wp-also}} | ||
{{dir-also|cs2035}} | {{dir-also|cs2035}} | ||
| − | |||
'''Clifford Stein''' is a professor in both the [[IEOR Department|IEOR]] and [[Computer Science Department|CS]] departments. He is best known as co-author of the book ''[http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262032937/ref=pd_bbs_2/002-2183389-8664866?ie=UTF8&s=books&qid=1184572112&sr=8-2 Introduction to Algorithms]'', the de facto standard book on programming algorithms. He teaches the course [[Introduction to Algorithms I]] based on the text. | '''Clifford Stein''' is a professor in both the [[IEOR Department|IEOR]] and [[Computer Science Department|CS]] departments. He is best known as co-author of the book ''[http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262032937/ref=pd_bbs_2/002-2183389-8664866?ie=UTF8&s=books&qid=1184572112&sr=8-2 Introduction to Algorithms]'', the de facto standard book on programming algorithms. He teaches the course [[Introduction to Algorithms I]] based on the text. | ||
| Line 14: | Line 14: | ||
* [http://www.columbia.edu/~cs2035/ Clifford Stein's website] | * [http://www.columbia.edu/~cs2035/ Clifford Stein's website] | ||
| − | [[Category:Computer | + | [[Category:Computer Science professors|Stein]] |
Latest revision as of 09:36, 1 November 2012
- See also Wikipedia's article about "Clifford Stein".
- See also Clifford Stein's entry in Columbia's directory.
Clifford Stein is a professor in both the IEOR and CS departments. He is best known as co-author of the book Introduction to Algorithms, the de facto standard book on programming algorithms. He teaches the course Introduction to Algorithms I based on the text.
Classroom quotes
- "I suppose if an adversary was trying to make your life difficult, he could think of a better way than to degrade the efficiency of your skip lists..." explaining why he didn't build in defensive measures into his example skip list algorithm.
- "Most people don't have a very good understanding of statistics. They think that it's a special thing when they have a dream and it comes true, but if you think about it, you have - what? 3 to 5 dreams per night, 365 nights a year and your dreams are generally somewhat based on what happens in your everyday life, so there's a pretty good chance that some of them will come true from time to time. What would be more interesting is if your dreams never came true. You're actually pretty special if you can say your dreams never come true."
