- Home
- Best Scientists - Computer Science
- Clifford Stein

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
38
Citations
12,365
134
World Ranking
6246
National Ranking
3007

2012 - ACM Fellow For contributions to the theory of combinatorial optimization and to the design and analysis of graph algorithms.

1999 - Fellow of Alfred P. Sloan Foundation

- Algorithm
- Computer network
- Combinatorics

His primary scientific interests are in Approximation algorithm, Mathematical optimization, Algorithm, Combinatorics and Scheduling. His research in Approximation algorithm intersects with topics in Linear programming, Graph theory, Computational complexity theory and Vertex. His biological study deals with issues like Flow shop scheduling, which deal with fields such as Round-robin scheduling.

His study in the fields of Parallel algorithm, Model of computation, Computational geometry and Analysis of parallel algorithms under the domain of Algorithm overlaps with other disciplines such as Data structure. Combinatorics connects with themes related to Discrete mathematics in his study. His research in Scheduling focuses on subjects like Time complexity, which are connected to Job shop scheduling problem, Linear ordering and Job shop.

- Introduction to Algorithms, third edition (2251 citations)
- Introduction to Algorithms, Second Edition (1962 citations)
- A new approach to the minimum cut problem (378 citations)

Combinatorics, Mathematical optimization, Approximation algorithm, Algorithm and Scheduling are his primary areas of study. The Combinatorics study which covers Discrete mathematics that intersects with Parallel algorithm and Blossom algorithm. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Rate-monotonic scheduling, Fair-share scheduling and Job shop scheduling.

His Approximation algorithm research is multidisciplinary, relying on both Linear programming, Multi-commodity flow problem, Combinatorial optimization and Vertex. Clifford Stein studies Algorithm, focusing on Computation in particular. Clifford Stein has researched Scheduling in several fields, including Time complexity, Theoretical computer science and Parallel computing.

- Combinatorics (31.67%)
- Mathematical optimization (30.83%)
- Approximation algorithm (24.17%)

- Algorithm (18.33%)
- Mathematical optimization (30.83%)
- Binary logarithm (8.33%)

The scientist’s investigation covers issues in Algorithm, Mathematical optimization, Binary logarithm, Combinatorics and Job shop scheduling. His work on Piecewise constant approximation, Reduction and Blossom algorithm as part of general Algorithm study is frequently linked to Spark and Simple, therefore connecting diverse disciplines of science. As a part of the same scientific study, Clifford Stein usually deals with the Mathematical optimization, concentrating on Scheduling and frequently concerns with Approximation algorithm.

His research investigates the link between Binary logarithm and topics such as Computation that cross with problems in Vertex and Sublinear function. His Combinatorics research integrates issues from Matching and Parallel algorithm. His Parallel algorithm research focuses on subjects like Transshipment problem, which are linked to Discrete mathematics.

- Parallel Graph Connectivity in Log Diameter Rounds (39 citations)
- Parallel Graph Connectivity in Log Diameter Rounds (29 citations)
- Algorithmen - Eine Einführung (23 citations)

- Algorithm
- Computer network
- Time complexity

His primary areas of investigation include Binary logarithm, Algorithm, Connectivity, Directed graph and Reachability. In most of his Binary logarithm studies, his work intersects topics such as Scalability. His Algorithm study incorporates themes from Sublinear function and Vertex.

His Connectivity study is related to the wider topic of Combinatorics. Log-log plot is the subject of his research, which falls under Discrete mathematics. His research is interdisciplinary, bridging the disciplines of Transshipment problem and Discrete mathematics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Introduction to Algorithms, third edition

Thomas H. Cormen;Charles E. Leiserson;Ronald L. Rivest;Clifford Stein.

**(2009)**

3724 Citations

Introduction to Algorithms, third edition

Thomas H. Cormen;Charles E. Leiserson;Ronald L. Rivest;Clifford Stein.

**(2009)**

3724 Citations

Introduction to Algorithms, Second Edition

Ronald L. Rivest;Charles E. Leiserson;Thomas H. Cormen;Clifford Stein.

**(2001)**

1980 Citations

Introduction to Algorithms, Second Edition

Ronald L. Rivest;Charles E. Leiserson;Thomas H. Cormen;Clifford Stein.

**(2001)**

1980 Citations

A new approach to the minimum cut problem

David R. Karger;Clifford Stein.

Journal of the ACM **(1996)**

576 Citations

A new approach to the minimum cut problem

David R. Karger;Clifford Stein.

Journal of the ACM **(1996)**

576 Citations

Optimal time-critical scheduling via resource augmentation

C.A. Phillips;C. Stein;E. Torng;J. Wein.

29. annual ACM symposium on the interface: computing science and statistics, El Paso, TX (United States), 4-17 May 1997 **(1997)**

517 Citations

Optimal time-critical scheduling via resource augmentation

C.A. Phillips;C. Stein;E. Torng;J. Wein.

29. annual ACM symposium on the interface: computing science and statistics, El Paso, TX (United States), 4-17 May 1997 **(1997)**

517 Citations

Fast approximation algorithms for multicommodity flow problems

Tom Leighton;Clifford Stein;Fillia Makedon;Éva Tardos.

symposium on the theory of computing **(1991)**

310 Citations

Fast approximation algorithms for multicommodity flow problems

Tom Leighton;Clifford Stein;Fillia Makedon;Éva Tardos.

symposium on the theory of computing **(1991)**

310 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

MIT

Sandia National Laboratories

MIT

Columbia University

Brown University

University of Maryland, College Park

Cornell University

Stanford University

University of Washington

University of Liverpool

Chinese Academy of Sciences

United States Geological Survey

California Institute of Technology

University of Modena and Reggio Emilia

Centre national de la recherche scientifique, CNRS

Bangor University

National Academies of Sciences, Engineering, and Medicine

Lawrence Livermore National Laboratory

Leiden University

Queen Mary University of London

Ghent University

Karolinska Institute

University of Florence

Centre national de la recherche scientifique, CNRS

California Institute of Technology

Something went wrong. Please try again later.