Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities - Philip N. Klein; Clifford Stein 001; Éva Tardos (STOC, 1990)

A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. - Philip N. Klein; Clifford Stein 001 (Inf. Process. Lett., 1990)

Implementation of a Combinatorial Multicommodity Flow Algorithm. - Tishya Leong; Peter W. Shor; Clifford Stein 001 (Network Flows And Matching, 1991)

Approximating the Minimum-Cost Maximum Flow is P-Complete. - Clifford Stein 001; Joel Wein (Inf. Process. Lett., 1992)

Approximation algorithms for multicommodity flow and shop scheduling problems. - Clifford Stein 001 (1992)

An O (n2) algorithm for minimum cuts. - David R. Karger; Clifford Stein 001 (STOC, 1993)

A Parallel Algorithm for Approximating the Minimum Cycle Cover. - Philip N. Klein; Clifford Stein 001 (Algorithmica, 1993)

Parallel algorithms for the assignment and minimum-cost flow problems. - James B. Orlin; Clifford Stein 001 (Oper. Res. Lett., 1993)

Long Tours and Short Superstrings (Preliminary Version) - S. Rao Kosaraju; James K. Park; Clifford Stein 001 (FOCS, 1994)

Job Scheduling in Rings. - Perry Fizzano; David R. Karger; Clifford Stein 001; Joel Wein (SPAA, 1994)

Task Scheduling in Networks (Extended Abstract). - Cynthia A. Phillips; Clifford Stein 001; Joel Wein (SWAT, 1994)

Improved Algorithms for Bipartite Network Flow. - Ravindra K. Ahuja; James B. Orlin; Clifford Stein 001; Robert Endre Tarjan (SIAM J. Comput., 1994)

Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. - Philip N. Klein; Serge A. Plotkin; Clifford Stein 001; Éva Tardos (SIAM J. Comput., 1994)

Improved Approximation Algorithms for Shop Scheduling Problems. - David B. Shmoys; Clifford Stein 001; Joel Wein (SIAM J. Comput., 1994)

Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). - Chris Armen; Clifford Stein 001 (WADS, 1995)

Scheduling Jobs that Arrive Over Time (Extended Abstract). - Cynthia A. Phillips; Clifford Stein 001; Joel Wein (WADS, 1995)

Short Superstrings and the Structure of Overlapping Strings. - Chris Armen; Clifford Stein 001 (J. Comput. Biol., 1995)

Fast Approximation Algorithms for Multicommodity Flow Problems. - Frank Thomson Leighton; Fillia Makedon; Serge A. Plotkin; Clifford Stein 001; Éva Tardos; Spyros Tragoudas (J. Comput. Syst. Sci., 1995)

A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. - Chris Armen; Clifford Stein 001 (CPM, 1996)

Improved Scheduling Algorithms for Minsum Criteria. - Soumen Chakrabarti; Cynthia A. Phillips; Andreas S. Schulz; David B. Shmoys; Clifford Stein 001; Joel Wein (ICALP, 1996)

Finding Real-Valued Single-Source Shortest Paths. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1996)

A New Approach to the Minimum Cut Problem. - David R. Karger; Clifford Stein 001 (J. ACM, 1996)

Improved Approximation Algorithms for Unsplittable Flow Problems. - Stavros G. Kolliopoulos; Clifford Stein 001 (FOCS, 1997)

Experimental Study of Minimum Cut Algorithms. - Chandra Chekuri; Andrew V. Goldberg; David R. Karger; Matthew S. Levine; Clifford Stein 001 (SODA, 1997)

Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). - Cynthia A. Phillips; Clifford Stein 001; Eric Torng; Joel Wein (STOC, 1997)

Distributed Job Scheduling in Rings. - Perry Fizzano; David R. Karger; Clifford Stein 001; Joel Wein (J. Parallel Distributed Comput., 1997)

On the existence of schedules that are near-optimal for both makespan and total weighted completion time. - Clifford Stein 001; Joel Wein (Oper. Res. Lett., 1997)

Task Scheduling in Networks. - Cynthia A. Phillips; Clifford Stein 001; Joel Wein (SIAM J. Discret. Math., 1997)

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. - Andrew V. Goldberg; Jeffrey D. Oldham; Serge A. Plotkin; Clifford Stein 001 (IPCO, 1998)

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1998)

