Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDClifford Stein 0001
Cliff Stein 0001
Person information
- affiliation: Columbia University, New York City, USA
Other persons with the same name
- Clifford Stein 0002 — Sony Pictures Imageworks
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c92]Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein:
Matching Drivers to Riders: A Two-Stage Robust Approach. APPROX-RANDOM 2021: 12:1-12:22- [c91]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - [i28]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. CoRR abs/2107.02318 (2021) - 2020
- [j40]Clifford Stein, Van-Anh Truong, Xinshang Wang
:
Advance Service Reservations with Heterogeneous Customers. Manag. Sci. 66(7): 2929-2950 (2020) - [j39]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein:
A general framework for handling commitment in online throughput maximization. Math. Program. 183(1): 215-247 (2020) - [j38]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [j37]Clifford Stein, Mingxian Zhong:
Scheduling When You Do Not Know the Number of Machines. ACM Trans. Algorithms 16(1): 9:1-9:20 (2020) - [c90]Alexandr Andoni, Clifford Stein, Peilin Zhong:
Parallel approximate undirected shortest paths via low hop emulators. STOC 2020: 322-335 - [c89]Oussama Hanguir, Clifford Stein:
Distributed Algorithms for Matching in Hypergraphs. WAOA 2020: 30-46 - [i27]Oussama Hanguir, Clifford Stein:
Distributed Algorithms for Matching in Hypergraphs. CoRR abs/2009.09605 (2020)
2010 – 2019
- 2019
- [c88]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c87]Alexandr Andoni, Clifford Stein, Peilin Zhong:
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. ICALP 2019: 14:1-14:16 - [c86]Shipra Agrawal, Mohammad Shadravan, Cliff Stein:
Submodular Secretary Problem with Shortlists. ITCS 2019: 1:1-1:19 - [c85]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO 2019: 141-154 - [c84]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: 1616-1635 - [i26]Alexandr Andoni, Clifford Stein, Peilin Zhong:
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. CoRR abs/1905.00850 (2019) - [i25]MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein:
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. CoRR abs/1905.01748 (2019) - [i24]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR abs/1909.03478 (2019) - [i23]Alexandr Andoni, Clifford Stein, Peilin Zhong:
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators. CoRR abs/1911.01956 (2019) - 2018
- [j36]Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein:
Resource cost aware scheduling. Eur. J. Oper. Res. 269(2): 621-632 (2018) - [c83]Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, Peilin Zhong:
Parallel Graph Connectivity in Log Diameter Rounds. FOCS 2018: 674-685 - [c82]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP 2018: 7:1-7:16 - [c81]Clifford Stein:
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). ISAAC 2018: 2:1-2:1 - [c80]Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae:
The Online Set Aggregation Problem. LATIN 2018: 245-259 - [c79]Clifford Stein, Mingxian Zhong:
Scheduling When You Don't Know the Number of Machines. SODA 2018: 1261-1273 - [c78]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast algorithms for knapsack via convolution and prediction. STOC 2018: 1269-1282 - [i22]Alexandr Andoni, Clifford Stein, Zhao Song, Zhengyu Wang, Peilin Zhong:
Parallel Graph Connectivity in Log Diameter Rounds. CoRR abs/1805.03055 (2018) - [i21]Shipra Agrawal, Mohammad Shadravan, Cliff Stein:
Submodular Secretary Problem with Shortlists. CoRR abs/1809.05082 (2018) - [i20]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A general framework for handling commitment in online throughput maximization. CoRR abs/1811.08238 (2018) - [i19]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast Algorithms for Knapsack via Convolution and Prediction. CoRR abs/1811.12554 (2018) - [i18]Magnús M. Halldórsson, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports 8(3): 1-20 (2018) - 2017
- [j35]Jelena Marasevic, Clifford Stein, Gil Zussman:
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. Algorithmica 78(2): 521-557 (2017) - [c77]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c76]Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein:
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS 2017: 51:1-51:14 - [c75]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [c74]Michael Huang, Clifford Stein:
Extending Search Phases in the Micali-Vazirani Algorithm. SEA 2017: 10:1-10:19 - [i17]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - [i16]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - [i15]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR abs/1711.06625 (2017) - 2016
- [c73]Andrei Simion, Michael Collins, Cliff Stein:
Towards a Convex HMM Surrogate for Word Alignment. EMNLP 2016: 531-540 - [c72]Jelena Marasevic, Clifford Stein, Gil Zussman:
A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems. ICALP 2016: 54:1-54:15 - [c71]Aaron Bernstein, Cliff Stein:
Faster Fully Dynamic Matchings with Small Approximation Ratios. SODA 2016: 692-711 - [c70]Zhen Qiu, Clifford Stein, Yuan Zhong:
Experimental Analysis of Algorithms for Coflow Scheduling. SEA 2016: 262-277 - [c69]Nourhan Sakr, Cliff Stein:
An Empirical Study of Online Packet Scheduling Algorithms. SEA 2016: 278-293 - [i14]Nourhan Sakr, Cliff Stein:
An Empirical Study of Online Packet Scheduling Algorithms. CoRR abs/1603.07947 (2016) - [i13]Zhen Qiu, Cliff Stein, Yuan Zhong:
Experimental Analysis of Algorithms for Coflow Scheduling. CoRR abs/1603.07981 (2016) - [i12]Nikhil Bansal, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 16081). Dagstuhl Reports 6(2): 97-118 (2016) - 2015
- [c68]Andrei Arsene Simion, Michael Collins, Cliff Stein:
A Family of Latent Variable Convex Relaxations for IBM Model 2. AAAI 2015: 2318-2324 - [c67]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein:
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM 2015: 96-109 - [c66]Andrei Simion, Michael Collins, Cliff Stein:
On A Strictly Convex IBM Model 1. EMNLP 2015: 221-226 - [c65]Aaron Bernstein, Cliff Stein:
Fully Dynamic Matching in Bipartite Graphs. ICALP (1) 2015: 167-179 - [c64]Zhen Qiu, Cliff Stein, Yuan Zhong:
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. SPAA 2015: 294-303 - [i11]Jelena Marasevic, Clifford Stein, Gil Zussman:
A Fast Distributed Algorithm for α-Fair Packing Problems. CoRR abs/1502.03372 (2015) - [i10]Aaron Bernstein, Clifford Stein:
Fully Dynamic Matching in Bipartite Graphs. CoRR abs/1506.07076 (2015) - 2014
- [c63]Andrei Simion, Michael Collins, Cliff Stein:
Some Experiments with a Convex IBM Model 2. EACL 2014: 180-184 - [c62]Jelena Marasevic, Clifford Stein, Gil Zussman:
Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis. MobiHoc 2014: 367-376 - [c61]Anupam Gupta, Amit Kumar, Cliff Stein:
Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA 2014: 468-479 - [c60]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c59]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC 2014: 734-743 - [i9]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR abs/1403.6207 (2014) - [i8]Jelena Marasevic, Cliff Stein, Gil Zussman:
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. CoRR abs/1406.3671 (2014) - 2013
- [j34]Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein:
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. Oper. Res. Lett. 41(5): 436-441 (2013) - [c58]Andrei Simion, Michael Collins, Cliff Stein:
A Convex Alternative to IBM Model 2. EMNLP 2013: 1574-1583 - [c57]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289 - [i7]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013) - 2012
- [j33]Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein:
Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9(1): 5:1-5:11 (2012) - [j32]Alex Sherman, Jason Nieh, Clifford Stein:
FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems. IEEE/ACM Trans. Netw. 20(5): 1361-1374 (2012) - [c56]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51 - 2011
- [j31]Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat:
Solving maximum flow problems on real-world bipartite graphs. ACM J. Exp. Algorithmics 16 (2011) - [j30]Garud Iyengar, David J. Phillips, Clifford Stein:
Approximating Semidefinite Packing Programs. SIAM J. Optim. 21(1): 231-268 (2011) - [i6]Rodrigo A. Carrasco, Garud Iyengar, Clifford Stein:
Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness. CoRR abs/1110.0685 (2011) - 2010
- [j29]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4): 66:1-66:19 (2010) - [c55]Kirk Pruhs, Clifford Stein:
How to Schedule When You Have to Buy Your Energy. APPROX-RANDOM 2010: 352-365 - [c54]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194 - [c53]Garud Iyengar, David J. Phillips, Clifford Stein:
Feasible and Accurate Algorithms for Covering Semidefinite Programs. SWAT 2010: 150-162 - [i5]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)
2000 – 2009
- 2009
- [b4]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, 3rd Edition. MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292 - [j28]David P. Wagner, Robert L. Scot Drysdale, Clifford Stein:
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. Comput. Geom. 42(5): 376-387 (2009) - [j27]Eyjolfur Ingi Asgeirsson, Cliff Stein:
Bounded-space online bin cover. J. Sched. 12(5): 461-474 (2009) - [j26]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009) - [j25]Eyjolfur Ingi Asgeirsson, Cliff Stein:
Divide-and-Conquer Approximation Algorithm for Vertex Cover. SIAM J. Discret. Math. 23(3): 1261-1280 (2009) - [c52]Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat:
Solving Maximum Flow Problems on Real World Bipartite Graphs. ALENEX 2009: 14-28 - [c51]Alex Sherman, Jason Nieh, Clifford Stein:
FairTorrent: bringing fairness to peer-to-peer systems. CoNEXT 2009: 133-144 - [c50]Alex Sherman, Angelos Stavrou, Jason Nieh, Angelos D. Keromytis, Clifford Stein:
Adding Trust to P2P Distribution of Paid Content. ISC 2009: 459-474 - 2008
- [c49]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. SODA 2008: 710-719 - 2007
- [j24]Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright:
LP Decoding Corrects a Constant Fraction of Errors. IEEE Trans. Inf. Theory 53(1): 82-89 (2007) - [c48]Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 - [c47]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget optimization in search-based advertising auctions. EC 2007: 40-49 - [c46]Fei Li, Jay Sethuraman, Clifford Stein:
Better online buffer management. SODA 2007: 199-208 - [c45]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed scaling for weighted flow time. SODA 2007: 805-813 - [c44]Garud Iyengar, David J. Phillips, Clifford Stein:
Models of malicious behavior in sponsored search. SpringSim (3) 2007: 143-151 - [c43]Eyjolfur Ingi Asgeirsson, Clifford Stein:
Vertex Cover Approximations on Random Graphs. WEA 2007: 285-296 - [e2]Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. SIAM 2007, ISBN 978-0-898716-24-5 [contents] - 2006
- [b3]Kenneth P. Bogart, Clifford Stein, Robert L. Scot Drysdale:
Discrete mathematics for computer science. Mathematics accross the curriculum, Key College Publishing 2006, ISBN 978-1-930190-86-3, pp. I-XX, 1-425 - [c42]Eyjólfur Ingi Ásgeirsson, Cliff Stein:
Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. ALENEX 2006: 75-85 - [c41]Bogdan Caprita, Jason Nieh, Clifford Stein:
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. PODC 2006: 72-81 - [i4]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006) - [i3]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget Optimization in Search-Based Advertising Auctions. CoRR abs/cs/0612052 (2006) - 2005
- [c40]Robert L. Scot Drysdale, Clifford Stein, David P. Wagner:
An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. CCCG 2005: 97-100 - [c39]Garud Iyengar, David J. Phillips, Clifford Stein:
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. IPCO 2005: 152-166 - [c38]Jon Feldman, Clifford Stein:
LP decoding achieves capacity. SODA 2005: 460-469 - [c37]Fei Li, Jay Sethuraman, Clifford Stein:
An optimal online algorithm for packet scheduling with agreeable deadlines. SODA 2005: 801-802 - [c36]Bogdan Caprita, Wong Chun Chan, Jason Nieh, Clifford Stein, Haoqiang Zheng:
Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. USENIX Annual Technical Conference, General Track 2005: 337-352 - [c35]Eyjolfur Ingi Asgeirsson, Clifford Stein:
Vertex Cover Approximations: Experiments and Observations. WEA 2005: 545-557 - 2004
- [j23]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004) - [j22]Stavros G. Kolliopoulos, Clifford Stein:
Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1): 63-87 (2004) - [c34]Eyjolfur Ingi Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein:
Scheduling an Industrial Production Facility. IPCO 2004: 116-131 - [c33]Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright:
LP decoding corrects a constant fraction of errors. ISIT 2004: 68 - 2003
- [p2]Clifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi:
Networks and Flows. Handbook of Graph Theory 2003: 1074-1142 - 2002
- [j21]Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 (2002) - [c32]April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut:
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. SODA 2002: 723-731 - [c31]Clint Hepner, Clifford Stein:
Minimizing Makespan for the Lazy Bureaucrat Problem. SWAT 2002: 40-50 - [e1]David M. Mount, Clifford Stein:
Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers. Lecture Notes in Computer Science 2409, Springer 2002, ISBN 3-540-43977-3 [contents] - [i2]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. CoRR cs.DS/0205008 (2002) - [i1]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. CoRR cs.DS/0205051 (2002) - 2001
- [b2]Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein:
Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001, ISBN 0-262-03293-7 - [j20]Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald:
Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. J. Comput. Biol. 8(1): 19-36 (2001) - [j19]Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein:
Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. 31(1): 146-166 (2001) - [j18]Stavros G. Kolliopoulos, Clifford Stein:
Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31(3): 919-946 (2001) - [c30]Rong Xie, Daniela Rus, Clifford Stein:
Scheduling multi-task multi-agent systems. Agents 2001: 159-160 - [c29]Clint Hepner, Clifford Stein:
Implementation of a PTAS for Scheduling with Release Dates. ALENEX 2001: 202-215 - [c28]Clifford Stein, David P. Wagner:
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. IPCO 2001: 406-422 - [c27]Clifford Stein:
Simultaneously optimizing two scheduling objectives. IPDPS 2001: 198 - [c26]Rong Xie, Daniela Rus, Clifford Stein:
Scheduling Multi-task Agents. Mobile Agents 2001: 260-276 - 2000
- [c25]Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald:
Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. ISMB 2000: 13-24 - [c24]Javed A. Aslam, Alain Leblanc, Clifford Stein:
Clustering Data without Prior Knowledge. WAE 2000: 74-86
1990 – 1999
- 1999
- [c23]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - [c22]Stavros G. Kolliopoulos, Clifford Stein:
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO 1999: 328-344 - [c21]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847 - [c20]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678 - [p1]David R. Karger, Cliff Stein, Joel Wein:
Scheduling Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j17]Chris Armen, Clifford Stein:
A 2 2/3 Superstring Approximation Algorithm. Discret. Appl. Math. 88(1-3): 29-57 (1998) - [j16]Stavros G. Kolliopoulos, Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. J. Algorithms 28(1): 125-141 (1998) - [j15]Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein:
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 (1998) - [j14]Cynthia A. Phillips, Clifford Stein, Joel Wein:
Minimizing average completion time in the presence of release dates. Math. Program. 82: 199-223 (1998) - [c19]Stavros G. Kolliopoulos, Clifford Stein:
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168 - [c18]Andrew V. Goldberg, Jeffrey D. Oldham,