| 2009 | ||
|---|---|---|
| 77 | 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 | |
| 76 | Alex Sherman, Angelos Stavrou, Jason Nieh, Angelos D. Keromytis, Clifford Stein: Adding Trust to P2P Distribution of Paid Content. ISC 2009: 459-474 | |
| 2008 | ||
| 75 | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On distributing symmetric streaming computations. SODA 2008: 710-719 | |
| 2007 | ||
| 74 | 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 | |
| 73 | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget optimization in search-based advertising auctions. ACM Conference on Electronic Commerce 2007: 40-49 | |
| 72 | 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 | |
| 71 | Fei Li, Jay Sethuraman, Clifford Stein: Better online buffer management. SODA 2007: 199-208 | |
| 70 | Nikhil Bansal, Kirk Pruhs, Clifford Stein: Speed scaling for weighted flow time. SODA 2007: 805-813 | |
| 69 | Eyjolfur Asgeirsson, Clifford Stein: Vertex Cover Approximations on Random Graphs. WEA 2007: 285-296 | |
| 68 | Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright: LP Decoding Corrects a Constant Fraction of Errors. IEEE Transactions on Information Theory 53(1): 82-89 (2007) | |
| 2006 | ||
| 67 | Bogdan Caprita, Jason Nieh, Clifford Stein: Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. PODC 2006: 72-81 | |
| 66 | Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On the Complexity of Processing Massive, Unordered, Distributed Data CoRR abs/cs/0611108: (2006) | |
| 65 | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget Optimization in Search-Based Advertising Auctions CoRR abs/cs/0612052: (2006) | |
| 2005 | ||
| 64 | 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 | |
| 63 | G. Iyengar, David J. Phillips, Clifford Stein: Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. IPCO 2005: 152-166 | |
| 62 | Jon Feldman, Clifford Stein: LP decoding achieves capacity. SODA 2005: 460-469 | |
| 61 | Fei Li, Jay Sethuraman, Clifford Stein: An optimal online algorithm for packet scheduling with agreeable deadlines. SODA 2005: 801-802 | |
| 60 | 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 | |
| 59 | Eyjolfur Asgeirsson, Clifford Stein: Vertex Cover Approximations: Experiments and Observations. WEA 2005: 545-557 | |
| 2004 | ||
| 58 | Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein: Scheduling an Industrial Production Facility. IPCO 2004: 116-131 | |
| 57 | 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) | |
| 56 | Stavros G. Kolliopoulos, Clifford Stein: Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1): 63-87 (2004) | |
| 2002 | ||
| 55 | David M. Mount, Clifford Stein: Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers Springer 2002 | |
| 54 | April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. SODA 2002: 723-731 | |
| 53 | Clint Hepner, Clifford Stein: Minimizing Makespan for the Lazy Bureaucrat Problem. SWAT 2002: 40-50 | |
| 52 | Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein: Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 (2002) | |
| 51 | Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young: Improved Bicriteria Existence Theorems for Scheduling CoRR cs.DS/0205008: (2002) | |
| 50 | 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 | ||
| 49 | 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 | |
| 48 | Clint Hepner, Clifford Stein: Implementation of a PTAS for Scheduling with Release Dates. ALENEX 2001: 202-215 | |
| 47 | Rong Xie, Daniela Rus, Clifford Stein: Scheduling multi-task multi-agent systems. Agents 2001: 159-160 | |
| 46 | Clifford Stein, David P. Wagner: Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. IPCO 2001: 406-422 | |
| 45 | Clifford Stein: Simultaneously optimizing two scheduling objectives. IPDPS 2001: 198 | |
| 44 | Rong Xie, Daniela Rus, Clifford Stein: Scheduling Multi-task Agents. Mobile Agents 2001: 260-276 | |
| 43 | Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald: Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. Journal of Computational Biology 8(1): 19-36 (2001) | |
| 42 | Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. 31(1): 146-166 (2001) | |
| 41 | Stavros G. Kolliopoulos, Clifford Stein: Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31(3): 919-946 (2001) | |
| 2000 | ||
| 40 | Javed A. Aslam, Alain Leblanc, Clifford Stein: Clustering Data without Prior Knowledge. Algorithm Engineering 2000: 74-86 | |
| 39 | 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 | |
| 1999 | ||
| 38 | 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 | |
| 37 | Stavros G. Kolliopoulos, Clifford Stein: Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO 1999: 328-344 | |
| 36 | Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young: Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847 | |
| 35 | 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 | |
| 1998 | ||
| 34 | Stavros G. Kolliopoulos, Clifford Stein: Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168 | |
| 33 | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein: An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO 1998: 338-352 | |
| 32 | Chris Armen, Clifford Stein: A 2 2/3 Superstring Approximation Algorithm. Discrete Applied Mathematics 88(1-3): 29-57 (1998) | |
| 31 | Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. J. Algorithms 28(1): 125-141 (1998) | |
| 30 | 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) | |
| 29 | Cynthia A. Phillips, Clifford Stein, Joel Wein: Minimizing average completion time in the presence of release dates. Math. Program. 82: 199-223 (1998) | |
| 1997 | ||
| 28 | Stavros G. Kolliopoulos, Clifford Stein: Improved Approximation Algorithms for Unsplittable Flow Problems. FOCS 1997: 426-435 | |
| 27 | Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein: Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333 | |
| 26 | Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SODA 1997: 609-618 | |
| 25 | Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein: Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). STOC 1997: 140-149 | |
| 24 | Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein: Distributed Job Scheduling in Rings. J. Parallel Distrib. Comput. 45(2): 122-133 (1997) | |
| 23 | Clifford Stein, Joel Wein: On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper. Res. Lett. 21(3): 115-122 (1997) | |
| 22 | Cynthia A. Phillips, Clifford Stein, Joel Wein: Task Scheduling in Networks. SIAM J. Discrete Math. 10(4): 573-598 (1997) | |
| 1996 | ||
| 21 | Chris Armen, Clifford Stein: A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. CPM 1996: 87-101 | |
| 20 | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein: Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657 | |
| 19 | Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths. IPCO 1996: 94-104 | |
| 18 | David R. Karger, Clifford Stein: A New Approach to the Minimum Cut Problem. J. ACM 43(4): 601-640 (1996) | |
| 1995 | ||
| 17 | Chris Armen, Clifford Stein: Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). WADS 1995: 494-505 | |
| 16 | Cynthia A. Phillips, Clifford Stein, Joel Wein: Scheduling Jobs that Arrive Over Time (Extended Abstract). WADS 1995: 86-97 | |
| 15 | Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas: Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50(2): 228-243 (1995) | |
| 14 | Chris Armen, Clifford Stein: Short Superstrings and the Structure of Overlapping Strings. Journal of Computational Biology 2(2): 307-332 (1995) | |
| 1994 | ||
| 13 | S. Rao Kosaraju, James K. Park, Clifford Stein: Long Tours and Short Superstrings (Preliminary Version) FOCS 1994: 166-177 | |
| 12 | Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein: Job Scheduling in Rings. SPAA 1994: 210-219 | |
| 11 | Cynthia A. Phillips, Clifford Stein, Joel Wein: Task Scheduling in Networks (Extended Abstract). SWAT 1994: 290-301 | |
| 10 | Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos: Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. 23(3): 466-487 (1994) | |
| 9 | David B. Shmoys, Clifford Stein, Joel Wein: Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. 23(3): 617-632 (1994) | |
| 8 | Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan: Improved Algorithms for Bipartite Network Flow. SIAM J. Comput. 23(5): 906-933 (1994) | |
| 1993 | ||
| 7 | David R. Karger, Clifford Stein: An O~(n2) algorithm for minimum cuts. STOC 1993: 757-765 | |
| 6 | Philip N. Klein, Clifford Stein: A Parallel Algorithm for Approximating the Minimum Cycle Cover. Algorithmica 9(1): 23-31 (1993) | |
| 1992 | ||
| 5 | Clifford Stein, Joel Wein: Approximating the Minimum-Cost Maximum Flow is P-Complete. Inf. Process. Lett. 42(6): 315-319 (1992) | |
| 1991 | ||
| 4 | David B. Shmoys, Clifford Stein, Joel Wein: Improved Approximation Algorithms for Shop Scheduling Problems. SODA 1991: 148-157 | |
| 3 | Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas: Fast Approximation Algorithms for Multicommodity Flow Problems STOC 1991: 101-111 | |
| 1990 | ||
| 2 | Philip N. Klein, Clifford Stein, Éva Tardos: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities STOC 1990: 310-321 | |
| 1 | Philip N. Klein, Clifford Stein: A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. Inf. Process. Lett. 34(6): 307-312 (1990) | |