A 2 2/3 Superstring Approximation Algorithm. - Chris Armen; Clifford Stein 001 (Discret. Appl. Math., 1998)

Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. - Stavros G. Kolliopoulos; Clifford Stein 001 (J. Algorithms, 1998)

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. - Cynthia A. Phillips; Andreas S. Schulz; David B. Shmoys; Clifford Stein 001; Joel Wein (J. Comb. Optim., 1998)

Minimizing average completion time in the presence of release dates. - Cynthia A. Phillips; Clifford Stein 001; Joel Wein (Math. Program., 1998)

Scheduling Algorithms. - David R. Karger; Cliff Stein 001; Joel Wein (Algorithms and Theory of Computation Handbook, 1999)

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 001; Maxim Sviridenko (FOCS, 1999)

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1999)

Improved Bicriteria Existence Theorems for Scheduling. - Javed A. Aslam; April Rasala; Clifford Stein 001; Neal E. Young (SODA, 1999)

Clustering Data without Prior Knowledge. - Javed A. Aslam; Alain Leblanc; Clifford Stein 001 (WAE, 2000)

Introduction to Algorithms, Second Edition - Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein 001 (The MIT Press and McGraw-Hill Book Company, 2001)

Scheduling multi-task multi-agent systems. - Rong Xie; Daniela Rus; Clifford Stein 001 (Agents, 2001)

Implementation of a PTAS for Scheduling with Release Dates. - Clint Hepner; Clifford Stein 001 (ALENEX, 2001)

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. - Clifford Stein 001; David P. Wagner (IPCO, 2001)

Simultaneously optimizing two scheduling objectives. - Clifford Stein 001 (IPDPS, 2001)

Scheduling Multi-task Agents. - Rong Xie; Daniela Rus; Clifford Stein 001 (Mobile Agents, 2001)

Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. - Christopher Bailey-Kellogg; John J. Kelley 001; Clifford Stein 001; Bruce Randall Donald (J. Comput. Biol., 2001)

Approximation Techniques for Average Completion Time Scheduling. - Chandra Chekuri; Rajeev Motwani 001; B. Natarajan; Clifford Stein 001 (SIAM J. Comput., 2001)

Approximation Algorithms for Single-Source Unsplittable Flow. - Stavros G. Kolliopoulos; Clifford Stein 001 (SIAM J. Comput., 2001)

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. - April Rasala; Clifford Stein 001; Eric Torng; Patchrawat Uthaisombut (SODA, 2002)

Minimizing Makespan for the Lazy Bureaucrat Problem. - Clint Hepner; Clifford Stein 001 (SWAT, 2002)

Optimal Time-Critical Scheduling via Resource Augmentation. - Cynthia A. Phillips; Clifford Stein 001; Eric Torng; Joel Wein (Algorithmica, 2002)

Networks and Flows. - Clifford Stein 001; Lisa Fleischer; Douglas R. Shier; Prakash Mirchandani; David Simchi-Levi (Handbook of Graph Theory, 2003)

Scheduling an Industrial Production Facility. - Eyjolfur Ingi Asgeirsson; Jonathan W. Berry; Cynthia A. Phillips; David J. Phillips; Clifford Stein 001; Joel Wein (IPCO, 2004)

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. - David R. Karger; Philip N. Klein; Clifford Stein 001; Mikkel Thorup; Neal E. Young (Math. Oper. Res., 2004)

Approximating disjoint-path problems using packing integer programs. - Stavros G. Kolliopoulos; Clifford Stein 001 (Math. Program., 2004)

An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. - Robert L. Scot Drysdale; Clifford Stein 001; David P. Wagner (CCCG, 2005)

Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. - Garud Iyengar; David J. Phillips; Clifford Stein 001 (IPCO, 2005)

LP decoding achieves capacity. - Jon Feldman; Clifford Stein 001 (SODA, 2005)

An optimal online algorithm for packet scheduling with agreeable deadlines. - Fei Li 001; Jay Sethuraman; Clifford Stein 001 (SODA, 2005)

Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. - Bogdan Caprita; Wong Chun Chan; Jason Nieh; Clifford Stein 001; Haoqiang Zheng (USENIX ATC, General Track, 2005)

Vertex Cover Approximations: Experiments and Observations. - Eyjolfur Ingi Asgeirsson; Clifford Stein 001 (WEA, 2005)

Discrete mathematics for computer science. - Kenneth P. Bogart; Clifford Stein 001; Robert L. Scot Drysdale (Key College Publishing, 2006)

Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. - Eyjólfur Ingi Ásgeirsson; Cliff Stein 001 (ALENEX, 2006)

Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. - Bogdan Caprita; Jason Nieh; Clifford Stein 001 (PODC, 2006)

