☰

Clifford Stein - Publications

Affiliations: 
Computer Science Columbia University, New York, NY 
Area:
Algorithms, Combinatorial Optimization, Network Algorithms, Scheduling, Theory of Computation
Tree Info Similar researchers PubMed Report error

38 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Stein C, Zhong M. Scheduling When You Do Not Know the Number of Machines Acm Transactions On Algorithms. 16: 1-20. DOI: 10.1145/3340320  0.33
2020 Chen L, Eberle F, Megow N, Schewior K, Stein C. A general framework for handling commitment in online throughput maximization Mathematical Programming. 183: 215-247. DOI: 10.1007/S10107-020-01469-2  0.465
2018 Carrasco RA, Iyengar G, Stein C. Resource cost aware scheduling European Journal of Operational Research. 269: 621-632. DOI: 10.1016/J.Ejor.2018.02.059  0.685
2016 Bernstein A, Stein C. Faster fully dynamic matchings with small approximation ratios Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1: 692-711.  0.382
2015 Qiu Z, Stein C, Zhong Y. Minimizing the total weighted completion time of coflows in datacenter networks Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2015: 294-303. DOI: 10.1145/2755573.2755592  0.411
2014 Marašević J, Stein C, Zussman G. Max-min fair rate allocation and routing in energy harvesting networks: Algorithmic analysis Proceedings of the International Symposium On Mobile Ad Hoc Networking and Computing (Mobihoc). 11: 367-376. DOI: 10.1007/S00453-016-0171-6  0.452
2013 Carrasco RA, Iyengar G, Stein C. Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints Operations Research Letters. 41: 436-441. DOI: 10.1016/J.Orl.2013.05.008  0.701
2012 Jez Ł, Li F, Sethuraman J, Stein C. Online scheduling of packets with agreeable deadlines Acm Transactions On Algorithms. 9. DOI: 10.1145/2390176.2390181  0.436
2012 Sherman A, Nieh J, Stein C. FairTorrent: A deficit-based distributed algorithm to ensure fairness in peer-to-peer systems Ieee/Acm Transactions On Networking. 20: 1361-1374. DOI: 10.1109/Tnet.2012.2185058  0.348
2011 Negrucşeri CS, Pacsoşi MB, Stanley B, Stein C, Strat CG. Solving maximum flow problems on real-world bipartite graphs Acm Journal of Experimental Algorithms. 16. DOI: 10.1145/1963190.2025381  0.466
2011 Iyengar G, Phillips DJ, Stein C. Approximating semidefinite packing programs Siam Journal On Optimization. 21: 231-268. DOI: 10.1137/090762671  0.655
2010 Feldman J, Muthukrishnan S, Sidiropoulos A, Stein C, Svitkina Z. On distributing symmetric streaming computations Acm Transactions On Algorithms. 6. DOI: 10.1145/1824777.1824786  0.4
2009 Ásgeirsson EI, Stein C. Divide-and-Conquer Approximation Algorithm for Vertex Cover Siam Journal On Discrete Mathematics. 23: 1261-1280. DOI: 10.1137/070710275  0.702
2009 Wagner DP, Drysdale RS, Stein C. An O (n 5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions Computational Geometry: Theory and Applications. 42: 376-387. DOI: 10.1016/J.Comgeo.2008.04.006  0.409
2009 Asgeirsson EI, Stein C. Bounded-space online bin cover Journal of Scheduling. 12: 461-474. DOI: 10.1007/S10951-009-0116-X  0.704
2007 Bansal N, Pruhs K, Stein C. Speed scaling for weighted flow time Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 805-813. DOI: 10.1137/08072125X  0.358
2005 Asgeirsson E, Stein C. Vertex cover approximations: experiments and observations Lecture Notes in Computer Science. 545-557. DOI: 10.1007/11427186_47  0.697
2004 Karger DR, Klein P, Stein C, Thorup M, Young NE. Rounding algorithms for a geometric embedding of minimum multiway cut Mathematics of Operations Research. 29: 436-461. DOI: 10.1287/Moor.1030.0086  0.44
2004 Kolliopoulos SG, Stein C. Approximating disjoint-path problems using packing integer programs Mathematical Programming. 99: 63-87. DOI: 10.1007/S10107-002-0370-6  0.467
2002 Kolliopoulos SG, Stein C. Approximation Algorithms for Single-Source Unsplittable Flow Siam Journal On Computing. 31: 919-946. DOI: 10.1137/S0097539799355314  0.471
2002 Chekuri C, Motwani R, Natarajan B, Stein C. Approximation Techniques for Average Completion Time Scheduling Siam Journal On Computing. 31: 146-166. DOI: 10.1137/S0097539797327180  0.516
2002 Phillips CA, Stein C, Torng E, Wein J. Optimal Time-Critical Scheduling via Resource Augmentation Algorithmica. 32: 163-200. DOI: 10.1007/S00453-001-0068-9  0.483
2001 Xie R, Rus D, Stein C. Scheduling Multi-task Agents Lecture Notes in Computer Science. 260-276. DOI: 10.1007/3-540-45647-3_18  0.394
2000 Aslam JA, Leblanc A, Stein C. Clustering Data without Prior Knowledge Lecture Notes in Computer Science. 74-86. DOI: 10.1007/3-540-44691-5_7  0.323
1998 Phillips CA, Schulz AS, Shmoys DB, Stein C, Wein J. Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem Journal of Combinatorial Optimization. 1: 413-426. DOI: 10.1023/A:1009750913529  0.648
1998 Armen C, Stein C. A 2(2)/(3) superstring approximation algorithm Discrete Applied Mathematics. 88: 29-57. DOI: 10.1016/S0166-218X(98)00065-1  0.46
1998 Phillips CA, Stein C, Wein J. Minimizing average completion time in the presence of release dates Mathematical Programming. 82: 199-223. DOI: 10.1007/Bf01585872  0.502
1998 Kolliopoulos SG, Stein C. Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time Journal of Algorithms. 28: 125-141. DOI: 10.1006/Jagm.1998.0937  0.478
1997 Phillips C, Stein C, Wein J. Task Scheduling in Networks Siam Journal On Discrete Mathematics. 10: 573-598. DOI: 10.1137/S0895480194279057  0.455
1997 Stein C, Wein J. On the existence of schedules that are near-optimal for both makespan and total weighted completion time Operations Research Letters. 21: 115-122. DOI: 10.1016/S0167-6377(97)00025-4  0.421
1997 Fizzano P, Karger D, Stein C, Wein J. Distributed Job Scheduling in Rings Journal of Parallel and Distributed Computing. 45: 122-133. DOI: 10.1006/Jpdc.1997.1373  0.425
1996 Karger DR, Stein C. A new approach to the minimum cut problem Journal of the Acm. 43: 601-640. DOI: 10.1145/234533.234534  0.495
1994 Klein P, Plotkin S, Stein C, Tardos E. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts Siam Journal On Computing. 23: 466-487. DOI: 10.1137/S0097539792241175  0.471
1994 Shmoys DB, Stein C, Wein J. Improved Approximation Algorithms for Shop Scheduling Problems Siam Journal On Computing. 23: 617-632. DOI: 10.1137/S009753979222676X  0.666
1994 Ahuja RK, Orlin JB, Stein C. Improved Algorithms for Bipartite Network Flow Siam Journal On Computing. 23: 906-933. DOI: 10.1137/S0097539791199334  0.358
1993 Orlin JB, Stein C. Parallel algorithms for the assignment and minimum-cost flow problems Operations Research Letters. 14: 181-186. DOI: 10.1016/0167-6377(93)90068-R  0.406
1993 Klein P, Stein C. A parallel algorithm for approximating the minimum cycle cover Algorithmica. 9: 23-31. DOI: 10.1007/Bf01185336  0.424
1990 Klein P, Stein C. A parallel algorithm for eliminating cycles in undirected graphs Information Processing Letters. 34: 307-312. DOI: 10.1016/0020-0190(90)90015-P  0.479
Show low-probability matches.