David Arthur

According to our database, David Arthur authored at least 15 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Kora: A Cloud-Native Event Streaming Platform for Kafka.

Anna Povzner, Prince Mahajan, Jason Gustafson, Jun Rao, Ismael Juma, Feng Min, Shriram Sridharan, Nikhil Bhatia, Gopi K. Attaluri, Adithya Chandra, Stanislav Kozlovski, Rajini Sivaram, Lucas Bradstreet, Bob Barrett, Dhruvil Shah, David Jacot, David Arthur, Manveer Chawla, Ron Dagostino, Colin Mccabe, Manikumar Reddy Obili, Kowshik Prakasam, Jose Garcia Sancio, Vikas Singh, Alok Nikhil, Kamal Gupta

Proc. VLDB Endow., 2023

2011

Smoothed Analysis of the k-Means Method.

David Arthur, Bodo Manthey, Heiko Röglin

J. ACM, 2011

2010

Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing

David Arthur, Steve Y. Oudot

CoRR, 2010

The Complexity of Flood Filling Games.

David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

Analyzing and improving local search : k-means and ICP.

David Arthur

PhD thesis, 2009

Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method.

David Arthur, Sergei Vassilvitskii

SIAM J. Comput., 2009

Pricing Strategies for Viral Marketing on Social Networks.

David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

eEvidence: Supplying Evidence to the Patient Interaction.

Paula M. Procter, Min-Yen Kan, Siu Yin Lee, Siti Zubaidah, Wai Kin Yip, Jin Jhao, David Arthur, Goh Mien Li

Proceedings of the Connecting Health and Humans - Proceedings of NI2009, The 10th International Congress on Nursing Informatics, 28 June, 2009

k-Means Has Polynomial Smoothed Complexity.

David Arthur, Bodo Manthey, Heiko Röglin

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2007

k-means++: the advantages of careful seeding.

David Arthur, Sergei Vassilvitskii

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Fast Sorting and Pattern-avoiding Permutations.

David Arthur

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

Analyzing BitTorrent and related peer-to-peer networks.

David Arthur, Rina Panigrahy

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

How slow is the <i>k</i>-means method?

David Arthur, Sergei Vassilvitskii

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2003

The Restricted Arc-Width of a Graph.

David Arthur

Electron. J. Comb., 2003

2002

Constructing A Virtual Behavior Change Support System : A Mobile Internet Healthcare Solution For Problem Drinkers.

Eric Y. Cheng, David Arthur

Proceedings of the 10th European Conference on Information Systems, 2002