| |
| 2008 | ||
|---|---|---|
| 6 | EE | Amy R. Greenwald, Zheng Li, Warren Schudy: More Efficient Internal-Regret-Minimizing Algorithms. COLT 2008: 239-250 |
| 5 | EE | Claire Mathieu, Warren Schudy: Yet another algorithm for dense max cut: go greedy. SODA 2008: 176-182 |
| 4 | EE | Marek Karpinski, Warren Schudy: Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems CoRR abs/0811.3244: (2008) |
| 3 | EE | Marek Karpinski, Warren Schudy: Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems. Electronic Colloquium on Computational Complexity (ECCC) 15(101): (2008) |
| 2007 | ||
| 2 | EE | Claire Kenyon-Mathieu, Warren Schudy: How to rank with few errors. STOC 2007: 95-103 |
| 2006 | ||
| 1 | EE | Claire Kenyon-Mathieu, Warren Schudy: How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments. Electronic Colloquium on Computational Complexity (ECCC) 13(144): (2006) |
| 1 | Amy R. Greenwald | [6] |
| 2 | Marek Karpinski | [3] [4] |
| 3 | Zheng Li | [6] |
| 4 | Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) | [1] [2] [5] |