David Arthur

k-Means Has Polynomial Smoothed Complexity

Bodo Manthey, Heiko Röglin, David Arthur, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

k-means++: the advantages of careful seeding

Sergei Vassilvitskii, David Arthur, Sergei Vassilvitskii, 2007, SODA '07.

Pricing Strategies for Viral Marketing on Social Networks pdf

Rajeev Motwani, Aneesh Sharma, Ying Xu, 2009, WINE.

On the Worst Case Complexity of the k-means Method

Sergei Vassilvitskii, Sergei Vassilvitskii, David Arthur, 2005 .

Smoothed Analysis of the k-Means Method

Bodo Manthey, Heiko Röglin, David Arthur, 2011, JACM.

Analyzing BitTorrent and related peer-to-peer networks

Rina Panigrahy, David Arthur, R. Panigrahy, 2006, SODA '06.

How slow is the k-means method?

Sergei Vassilvitskii, David Arthur, Sergei Vassilvitskii, 2006, SCG '06.

Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

Sergei Vassilvitskii, David Arthur, Sergei Vassilvitskii, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Fast Sorting and Pattern-avoiding Permutations

David Arthur, David Arthur, 2007, ANALCO.

k-means++: the advantages of careful seeding

Sergei Vassilvitskii, David Arthur, 2007, SODA '07.