Clifford Stein

11.4k total citations · 2 hit papers
105 papers, 5.4k citations indexed

About

Clifford Stein is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Industrial and Manufacturing Engineering. According to data from OpenAlex, Clifford Stein has authored 105 papers receiving a total of 5.4k indexed citations (citations by other indexed papers that have themselves been cited), including 71 papers in Computer Networks and Communications, 39 papers in Computational Theory and Mathematics and 24 papers in Industrial and Manufacturing Engineering. Recurrent topics in Clifford Stein's work include Optimization and Search Problems (56 papers), Complexity and Algorithms in Graphs (34 papers) and Scheduling and Optimization Algorithms (19 papers). Clifford Stein is often cited by papers focused on Optimization and Search Problems (56 papers), Complexity and Algorithms in Graphs (34 papers) and Scheduling and Optimization Algorithms (19 papers). Clifford Stein collaborates with scholars based in United States, United Kingdom and Germany. Clifford Stein's co-authors include Charles E. Leiserson, Thomas H. Cormen, Ronald L. Rivest, David R. Karger, Joel Wein, Stavros G. Kolliopoulos, Cynthia A. Phillips, Jon Feldman, Éva Tardos and Serge Plotkin and has published in prestigious journals such as Management Science, IEEE Transactions on Information Theory and ACM Transactions on Graphics.

In The Last Decade

Clifford Stein

101 papers receiving 4.9k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Introduction to Algorithms, third edition

2009 1.4k citations Clifford Stein et al. profile →
Introduction to Algorithms, Second Edition

2001 1.2k citations Clifford Stein et al. profile →

Peers

Countries citing papers authored by Clifford Stein

Since Specialization

Citations

This map shows the geographic impact of Clifford Stein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Clifford Stein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Clifford Stein more than expected).

Fields of papers citing papers by Clifford Stein

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Clifford Stein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Clifford Stein. The network helps show where Clifford Stein may publish in the future.

Co-authorship network of co-authors of Clifford Stein

This figure shows the co-authorship network connecting the top 25 collaborators of Clifford Stein. A scholar is included among the top collaborators of Clifford Stein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Clifford Stein. Clifford Stein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	A competitive algorithm for throughput maximization on identical machines 2024 ·Mathematical Programming ·Benjamin Moseley, Kirk Pruhs, Clifford Stein, (unknown)	1
2	Reducing Datacenter Compute Carbon Footprint by Harnessing the Power of Specialization: Principles, Metrics, Challenges and Opportunities 2024 ·IEEE Transactions on Semiconductor Manufacturing ·Tamar Eilam, Pradip Bose, Luca P. Carloni, Asaf Cidon, Hubertus Franke, Martha A. Kim, (unknown), M. Naghshineh, Pritish R. Parida, Clifford Stein, Asser Tantawi	6
3	Queuing safely for elevator systems amidst a pandemic 2022 ·Production and Operations Management ·(unknown), Charles C. Branas, Adam N. Elmachtoub, Clifford Stein, (unknown)	4
4	Incremental Edge Orientation in Forests 2021 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Michael A. Bender, Tsvi Kopelowitz, (unknown), Ely Porat, Clifford Stein	1
5	Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms 2018 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·(unknown), Shiri Chechik, (unknown), Clifford Stein, (unknown)	5
6	Extending Search Phases in the Micali-Vazirani Algorithm. 2017 ·Symposium on Experimental and Efficient Algorithms ·(unknown), Clifford Stein	1
7	Hallucination helps: energy efficient virtual circuit routing 2014 ·Symposium on Discrete Algorithms ·Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein	4
8	Maintaining Assignments Online: Matching, Scheduling, and Flows 2013 ·Anupam Gupta, Amit Kumar, Clifford Stein	10
9	On distributing symmetric streaming computations 2008 ·Symposium on Discrete Algorithms ·Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina	20
10	Better online buffer management 2007 ·Symposium on Discrete Algorithms ·Fei Li, Jay Sethuraman, Clifford Stein	28
11	Models of malicious behavior in sponsored search 2007 ·Spring Simulation Multiconference ·(unknown), David R. Phillips, Clifford Stein	3
12	Discrete mathematics for computer science 2006 ·CERN Document Server (European Organization for Nuclear Research) ·Kenneth P. Bogart, Clifford Stein, Robert L. Scot Drysdale	10
13	An optimal online algorithm for packet scheduling with agreeable deadlines 2005 ·Symposium on Discrete Algorithms ·Fei Li, Jay Sethuraman, Clifford Stein	31
14	LP decoding achieves capacity 2005 ·Symposium on Discrete Algorithms ·Jon Feldman, Clifford Stein	24
15	An O(n 5/2 log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. 2005 ·Canadian Conference on Computational Geometry ·Robert L. Scot Drysdale, Clifford Stein, (unknown)	1
16	Existence theorems, lower bounds and algorithms for scheduling to meet two objectives 2002 ·Symposium on Discrete Algorithms ·(unknown), Clifford Stein, Eric Torng, Patchrawat Uthaisombut	20
17	Long tours and short superstrings 2002 ·S. Rao Kosaraju, (unknown), Clifford Stein	24
18	Approximation Algorithms for the Minimum Bends Traveling Salesman Problem (Extended Abstract) 2000 ·Clifford Stein, (unknown)	3
19	Finding Real-Valued Single-Source Shortest Paths 1996 ·Stavros G. Kolliopoulos, Clifford Stein	2
20	Short Superstrings and the Structure of Overlapping Strings 1995 ·Journal of Computational Biology ·(unknown), Clifford Stein	7

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact