| 2011 |
|---|
| 19 | Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Chao Wang, Ewa Misiolek, Baruch Schieber, Chao Wang. Algorithmica (60): 421-450 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 18 | Ordering by weighted number of wins gives a good ranking for weighted tournaments. Don Coppersmith, Lisa Fleischer, Atri Rudra. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 17 | Robust reductions from ranking to classification. Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin. Machine Learning (72): 139-153 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 16 | Robust Reductions from Ranking to Classification. Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin. COLT 2007, 604-619. Web SearchBibTeXDownload |
| 2006 |
|---|
| 15 | Ordering by weighted number of wins gives a good ranking for weighted tournaments. Don Coppersmith, Lisa Fleischer, Atri Rudra. SODA 2006, 776-782. Web SearchBibTeXDownload |
| 2005 |
|---|
| 14 | On the Robust Testability of Product of Codes. Don Coppersmith, Atri Rudra. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload |
| 13 | Ordering by weighted number of wins gives a good ranking for weighted tournaments. Don Coppersmith, Lisa Fleischer, Atri Rudra. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload |
| 2004 |
|---|
| 12 | An improved data stream algorithm for frequency moments. Don Coppersmith, Ravi Kumar. SODA 2004, 151-156. Web SearchBibTeXDownload |
| 1999 |
|---|
| 11 | Partitioning Nominal Attributes in Decision Trees. Don Coppersmith, Se June Hong, Jonathan R. M. Hosking. Data Min. Knowl. Discov. (3): 197-217 (1999). Web SearchBibTeXDownload |
| 10 | The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SIAM J. Comput. (29): 697-711 (1999). Cited by 24Web SearchBibTeXDownload |
| 1997 |
|---|
| 9 | The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SODA 1997, 221-229. Cited by 24Web SearchBibTeXDownload |
| 1994 |
|---|
| 8 | The minimum latency problem. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan. STOC 1994, 163-171. Cited by 141Web SearchBibTeXDownload |
| 1993 |
|---|
| 7 | Random Walks on Weighted Graphs and Applications to On-line Algorithms. Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. J. ACM (40): 421-453 (1993). Cited by 121Web SearchBibTeXDownload |
| 1990 |
|---|
| 6 | Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir. STOC 1990, 369-378. Web SearchBibTeXDownload |
| 1989 |
|---|
| 5 | Parallel Graph Algorithms That Are Efficient on Average. Don Coppersmith, Prabhakar Raghavan, Martin Tompa. Inf. Comput. (81): 318-333 (1989). Cited by 24Web SearchBibTeXDownload |
| 1988 |
|---|
| 4 | Balancing sets of vectors. Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko. IEEE Transactions on Information Theory (34): 128-130 (1988). Web SearchBibTeXDownload |
| 1987 |
|---|
| 3 | Parallel Graph Algorithms that Are Efficient on Average. Don Coppersmith, Prabhakar Raghavan, Martin Tompa. FOCS 1987, 260-269. Web SearchBibTeXDownload |
| 1983 |
|---|
| 2 | Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing. Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg. IEEE Trans. Computers (32): 190-194 (1983). Web SearchBibTeXDownload |
| 1982 |
|---|
| 1 | Analysis of a General Mass Storage System. Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong. SIAM J. Comput. (11): 94-116 (1982). Web SearchBibTeXDownload |
