| 2026 | STOC | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2026 | STOC | Near-Optimal Directed Euclidean Spanners in High Dimensions. | Rajesh Jayaram, Shyamal Patel, Clifford Stein, Erik Waingarten, Tian Zhang |
| 2025 | CCGRID | Energy Efficient Scheduling of AI/ML Workloads on Multi Instance Gpus with Dynamic Repartitioning. | Ellie Lipe, Neel Karia, Connor Espenshade, Clifford Stein, Asser N. Tantawi, Olivier Tardieu |
| 2025 | SPAA | Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). | Kunal Agrawal, Michael A. Bender, Kirk Pruhs, Benjamin Moseley, Clifford Stein |
| 2023 | WAOA | Scheduling with Speed Predictions. | Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei |
| 2022 | FOCS | Estimating the Longest Increasing Subsequence in Nearly Optimal Time. | Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein |
| 2022 | IPCO | A Competitive Algorithm for Throughput Maximization on Identical Machines. | Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou |
| 2021 | ESA | Incremental Edge Orientation in Forests. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2020 | STOC | Parallel approximate undirected shortest paths via low hop emulators. | Alexandr Andoni, Clifford Stein, Peilin Zhong |
| 2020 | WAOA | Distributed Algorithms for Matching in Hypergraphs. | Oussama Hanguir, Clifford Stein |
| 2019 | ICALP | Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. | Alexandr Andoni, Clifford Stein, Peilin Zhong |
| 2018 | FOCS | Parallel Graph Connectivity in Log Diameter Rounds. | Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, Peilin Zhong |
| 2018 | ISAAC | Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). | Clifford Stein |
| 2018 | SODA | Scheduling When You Don't Know the Number of Machines. | Clifford Stein, Mingxian Zhong |
| 2017 | ESA | Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. | Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein |
| 2017 | RTSS | An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. | Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein |
| 2016 | ICALP | A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems. | Jelena Marasevic, Clifford Stein, Gil Zussman |
| 2014 | MOBIHOC | Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis. | Jelena Marasevic, Clifford Stein, Gil Zussman |
| 2010 | ESA | Online Stochastic Packing Applied to Display Ad Allocation. | Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein |
| 2010 | SIGGRAPH | Open Shading Language. | Larry Gritz, Clifford Stein, Christopher D. Kulla, Alejandro Conty |
| 2009 | ALENEX | Solving Maximum Flow Problems on Real World Bipartite Graphs. | Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat |
| 2009 | CoNEXT | FairTorrent: bringing fairness to peer-to-peer systems. | Alex Sherman, Jason Nieh, Clifford Stein |
| 2008 | SODA | On distributing symmetric streaming computations. | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina |
| 2007 | FOCS | Non-Preemptive Min-Sum Scheduling with Resource Augmentation. | Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber |
| 2007 | SODA | Speed scaling for weighted flow time. | Nikhil Bansal, Kirk Pruhs, Clifford Stein |
| 2007 | SODA | Better online buffer management. | Fei Li, Jay Sethuraman, Clifford Stein |
| 2006 | PODC | Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. | Bogdan Caprita, Jason Nieh, Clifford Stein |
| 2005 | IPCO | Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. | Garud Iyengar, David J. Phillips, Clifford Stein |
| 2005 | SODA | LP decoding achieves capacity. | Jon Feldman, Clifford Stein |
| 2005 | SODA | An optimal online algorithm for packet scheduling with agreeable deadlines. | Fei Li, Jay Sethuraman, Clifford Stein |
| 2005 | USENIX | Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. | Bogdan Caprita, Wong Chun Chan, Jason Nieh, Clifford Stein, Haoqiang Zheng |
| 2004 | IPCO | Scheduling an Industrial Production Facility. | Eyjolfur Ingi Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein |
| 2002 | SODA | Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. | April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut |
| 2001 | ALENEX | Implementation of a PTAS for Scheduling with Release Dates. | Clint Hepner, Clifford Stein |
| 2001 | IPCO | Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. | Clifford Stein, David P. Wagner |
| 2000 | ISMB | Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. | Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald |
| 1999 | FOCS | Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko |
| 1999 | IPCO | Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. | Stavros G. Kolliopoulos, Clifford Stein |
| 1999 | SODA | Improved Bicriteria Existence Theorems for Scheduling. | Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young |
| 1999 | STOC | Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. | David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young |
| 1998 | IPCO | An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein |
| 1998 | IPCO | Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. | Stavros G. Kolliopoulos, Clifford Stein |
| 1997 | FOCS | Improved Approximation Algorithms for Unsplittable Flow Problems. | Stavros G. Kolliopoulos, Clifford Stein |
| 1997 | SODA | Experimental Study of Minimum Cut Algorithms. | Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein |
| 1997 | SODA | Approximation Techniques for Average Completion Time Scheduling. | Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein |
| 1997 | STOC | Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). | Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein |
| 1996 | CPM | A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. | Chris Armen, Clifford Stein |
| 1996 | ICALP | Improved Scheduling Algorithms for Minsum Criteria. | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
| 1996 | IPCO | Finding Real-Valued Single-Source Shortest Paths. | Stavros G. Kolliopoulos, Clifford Stein |
| 1995 | WADS | Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). | Chris Armen, Clifford Stein |
| 1995 | WADS | Scheduling Jobs that Arrive Over Time (Extended Abstract). | Cynthia A. Phillips, Clifford Stein, Joel Wein |
| 1994 | FOCS | Long Tours and Short Superstrings (Preliminary Version) | S. Rao Kosaraju, James K. Park, Clifford Stein |
| 1994 | SPAA | Job Scheduling in Rings. | Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein |
| 1993 | STOC | An O~(n | David R. Karger, Clifford Stein |
| 1991 | SODA | Improved Approximation Algorithms for Shop Scheduling Problems. | David B. Shmoys, Clifford Stein, Joel Wein |
| 1991 | STOC | Fast Approximation Algorithms for Multicommodity Flow Problems | Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, va Tardos, Spyros Tragoudas |
| 1990 | STOC | Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities | Philip N. Klein, Clifford Stein, va Tardos |