This biography of a living person needs additional citations for verification .(March 2020) (Learn how and when to remove this template message) |

Clifford Stein | |
---|---|

Born | Clifford Seth Stein ^{ [1] }December 14, 1965 |

Nationality | American |

Alma mater | Massachusetts Institute of Technology Princeton University |

Scientific career | |

Fields | Computer Science |

Institutions | Columbia University Dartmouth College |

Thesis | Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems (1992) |

Doctoral advisor | David Shmoys |

**Clifford Seth Stein** (born December 14, 1965), a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire.

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.^{ [2] }

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.^{ [3] }^{ [4] }

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).

- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001).
*Introduction to Algorithms*(second ed.). MIT Press and McGraw-Hill. ISBN 0-262-53196-8.

In mathematics, two sets are said to be **disjoint sets** if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are *disjoint sets,* while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of more than two sets is called disjoint if any two distinct sets of the collection are disjoint.

**Ronald Linn Rivest** is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). His work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity.

A **greedy algorithm** is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum. In many problems, a greedy strategy does not usually produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.

**Amortisation** is paying off an amount owed over time by making planned, incremental payments of principal and interest. To amortise a loan means "to kill it off". In accounting, amortisation refers to charging or writing off an intangible asset's cost as an operational expense over its estimated useful life to reduce a company's taxable income.

**Ken Batcher**, full name **Kenneth Edward Batcher** is an emeritus professor of Computer Science at Kent State University. He also worked as a computer architect at Goodyear Aerospace in Akron, Ohio for 28 years.

The **MIT Press** is a university press affiliated with the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts.

In computer science, the **iterated logarithm** of , written log* , is the number of times the logarithm function must be iteratively applied before the result is less than or equal to . The simplest formal definition is the result of this recurrence relation:

**Charles Eric Leiserson** is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof. As part of this effort, he developed the Cilk multithreaded language. He invented the fat-tree interconnection network, a hardware-universal interconnection network used in many supercomputers, including the Connection Machine CM5, for which he was network architect. He helped pioneer the development of VLSI theory, including the retiming method of digital optimization with James B. Saxe and systolic arrays with H. T. Kung. He conceived of the notion of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally. He developed the Cilk language for multithreaded programming, which uses a provably good work-stealing algorithm for scheduling. Leiserson coauthored the standard algorithms textbook *Introduction to Algorithms* together with Thomas H. Cormen, Ronald L. Rivest, and Clifford Stein.

In geometry, two points are called **coincident** when they are actually the same point. More generally, any pair of congruent geometric objects positioned so that one lies precisely atop the other are said to coincide.

In computational geometry, the **line segment intersection problem** supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross).

* Introduction to Algorithms* is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation "

**Thomas H. Cormen** is the co-author of *Introduction to Algorithms*, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled *Algorithms Unlocked*. He is a professor of computer science at Dartmouth College and former Chairman of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program. His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

In computational geometry, a **bitonic tour** of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice.

In computer science, the **worst-case complexity** measures the resources that an algorithm requires given an input of arbitrary size. It gives an upper bound on the resources required by the algorithm.

**Dimitri Panteli Bertsekas** is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.

**Donald Bruce Johnson** was an American computer scientist, a researcher in the design and analysis of algorithms, and the founding chair of the computer science department at Dartmouth College.

In computer science, an **order statistic tree** is a variant of the binary search tree that supports two additional operations beyond insertion, lookup and deletion:

In computer science, a **mergeable heap** is an abstract data type, which is a heap supporting a merge operation.

**Jelani Osei Nelson** is a Professor of Electrical Engineering and Computer Science at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of *AddisCoder*, a computer science summer program for Ethiopian high school students in Addis Ababa.

In mathematics and computer science, an **algorithmic technique** is a general approach for implementing a process or computation.

- ↑ "Rebecca Ivry and Clifford Stein Wed".
*New York Times*. August 20, 1990. Retrieved April 29, 2015. - ↑ "Google Scholar Record for C. Stein".
- ↑ Stein, Clifford (1992). "Approximation algorithms for multicommodity flow and shop scheduling problems." Doctoral dissertation. MIT.
- ↑ Clifford Stein at the Mathematics Genealogy Project

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.