Clifford Stein | Academic Influence

Clifford Stein's AcademicInfluence.com Rankings

Clifford Stein

Computer Science

#169

World Rank

#176

Historical Rank

#101

USA Rank

Database

#7450

World Rank

#7723

Historical Rank

#914

USA Rank

computer-science Degrees

Download Badge

Computer Science

Clifford Stein's Degrees

Masters Computer Science Stanford University
Bachelors Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Clifford Stein Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Clifford Seth Stein , 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.

(See a Problem?)

Clifford Stein's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to Algorithms, 2nd edition. (2001) (3835)
Introduction to Algorithms, Second Edition (2001) (2902)
Introduction to Algorithms, third edition (2009) (2806)
Introduction to Algorithms, 3rd Edition (2009) (834)
A new approach to the minimum cut problem (1996) (476)
Optimal Time-Critical Scheduling via Resource Augmentation (1997) (369)
Fast approximation algorithms for multicommodity flow problems (1991) (291)
Online Stochastic Packing Applied to Display Ad Allocation (2010) (225)
Approximation techniques for average completion time scheduling (1997) (221)
Improved approximation algorithms for shop scheduling problems (1991) (212)
On the Capacity of Secure Network Coding (2004) (204)
Approximation schemes for minimizing average weighted completion time with release dates (1999) (201)
Minimizing average completion time in the presence of release dates (1998) (181)
Budget optimization in search-based advertising auctions (2006) (173)
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) (1997) (172)
Improved Algorithms for Bipartite Network Flow (1994) (166)
Rounding algorithms for a geometric embedding of minimum multiway cut (1999) (162)
Speed scaling for weighted flow time (2007) (154)
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (1994) (151)
Improved Scheduling Algorithms for Minsum Criteria (1996) (149)
Experimental study of minimum cut algorithms (1997) (140)
Improved approximation algorithms for unsplittable flow problems (1997) (135)
LP Decoding Corrects a Constant Fraction of Errors (2004) (118)
On distributing symmetric streaming computations (2008) (107)
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs (1997) (105)
An Õ(n2) algorithm for minimum cuts (1993) (99)
On the existence of schedules that are near-optimal for both makespan and total weighted completion time (1997) (97)
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks (2015) (97)
Long tours and short superstrings (1994) (95)
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow (1997) (94)
Scheduling Jobs that Arrive Over Time (Extended Abstract) (1995) (85)
Introduction to algorithms. Chapter 16. 2nd Edition (2001) (84)
Parallel Graph Connectivity in Log Diameter Rounds (2018) (78)
Approximating disjoint-path problems using packing integer programs (2004) (78)
Introduction to Algorithms -3/Ed. (2012) (74)
Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems (2005) (74)
An optimal online algorithm for packet scheduling with agreeable deadlines (2005) (65)
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs (2015) (59)
Approximation Algorithms for Single-Source Unsplittable Flow (2002) (57)
Better online buffer management (2007) (54)
Implementation of a Combinatorial Multicommodity Flow Algorithm (1991) (50)
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem (1996) (47)
Algorithm Engineering and Experiments (2002) (46)
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time (2019) (45)
Task Scheduling in Networks (1997) (44)
LP decoding achieves capacity (2005) (44)
FairTorrent: bringing fairness to peer-to-peer systems (2009) (41)
Improved bicriteria existence theorems for scheduling (2002) (40)
Scheduling Algorithms (2004) (40)
Parallel approximate undirected shortest paths via low hop emulators (2019) (39)
Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities (1990) (39)
Non-Preemptive Min-Sum Scheduling with Resource Augmentation (2007) (34)
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives (2002) (34)
Advance Service Reservations with Heterogeneous Customers (2018) (32)
How to Schedule When You Have to Buy Your Energy (2010) (31)
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem (2000) (30)
Approximating Semidefinite Packing Programs (2011) (29)
Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract) (1995) (29)
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis (2014) (26)
Approximation algorithms for multicommodity flow and shop scheduling problems (1992) (25)
Scheduling multi-task multi-agent systems (2001) (24)
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring (2005) (23)
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time (1998) (22)
Online scheduling of packets with agreeable deadlines (2012) (21)
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling (2006) (20)
Submodular Secretary Problem with Shortlists (2018) (19)
Short Superstrings and the Structure of Overlapping Strings (1995) (19)
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem (1998) (18)
Long Tours and Short Superstrings (Preliminary Version) (1994) (18)
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity (2019) (17)
FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems (2012) (17)
On the Complexity of Processing Massive, Unordered, Distributed Data (2006) (17)
Improved approximation algorithms for minsum criteria (1996) (16)
Job scheduling in rings (1994) (16)
Minimizing Makespan for the Lazy Bureaucrat Problem (2002) (15)
Solving maximum flow problems on real-world bipartite graphs (2009) (14)
Parallel algorithms for the assignment and minimum-cost flow problems (1993) (14)
A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems (2015) (14)
A Parallel Algorithm for Eliminating Cycles in Undirected Graphs (1990) (14)
A 2 2/3 Superstring Approximation Algorithm (1998) (13)
Proceedings of the eighteenth annual ACM-SIAM Symposium on discrete algorithms, SODA'07, New Orleans LA, USA, January 7-9, 2007 (2007) (13)
Scheduling Multi-task Agents (2001) (13)
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow (1999) (12)
Approximating the Minimum-Cost Maximum Flow is P-Complete (1992) (12)
Vertex Cover Approximations on Random Graphs (2007) (11)
A Convex Alternative to IBM Model 2 (2013) (11)
Exact and approximation algorithms for network flow and disjoint-path problems (1998) (11)
Feasible and Accurate Algorithms for Covering Semidefinite Programs (2010) (11)
Finding Real-Valued Single-Source Shortest Paths (1996) (11)
A general framework for handling commitment in online throughput maximization (2018) (10)
Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness (2011) (10)
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing (2017) (9)
Better Rounding Algorithms for a Geometric Embedding Relaxation of Minimum Multiway Cut (1999) (9)
Simultaneously Load Balancing for Every p-norm, With Reassignments (2017) (9)
Vertex Cover Approximations: Experiments and Observations (2005) (8)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2006) (8)
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions (2009) (8)
Adding Trust to P2P Distribution of Paid Content (2009) (8)
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization (2017) (7)
Online Stochastic Ad Allocation: Efficiency and Fairness (2010) (7)
Task Scheduling in Networks (Extended Abstract) (1994) (6)
Divide-and-Conquer Approximation Algorithm for Vertex Cover (2009) (6)
Matching Drivers to Riders: A Two-Stage Robust Approach (2020) (5)
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond (2019) (5)
An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem (2005) (4)
Clustering Data without Prior Knowledge (2000) (4)
Estimating the Longest Increasing Subsequence in Nearly Optimal Time (2021) (4)
Scheduling (Dagstuhl Seminar 16081) (2016) (4)
Scheduling When You Do Not Know the Number of Machines (2019) (4)
Mitigating the Effect of Free-Riders in BitTorrent using Trusted Agents (2008) (3)
An algorithm for minimum cuts (1993) (3)
Models of malicious behavior in sponsored search (2007) (3)
Experimental Analysis of Algorithms for Coflow Scheduling (2016) (3)
Scheduling with Speed Predictions (2022) (3)
Number 18 (2019) (3)
Extending Search Phases in the Micali-Vazirani Algorithm (2017) (3)
Scheduling in a Ring with Unit Capacity Links (1994) (3)
Incremental Edge Orientation in Forests (2021) (3)
Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments (2002) (2)
Implementation of a PTAS for Scheduling with Release Dates (2001) (2)
Distributed Job Scheduling in Rings (1997) (2)
Scheduling When You Don't Know the Number of Machines (2018) (2)
Queuing Safely for Elevator Systems Amidst a Pandemic (2020) (2)
An Empirical Study of Online Packet Scheduling Algorithms (2016) (2)
A parallel algorithm for approximating the minimum cycle cover (2005) (1)
Distributed Algorithms for Matching in Hypergraphs (2020) (1)
Simultaneously optimizing two scheduling objectives (2001) (1)
A 2-2/3 Approximation for the Shortest Superstring Problem (1995) (1)
Proceedings of 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (2009) (1)
Bidding strategically with budget-constraints in sequential auctions (2006) (1)
Solving Maximum Flow Problems on Real World Bipartite Graphs (2009) (1)
Partitioning planar graphs with costs and weights (2002) (1)
Centralized and distributed algorithms for network scheduling (1995) (1)
A Competitive Algorithm for Throughout Maximization on Identical Machines (2021) (1)
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis (2016) (1)
Scheduling an Industrial Production Facility (2004) (1)
54 : 2 A Fast Distributed Stateless Algorithm for α-Fair Packing Problems (2016) (1)
A Fast Distributed Algorithm for α-Fair Packing Problems (2015) (0)
Alenex workshop preface (2005) (0)
HALLUCINATION HELPS: ENERGY EFFICIENT VIRTUAL (2020) (0)
Distributed Scheduling in Finite Capacity Networks (1994) (0)
A General Framework for Handling Commitment in Online Admission Control (2019) (0)
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk) (2018) (0)
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity (2022) (0)
Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (2012) (0)
16. Greedy-Algorithmen (2017) (0)
Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources (2008) (0)
Selected Solutions Introduction to Algorithms (2022) (0)
Scheduling (Dagstuhl Seminar 18101) (2018) (0)
LTCC Course on Graph Theory 2013 / 14 Notes 3 Complexity and Algorithms (2013) (0)
A New Approach to the Minumum Cut Problem (1994) (0)
Aequitas: A Trusted P2P System for Paid Content Delivery (2007) (0)
Can P2P Replace Direct Download for Content Distribution (2007) (0)
A System And Method For Task Management (2018) (0)
Scheduling in Finite Capacity Networks (1999) (0)
A Case for P2P Delivery of Paid Content (2006) (0)
Competitive queuing policies for packet scheduling (2008) (0)

This paper list is powered by the following services:

Other Resources About Clifford Stein

What Schools Are Affiliated With Clifford Stein?

Clifford Stein is affiliated with the following schools:

What Are Clifford Stein's Academic Contributions?

Clifford Stein is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of

Clifford Stein has made the following academic contributions:

Introduction to Algorithms

Image Attributions

Image Source for Clifford Stein