On the Complexity of Processing Massive, Unordered, Distributed Data - Jon Feldman; S. Muthukrishnan 001; Anastasios Sidiropoulos; Clifford Stein 001; Zoya Svitkina (CoRR, 2006)

Non-Preemptive Min-Sum Scheduling with Resource Augmentation. - Nikhil Bansal 001; Ho-Leung Chan; Rohit Khandekar; Kirk Pruhs; Clifford Stein 001; Baruch Schieber (FOCS, 2007)

Budget optimization in search-based advertising auctions. - Jon Feldman; S. Muthukrishnan 001; Martin Pál; Clifford Stein 001 (EC, 2007)

Better online buffer management. - Fei Li 001; Jay Sethuraman; Clifford Stein 001 (SODA, 2007)

Models of malicious behavior in sponsored search. - Garud Iyengar; David J. Phillips; Clifford Stein 001 (SpringSim (3), 2007)

Vertex Cover Approximations on Random Graphs. - Eyjolfur Ingi Asgeirsson; Clifford Stein 001 (WEA, 2007)

LP Decoding Corrects a Constant Fraction of Errors. - Jon Feldman; Tal Malkin; Rocco A. Servedio; Clifford Stein 001; Martin J. Wainwright (IEEE Trans. Inf. Theory, 2007)

Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources. - Ana Radovanovic; Cliff Stein 001 (Allerton, 2008)

Introduction to Algorithms, 3rd Edition. - Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein 001 (MIT Press, 2009)

FairTorrent: bringing fairness to peer-to-peer systems. - Alex Sherman; Jason Nieh; Clifford Stein 001 (CoNEXT, 2009)

Adding Trust to P2P Distribution of Paid Content. - Alex Sherman; Angelos Stavrou; Jason Nieh; Angelos D. Keromytis; Clifford Stein 001 (ISC, 2009)

An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. - David P. Wagner; Robert L. Scot Drysdale; Clifford Stein 001 (Comput. Geom., 2009)

Bounded-space online bin cover. - Eyjolfur Ingi Asgeirsson; Cliff Stein 001 (J. Sched., 2009)

Speed Scaling for Weighted Flow Time. - Nikhil Bansal 001; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2009)

Divide-and-Conquer Approximation Algorithm for Vertex Cover. - Eyjolfur Ingi Asgeirsson; Cliff Stein 001 (SIAM J. Discret. Math., 2009)

How to Schedule When You Have to Buy Your Energy. - Kirk Pruhs; Clifford Stein 001 (APPROX-RANDOM, 2010)

Online Stochastic Packing Applied to Display Ad Allocation. - Jon Feldman; Monika Henzinger; Nitish Korula; Vahab S. Mirrokni; Clifford Stein 001 (ESA (1), 2010)

Feasible and Accurate Algorithms for Covering Semidefinite Programs. - Garud Iyengar; David J. Phillips; Clifford Stein 001 (SWAT, 2010)

Online Stochastic Ad Allocation: Efficiency and Fairness - Jon Feldman; Monika Henzinger; Nitish Korula; Vahab S. Mirrokni; Clifford Stein 001 (CoRR, 2010)

On distributing symmetric streaming computations. - Jon Feldman; S. Muthukrishnan 001; Anastasios Sidiropoulos; Clifford Stein 001; Zoya Svitkina (ACM Trans. Algorithms, 2010)

Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness - Rodrigo A. Carrasco; Garud Iyengar; Clifford Stein 001 (CoRR, 2011)

Solving maximum flow problems on real-world bipartite graphs. - Cosmin Silvestru Negruseri; Mircea Bogdan Pasoi; Barbara Stanley; Clifford Stein 001; Cristian George Strat (ACM J. Exp. Algorithmics, 2011)

Approximating Semidefinite Packing Programs. - Garud Iyengar; David J. Phillips; Clifford Stein 001 (SIAM J. Optim., 2011)

Multicast Routing for Energy Minimization Using Speed Scaling. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Cliff Stein 001 (MedAlg, 2012)

Online scheduling of packets with agreeable deadlines. - Lukasz Jez; Fei Li 001; Jay Sethuraman; Clifford Stein 001 (ACM Trans. Algorithms, 2012)

FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems. - Alex Sherman; Jason Nieh; Clifford Stein 001 (IEEE/ACM Trans. Netw., 2012)

