Similar authors to follow
See more recommendations
About Clifford Stein
Stein's research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
Stein has published many influential papers in the leading conferences and journals in his fields of research, and has occupied a variety of editorial positions including in the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been funded by the National Science Foundation and the Sloan Foundation. As of November 1, 2015, his publications have been cited over 46,000 times, and he has an h-index of 42.
Stein 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 two textbooks:
Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest, which is currently the best-selling textbook in algorithms and has been translated into 8 languages. About 39,500 of Stein's 46,000 citations are made to this book.
Discrete Math for Computer Science, with Ken Bogart and Scot Drysdale, which is a new textbook that covers discrete math at an undergraduate level.
Stein earned his B.S.E. from Princeton University in 1987, a Master of Science from The Massachusetts Institute of Technology in 1989, and a PhD also from the Massachusetts Institute of Technology in 1992.
In recent years, Stein has built up close ties with the Norwegian research community which earned him an honorary doctorate from the University of Oslo (May 2010).
Bio from Wikipedia, the free encyclopedia. Photo by Sergio01 (Own work) [CC BY-SA 3.0 (http://creativecommons.org/licenses/by-sa/3.0) or GFDL (http://www.gnu.org/copyleft/fdl.html)], via Wikimedia Commons.
Customers Also Bought Items By
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.