Search the dblp DataBase
Clifford Stein :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Soumen Chakrabarti , Cynthia A. Phillips , Andreas S. Schulz , David B. Shmoys , Clifford Stein , Joel Wein Improved Scheduling Algorithms for Minsum Criteria. [Citation Graph (1, 0)][DBLP ] ICALP, 1996, pp:646-657 [Conf ] Rong Xie , Daniela Rus , Clifford Stein Scheduling multi-task multi-agent systems. [Citation Graph (0, 0)][DBLP ] Agents, 2001, pp:159-160 [Conf ] Clint Hepner , Clifford Stein Implementation of a PTAS for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP ] ALENEX, 2001, pp:202-215 [Conf ] Robert L. Scot Drysdale , Clifford Stein , David P. Wagner An O(n5/2 log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:97-100 [Conf ] Chris Armen , Clifford Stein A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. [Citation Graph (0, 0)][DBLP ] CPM, 1996, pp:87-101 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:32-44 [Conf ] Stavros G. Kolliopoulos , Clifford Stein Improved Approximation Algorithms for Unsplittable Flow Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:426-435 [Conf ] S. Rao Kosaraju , James K. Park , Clifford Stein Long Tours and Short Superstrings (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:166-177 [Conf ] Eyjolfur Asgeirsson , Jonathan W. Berry , Cynthia A. Phillips , David J. Phillips , Clifford Stein , Joel Wein Scheduling an Industrial Production Facility. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:116-131 [Conf ] Andrew V. Goldberg , Jeffrey D. Oldham , Serge A. Plotkin , Clifford Stein An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] IPCO, 1998, pp:338-352 [Conf ] Stavros G. Kolliopoulos , Clifford Stein Finding Real-Valued Single-Source Shortest Paths. [Citation Graph (0, 0)][DBLP ] IPCO, 1996, pp:94-104 [Conf ] Stavros G. Kolliopoulos , Clifford Stein Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. [Citation Graph (0, 0)][DBLP ] IPCO, 1998, pp:153-168 [Conf ] Stavros G. Kolliopoulos , Clifford Stein Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. [Citation Graph (0, 0)][DBLP ] IPCO, 1999, pp:328-344 [Conf ] G. Iyengar , David J. Phillips , Clifford Stein Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:152-166 [Conf ] Clifford Stein , David P. Wagner Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2001, pp:406-422 [Conf ] Clifford Stein Simultaneously optimizing two scheduling objectives. [Citation Graph (0, 0)][DBLP ] IPDPS, 2001, pp:198- [Conf ] Christopher Bailey-Kellogg , John J. Kelley , Clifford Stein , Bruce Randall Donald Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. [Citation Graph (0, 0)][DBLP ] ISMB, 2000, pp:13-24 [Conf ] Rong Xie , Daniela Rus , Clifford Stein Scheduling Multi-task Agents. [Citation Graph (0, 0)][DBLP ] Mobile Agents, 2001, pp:260-276 [Conf ] Bogdan Caprita , Jason Nieh , Clifford Stein Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:72-81 [Conf ] Javed A. Aslam , April Rasala , Clifford Stein , Neal E. Young Improved Bicriteria Existence Theorems for Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:846-847 [Conf ] Chandra Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , Clifford Stein Experimental Study of Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:324-333 [Conf ] Chandra Chekuri , Rajeev Motwani , B. Natarajan , Clifford Stein Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:609-618 [Conf ] Jon Feldman , Clifford Stein LP decoding achieves capacity. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:460-469 [Conf ] Fei Li , Jay Sethuraman , Clifford Stein An optimal online algorithm for packet scheduling with agreeable deadlines. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:801-802 [Conf ] David B. Shmoys , Clifford Stein , Joel Wein Improved Approximation Algorithms for Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:148-157 [Conf ] April Rasala , Clifford Stein , Eric Torng , Patchrawat Uthaisombut Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:723-731 [Conf ] Perry Fizzano , David R. Karger , Clifford Stein , Joel Wein Job Scheduling in Rings. [Citation Graph (0, 0)][DBLP ] SPAA, 1994, pp:210-219 [Conf ] David R. Karger , Philip N. Klein , Clifford Stein , Mikkel Thorup , Neal E. Young Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:668-678 [Conf ] David R. Karger , Clifford Stein An O~(n2 ) algorithm for minimum cuts. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:757-765 [Conf ] Philip N. Klein , Clifford Stein , Éva Tardos Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:310-321 [Conf ] Frank Thomson Leighton , Fillia Makedon , Serge A. Plotkin , Clifford Stein , Éva Tardos , Spyros Tragoudas Fast Approximation Algorithms for Multicommodity Flow Problems [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:101-111 [Conf ] Cynthia A. Phillips , Clifford Stein , Eric Torng , Joel Wein Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:140-149 [Conf ] Clint Hepner , Clifford Stein Minimizing Makespan for the Lazy Bureaucrat Problem. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:40-50 [Conf ] Cynthia A. Phillips , Clifford Stein , Joel Wein Task Scheduling in Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1994, pp:290-301 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] USENIX Annual Technical Conference, General Track, 2005, pp:337-352 [Conf ] Chris Armen , Clifford Stein Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:494-505 [Conf ] Cynthia A. Phillips , Clifford Stein , Joel Wein Scheduling Jobs that Arrive Over Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:86-97 [Conf ] Javed A. Aslam , Alain Leblanc , Clifford Stein Clustering Data without Prior Knowledge. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2000, pp:74-86 [Conf ] Eyjolfur Asgeirsson , Clifford Stein Vertex Cover Approximations: Experiments and Observations. [Citation Graph (0, 0)][DBLP ] WEA, 2005, pp:545-557 [Conf ] Philip N. Klein , Clifford Stein A Parallel Algorithm for Approximating the Minimum Cycle Cover. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1993, v:9, n:1, pp:23-31 [Journal ] Cynthia A. Phillips , Clifford Stein , Eric Torng , Joel Wein Optimal Time-Critical Scheduling via Resource Augmentation. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2002, v:32, n:2, pp:163-200 [Journal ] Javed A. Aslam , April Rasala , Clifford Stein , Neal E. Young Improved Bicriteria Existence Theorems for Scheduling [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] David R. Karger , Philip N. Klein , Clifford Stein , Mikkel Thorup , Neal E. Young Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Chris Armen , Clifford Stein A 2 2/3 Superstring Approximation Algorithm. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:29-57 [Journal ] Philip N. Klein , Clifford Stein A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:34, n:6, pp:307-312 [Journal ] Clifford Stein , Joel Wein Approximating the Minimum-Cost Maximum Flow is P-Complete. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:6, pp:315-319 [Journal ] David R. Karger , Clifford Stein A New Approach to the Minimum Cut Problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 1996, v:43, n:4, pp:601-640 [Journal ] Stavros G. Kolliopoulos , Clifford Stein Finding Real-Valued Single-Source Shortest Paths in o(n3 ) Expected Time. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:28, n:1, pp:125-141 [Journal ] Chris Armen , Clifford Stein Short Superstrings and the Structure of Overlapping Strings. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1995, v:2, n:2, pp:307-332 [Journal ] Christopher Bailey-Kellogg , John J. Kelley , Clifford Stein , Bruce Randall Donald Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 2001, v:8, n:1, pp:19-36 [Journal ] Cynthia A. Phillips , Andreas S. Schulz , David B. Shmoys , Clifford Stein , Joel Wein Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 1998, v:1, n:4, pp:413-426 [Journal ] Frank Thomson Leighton , Fillia Makedon , Serge A. Plotkin , Clifford Stein , Éva Stein , Spyros Tragoudas Fast Approximation Algorithms for Multicommodity Flow Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:50, n:2, pp:228-243 [Journal ] Perry Fizzano , David R. Karger , Clifford Stein , Joel Wein Distributed Job Scheduling in Rings. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1997, v:45, n:2, pp:122-133 [Journal ] David R. Karger , Philip N. Klein , Clifford Stein , Mikkel Thorup , Neal E. Young Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP ] Math. Oper. Res., 2004, v:29, n:3, pp:436-461 [Journal ] Stavros G. Kolliopoulos , Clifford Stein Approximating disjoint-path problems using packing integer programs. [Citation Graph (0, 0)][DBLP ] Math. Program., 2004, v:99, n:1, pp:63-87 [Journal ] Cynthia A. Phillips , Clifford Stein , Joel Wein Minimizing average completion time in the presence of release dates. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:82, n:, pp:199-223 [Journal ] Clifford Stein , Joel Wein On the existence of schedules that are near-optimal for both makespan and total weighted completion time. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 1997, v:21, n:3, pp:115-122 [Journal ] Ravindra K. Ahuja , James B. Orlin , Clifford Stein , Robert Endre Tarjan Improved Algorithms for Bipartite Network Flow. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:5, pp:906-933 [Journal ] Chandra Chekuri , Rajeev Motwani , B. Natarajan , Clifford Stein Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:1, pp:146-166 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:3, pp:466-487 [Journal ] Stavros G. Kolliopoulos , Clifford Stein Approximation Algorithms for Single-Source Unsplittable Flow. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:3, pp:919-946 [Journal ] David B. Shmoys , Clifford Stein , Joel Wein Improved Approximation Algorithms for Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:3, pp:617-632 [Journal ] Cynthia A. Phillips , Clifford Stein , Joel Wein Task Scheduling in Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1997, v:10, n:4, pp:573-598 [Journal ] Jon Feldman , Tal Malkin , Rocco A. Servedio , Clifford Stein , Martin J. Wainwright LP Decoding Corrects a Constant Fraction of Errors. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:82-89 [Journal ] Jon Feldman , S. Muthukrishnan , Martin Pal , Clifford Stein Budget optimization in search-based advertising auctions. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2007, pp:40-49 [Conf ] Nikhil Bansal , Kirk Pruhs , Clifford Stein Speed scaling for weighted flow time. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:805-813 [Conf ] Fei Li , Jay Sethuraman , Clifford Stein Better online buffer management. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:199-208 [Conf ] Eyjolfur Asgeirsson , Clifford Stein Vertex Cover Approximations on Random Graphs. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:285-296 [Conf ] Jon Feldman , S. Muthukrishnan , Martin Pal , Clifford Stein Budget Optimization in Search-Based Advertising Auctions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Jon Feldman , S. Muthukrishnan , Anastasios Sidiropoulos , Clifford Stein , Zoya Svitkina On the Complexity of Processing Massive, Unordered, Distributed Data [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Solving Maximum Flow Problems on Real World Bipartite Graphs. [Citation Graph (, )][DBLP ] How to Schedule When You Have to Buy Your Energy. [Citation Graph (, )][DBLP ] Online Stochastic Packing Applied to Display Ad Allocation. [Citation Graph (, )][DBLP ] Non-Preemptive Min-Sum Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP ] Adding Trust to P2P Distribution of Paid Content. [Citation Graph (, )][DBLP ] Open Shading Language. [Citation Graph (, )][DBLP ] On distributing symmetric streaming computations. [Citation Graph (, )][DBLP ] Feasible and Accurate Algorithms for Covering Semidefinite Programs. [Citation Graph (, )][DBLP ] FairTorrent: bringing fairness to peer-to-peer systems. [Citation Graph (, )][DBLP ] Models of malicious behavior in sponsored search. [Citation Graph (, )][DBLP ] An O(n5/2 logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. [Citation Graph (, )][DBLP ] Online Stochastic Ad Allocation: Efficiency and Fairness [Citation Graph (, )][DBLP ] Search in 0.262secs, Finished in 0.265secs