A Convex Alternative to IBM Model 2. - Andrei Simion; Michael Collins 001; Cliff Stein 001 (EMNLP, 2013)

The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (IPCO, 2013)

The Complexity of Scheduling for p-norms of Flow and Stretch - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (CoRR, 2013)

Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. - Rodrigo A. Carrasco; Garud Iyengar; Cliff Stein 001 (Oper. Res. Lett., 2013)

Some Experiments with a Convex IBM Model 2. - Andrei Simion; Michael Collins 001; Cliff Stein 001 (EACL, 2014)

Maintaining Assignments Online: Matching, Scheduling, and Flows. - Anupam Gupta 001; Amit Kumar 001; Cliff Stein 001 (SODA, 2014)

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. - Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Cliff Stein 001 (STOC, 2014)

A Family of Latent Variable Convex Relaxations for IBM Model 2. - Andrei Arsene Simion; Michael Collins 001; Cliff Stein 001 (AAAI, 2015)

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs; Kevin Schewior; Clifford Stein 001 (APPROX-RANDOM, 2015)

On A Strictly Convex IBM Model 1. - Andrei Simion; Michael Collins 001; Cliff Stein 001 (EMNLP, 2015)

Fully Dynamic Matching in Bipartite Graphs. - Aaron Bernstein; Cliff Stein 001 (ICALP (1), 2015)

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. - Zhen Qiu; Cliff Stein 001; Yuan Zhong 001 (SPAA, 2015)

A Fast Distributed Algorithm for α-Fair Packing Problems. - Jelena Marasevic; Clifford Stein 001; Gil Zussman (CoRR, 2015)

Towards a Convex HMM Surrogate for Word Alignment. - Andrei Simion; Michael Collins 001; Cliff Stein 001 (EMNLP, 2016)

A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems. - Jelena Marasevic; Clifford Stein 001; Gil Zussman (ICALP, 2016)

Faster Fully Dynamic Matchings with Small Approximation Ratios. - Aaron Bernstein; Cliff Stein 001 (SODA, 2016)

Experimental Analysis of Algorithms for Coflow Scheduling. - Zhen Qiu; Clifford Stein 001; Yuan Zhong 001 (SEA, 2016)

An Empirical Study of Online Packet Scheduling Algorithms. - Nourhan Sakr; Cliff Stein 001 (SEA, 2016)

Scheduling (Dagstuhl Seminar 16081). - Nikhil Bansal 001; Nicole Megow; Clifford Stein 001 (Dagstuhl Reports, 2016)

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (ESA, 2017)

Simultaneously Load Balancing for Every p-norm, With Reassignments. - Aaron Bernstein; Tsvi Kopelowitz; Seth Pettie; Ely Porat; Clifford Stein 001 (ITCS, 2017)

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (RTSS, 2017)

Extending Search Phases in the Micali-Vazirani Algorithm. - Michael Huang 003; Clifford Stein 001 (SEA, 2017)

Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. - Jelena Marasevic; Clifford Stein 001; Gil Zussman (Algorithmica, 2017)

Parallel Graph Connectivity in Log Diameter Rounds. - Alexandr Andoni; Zhao Song 002; Clifford Stein 001; Zhengyu Wang; Peilin Zhong (FOCS, 2018)

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. - Moab Arar; Shiri Chechik; Sarel Cohen; Cliff Stein 001; David Wajc (ICALP, 2018)

Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). - Clifford Stein 001 (ISAAC, 2018)

The Online Set Aggregation Problem. - Rodrigo A. Carrasco; Kirk Pruhs; Cliff Stein 001; José Verschae (LATIN, 2018)

Scheduling When You Don't Know the Number of Machines. - Clifford Stein 001; Mingxian Zhong (SODA, 2018)

Fast algorithms for knapsack via convolution and prediction. - MohammadHossein Bateni; MohammadTaghi Hajiaghayi; Saeed Seddighin; Cliff Stein 001 (STOC, 2018)

Scheduling (Dagstuhl Seminar 18101). - Magnús M. Halldórsson; Nicole Megow; Clifford Stein 001 (Dagstuhl Reports, 2018)

Resource cost aware scheduling. - Rodrigo A. Carrasco; Garud Iyengar; Cliff Stein 001 (Eur. J. Oper. Res., 2018)

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Cliff Stein 001; Madhu Sudan 001 (FOCS, 2019)

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. - Alexandr Andoni; Clifford Stein 001; Peilin Zhong (ICALP, 2019)

