World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
15065
World Ranking
5497
National Ranking
2509

Research.com Recognitions

  • 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

Overview

Clifford Stein is affiliated with Columbia University in the United States and has an extensive research portfolio in computer science and engineering. The main fields of study covered by their work include Computer Science with 51 publications and Engineering with 22 publications. Their contributions span several subfields, including Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Industrial and Manufacturing Engineering, and Electrical and Electronic Engineering.

The topics Clifford Stein has focused on encompass a range of areas within optimization, algorithms, and systems. These topics include:

  • Optimization and Search Problems
  • Complexity and Algorithms in Graphs
  • Scheduling and Optimization Algorithms
  • Algorithms and Data Compression
  • Machine Learning and Algorithms
  • Transportation and Mobility Innovations
  • Cloud Computing and Resource Management

They have published papers in a variety of venues. The most frequent publication venues are:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Mathematical Programming
  • SIAM Journal on Computing
  • IEEE Transactions on Semiconductor Manufacturing

Recent papers include:

  • Reducing Datacenter Compute Carbon Footprint by Harnessing the Power of Specialization: Principles, Metrics, Challenges and Opportunities (2024, IEEE Transactions on Semiconductor Manufacturing)
  • Maximum Coverage in the Data Stream Model: Parameterized and Generalized (2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))
  • Queuing safely for elevator systems amidst a pandemic (2022, Production and Operations Management)
  • A general framework for handling commitment in online throughput maximization (2020, Mathematical Programming)
  • Estimating the Longest Increasing Subsequence in Nearly Optimal Time (2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS))

Clifford Stein collaborates frequently with several co-authors. The most frequent among them are:

  • Kirk Pruhs
  • Hao-Ting Wei
  • Benjamin Moseley
  • Eric Balkanski
  • Rudy Zhou

The scientist has received recognition through awards such as being named an ACM Fellow in 2012 for contributions to the theory of combinatorial optimization and the design and analysis of graph algorithms. Additionally, they were a Fellow of the Alfred P. Sloan Foundation in 1999.

Best Publications

  • Introduction to Algorithms, third edition

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

  • Introduction to Algorithms, Second Edition

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

  • A new approach to the minimum cut problem

    David R. Karger;Clifford Stein

  • Optimal time-critical scheduling via resource augmentation

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

  • Speed Scaling for Weighted Flow Time

    Nikhil Bansal;Kirk Pruhs;Cliff Stein

  • Fast approximation algorithms for multicommodity flow problems

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

  • Improved Approximation Algorithms for Shop Scheduling Problems

    David B. Shmoys;Clifford Stein;Joel Wein

  • Approximation Techniques for Average Completion Time Scheduling

    C. Chekuri;R. Motwani;B. Natarajan;C. Stein

  • Online stochastic packing applied to display ad allocation

    Jon Feldman;Monika Henzinger;Nitish Korula;Vahab S. Mirrokni

  • Approximation schemes for minimizing average weighted completion time with release dates

    F. Afrati;E. Bampis;C. Chekuri;D. Karger

  • Optimal time-critical scheduling via resource augmentation (extended abstract)

    Cynthia A. Phillips;Cliff Stein;Eric Torng;Joel Wein

  • Algorithmen - Eine Einführung

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

  • Improved Algorithms for Bipartite Network Flow

    Ravindra K. Ahuja;James B. Orlin;Clifford Stein

  • Minimizing average completion time in the presence of release dates

    Cynthia A. Phillips;Clifford Stein;Joel Wein

  • Section 24.3: Dijkstra's algorithm

    Thomas Cormen;Charles Leiserson;Ronald Rivest;Clifford Stein

  • Scheduling algorithms

    David Karger;Cliff Stein;Joel Wein

  • Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

    Philip Klein;Serge Plotkin;Clifford Stein;Eva Tardos

  • Budget optimization in search-based advertising auctions

    Jon Feldman;S Muthukrishnan;Martin Pal;Cliff Stein

  • Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

    David R. Karger;Philip Klein;Cliff Stein;Mikkel Thorup

  • Improved Scheduling Algorithms for Minsum Criteria

    Soumen Chakrabarti;Cynthia A. Phillips;Andreas S. Schulz;David B. Shmoys

  • Experimental study of minimum cut algorithms

    Chandra S. Chekuri;Andrew V. Goldberg;David R. Karger;Matthew S. Levine

Frequent Co-Authors

Cynthia A. Phillips
Cynthia A. Phillips Sandia National Laboratories
Alexandr Andoni
Alexandr Andoni Columbia University
Jason Nieh
Jason Nieh Columbia University
David B. Shmoys
David B. Shmoys Cornell University
David M. Mount
David M. Mount University of Maryland, College Park
Philip N. Klein
Philip N. Klein Brown University
Martin Skutella
Martin Skutella Technical University of Berlin

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring computer science in the USA unlocks diverse opportunities for both undergraduate and graduate students. With the flexibility of online education, you can now find associates degrees online to build foundational knowledge quickly or start your journey toward a tech career at your own pace.

For those aiming to advance quickly, quickest cheapest masters degree options allow you to fast-track your credentials without breaking the bank, making higher education more accessible than ever. Many programs also focus on practical skills that employers are seeking, especially if you choose one of the most valuable masters degrees that remain in high demand across tech and related industries.

Budget-conscious students can benefit from researching affordable online degree programs, which offer recognized qualifications at lower tuition rates. These flexible pathways open the door to rewarding careers in technology and set a strong foundation for future specialization.

Best Scientists Citing Clifford Stein

Trending Scientists

Recently Published Articles