His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Professor Stein has published many influential papers in the leading conferences and journals in his field, and has occupied a variety of editorial positions including the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been supported by the National Science Foundation and Sloan Foundation. He is the winner of several prestigious awards including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of the two textbooks. Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest is currently the best-selling textbook in algorithms and has sold over half a million copies and been translated into 15 languages. Discrete Math for Computer Scientists , with Ken Bogart and Scot Drysdale, is a new text book which covers discrete math at an undergraduate level.
Introduction to Algorithms
by Tom Cormen, Charles Leiserson, Ron Rivest and Clifford Stein. The official web site for the book is http://mitpress.mit.edu/algorithms. There is also information at the McGraw Hill website. A bug list can be found here . Tom Cormen maintains a FAQ list.
Discrete Math for Computer Scientists.
by Clifford Stein, Scot Drysdale and Ken Borgart. Information on this book is available here
Prof. Clifford Stein Department of IEOR Columbia University 500 W. 120 St., MC 4704 New York, NY 10027