Cliff Stein

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 23

Top Topics

Scheduling Algorithm

Energy Efficient Routing

Matrix Multiplication

Independent Set

Top Venues

Publications

Yuri Faenza, Cliff Stein, Jia Wan
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. IPCO (2024)
Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Polylog-Competitive Deterministic Local Routing and Scheduling. STOC (2024)
Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Polylog-Competitive Deterministic Local Routing and Scheduling. CoRR (2024)
MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. CoRR (2019)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS (2019)
Shipra Agrawal, Mohammad Shadravan, Cliff Stein
Submodular Secretary Problem with Shortlists. ITCS (2019)
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA (2019)
Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
A general framework for handling commitment in online throughput maximization. CoRR (2018)
Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae
The Online Set Aggregation Problem. LATIN (2018)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein
Fast Algorithms for Knapsack via Convolution and Prediction. CoRR (2018)
Shipra Agrawal, Mohammad Shadravan, Cliff Stein
Submodular Secretary Problem with Shortlists. CoRR (2018)
Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP (2018)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein
Fast algorithms for knapsack via convolution and prediction. STOC (2018)
Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein
Resource cost aware scheduling. Eur. J. Oper. Res. 269 (2) (2018)
Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR (2017)
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR (2017)
Zhen Qiu, Cliff Stein, Yuan Zhong
Experimental Analysis of Algorithms for Coflow Scheduling. CoRR (2016)
Nourhan Sakr, Cliff Stein
An Empirical Study of Online Packet Scheduling Algorithms. CoRR (2016)
Aaron Bernstein, Cliff Stein
Faster Fully Dynamic Matchings with Small Approximation Ratios. SODA (2016)
Nourhan Sakr, Cliff Stein
An Empirical Study of Online Packet Scheduling Algorithms. SEA (2016)
Andrei Simion, Michael Collins, Cliff Stein
Towards a Convex HMM Surrogate for Word Alignment. EMNLP (2016)
Zhen Qiu, Cliff Stein, Yuan Zhong
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. SPAA (2015)
Aaron Bernstein, Cliff Stein
Fully Dynamic Matching in Bipartite Graphs. ICALP (1) (2015)
Andrei Arsene Simion, Michael Collins, Cliff Stein
A Family of Latent Variable Convex Relaxations for IBM Model 2. AAAI (2015)
Andrei Simion, Michael Collins, Cliff Stein
On A Strictly Convex IBM Model 1. EMNLP (2015)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR (2014)
Jelena Marasevic, Cliff Stein, Gil Zussman
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. CoRR (2014)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC (2014)
Anupam Gupta, Amit Kumar, Cliff Stein
Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA (2014)
Andrei Simion, Michael Collins, Cliff Stein
Some Experiments with a Convex IBM Model 2. EACL (2014)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA (2014)
Andrei Simion, Michael Collins, Cliff Stein
A Convex Alternative to IBM Model 2. EMNLP (2013)
Benjamin Moseley, Kirk Pruhs, Cliff Stein
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO (2013)
Benjamin Moseley, Kirk Pruhs, Cliff Stein
The Complexity of Scheduling for p-norms of Flow and Stretch CoRR (2013)
Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. Oper. Res. Lett. 41 (5) (2013)
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg (2012)
Eyjolfur Ingi Asgeirsson, Cliff Stein
Bounded-space online bin cover. J. Sched. 12 (5) (2009)
Eyjolfur Ingi Asgeirsson, Cliff Stein
Divide-and-Conquer Approximation Algorithm for Vertex Cover. SIAM J. Discret. Math. 23 (3) (2009)
Ana Radovanovic, Cliff Stein
Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources. Allerton (2008)
Eyjólfur Ingi Ásgeirsson, Cliff Stein
Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. ALENEX (2006)
Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright
LP decoding corrects a constant fraction of errors. ISIT (2004)