| |
| 2007 | ||
|---|---|---|
| 6 | EE | David Arthur, Sergei Vassilvitskii: k-means++: the advantages of careful seeding. SODA 2007: 1027-1035 |
| 2006 | ||
| 5 | EE | David Arthur, Sergei Vassilvitskii: Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method. FOCS 2006: 153-164 |
| 4 | EE | David Arthur, Rina Panigrahy: Analyzing BitTorrent and related peer-to-peer networks. SODA 2006: 961-969 |
| 3 | EE | David Arthur, Sergei Vassilvitskii: How slow is the k-means method? Symposium on Computational Geometry 2006: 144-153 |
| 2003 | ||
| 2 | EE | David Arthur: The Restricted Arc-Width of a Graph. Electr. J. Comb. 10: (2003) |
| 2002 | ||
| 1 | EE | Eric Y. Cheng, David Arthur: Constructing A Virtual Behavior Change Support System : A Mobile Internet Healthcare Solution For Problem Drinkers. ECIS 2002 |
| 1 | Eric Y. Cheng | [1] |
| 2 | Rina Panigrahy | [4] |
| 3 | Sergei Vassilvitskii | [3] [5] [6] |