World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
15065
World Ranking
5498
National Ranking
2510

Clifford Stein publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Clifford Stein sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 165 publications — 33rd percentile

33% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Clifford Stein D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Clifford Stein sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 50 D-Index — 62nd percentile

62% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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