Submodular Secretary Problem with Shortlists. - Shipra Agrawal 001; Mohammad Shadravan; Cliff Stein 001 (ITCS, 2019)

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. - Sepehr Assadi; MohammadHossein Bateni; Aaron Bernstein; Vahab S. Mirrokni; Cliff Stein 001 (SODA, 2019)

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. - MohammadTaghi Hajiaghayi; Silvio Lattanzi; Saeed Seddighin; Cliff Stein 001 (CoRR, 2019)

Parallel approximate undirected shortest paths via low hop emulators. - Alexandr Andoni; Clifford Stein 001; Peilin Zhong (STOC, 2020)

Distributed Algorithms for Matching in Hypergraphs. - Oussama Hanguir; Clifford Stein 001 (WAOA, 2020)

Advance Service Reservations with Heterogeneous Customers. - Clifford Stein 001; Van-Anh Truong; Xinshang Wang (Manag. Sci., 2020)

A general framework for handling commitment in online throughput maximization. - Lin Chen 009; Franziska Eberle; Nicole Megow; Kevin Schewior; Clifford Stein 001 (Math. Program., 2020)

Hallucination Helps: Energy Efficient Virtual Circuit Routing. - Antonios Antoniadis 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2020)

Scheduling When You Do Not Know the Number of Machines. - Clifford Stein 001; Mingxian Zhong (ACM Trans. Algorithms, 2020)

Matching Drivers to Riders: A Two-Stage Robust Approach. - Omar El Housni; Vineet Goyal; Oussama Hanguir; Clifford Stein 001 (APPROX-RANDOM, 2021)

Incremental Edge Orientation in Forests. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Ely Porat; Clifford Stein 001 (ESA, 2021)

A Competitive Algorithm for Throughout Maximization on Identical Machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (CoRR, 2021)

Estimating the Longest Increasing Subsequence in Nearly Optimal Time. - Alexandr Andoni; Negev Shekel Nosatzki; Sandip Sinha; Clifford Stein 001 (FOCS, 2022)

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity. - Yuri Faenza; Clifford Stein 001; Jia Wan 002 (CoRR, 2022)

Energy-Efficient Scheduling with Predictions. - Eric Balkanski; Noémie Périvier; Clifford Stein 001; Hao-Ting Wei (NeurIPS, 2023)

Learning-Augmented Online Packet Scheduling with Deadlines. - Clifford Stein 001; Hao-Ting Wei (CoRR, 2023)

A randomized algorithm for online metric b-matching. - Bala Kalyanasundaram; Kirk Pruhs; Clifford Stein 001 (Oper. Res. Lett., 2023)

Drawing Competitive Districts in Redistricting. - Gabriel Chuang; Oussama Hanguir; Clifford Stein 001 (FORC, 2024)

Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. - Yuri Faenza; Cliff Stein 001; Jia Wan 002 (IPCO, 2024)

Polylog-Competitive Deterministic Local Routing and Scheduling. - Bernhard Haeupler; Shyamal Patel; Antti Roeyskoe; Cliff Stein 001; Goran Zuzic (STOC, 2024)

Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. - Ravishankar Krishnaswamy; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2024)

A competitive algorithm for throughput maximization on identical machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (Math. Program., 2024)

Energy Efficient Scheduling of AI/ML Workloads on Multi-Instance GPUs with Dynamic Repartitioning. - Ellie Lipe; Neel Karia; Clifford Stein 001; Connor Espenshade; Olivier Tardieu; Asser N. Tantawi (IPDPS (Workshops), 2025)

Forward-backward Contention Resolution Schemes for Fair Rationing. - Will Ma; Calum MacRury; Cliff Stein 001 (EC, 2025)

A Simple Algorithm for Dynamic Carpooling with Recourse. - Yuval Efron; Shyamal Patel; Cliff Stein 001 (SOSA, 2025)

Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). - Kunal Agrawal 001; Michael A. Bender; Kirk Pruhs; Benjamin Moseley; Clifford Stein 001 (SPAA, 2025)

Scheduling with Speed Predictions. - Eric Balkanski; Tingting Ou; Clifford Stein 001; Hao-Ting Wei (Theory Comput. Syst., 2025)

Waiting is worth it and can be improved with predictions. - Ya-Chun Liang; Meng-Hsi Li; Chung-Shou Liao; Clifford Stein 001 (CoRR, 2025)