David Arthur

19 papers A* 4Misc 1Journal 8Unranked 5
YearRankTypeTitle / Venue / Authors
2023 J jnl
Kora: A Cloud-Native Event Streaming Platform for Kafka.
Proc. VLDB Endow.
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
2011 J jnl
Smoothed Analysis of the k-Means Method.
J. ACM
David Arthur, Bodo Manthey, Heiko Röglin
2010 J jnl
Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing
CoRR
David Arthur, Steve Y. Oudot
2010 J jnl
The Complexity of Flood Filling Games
CoRR
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
2010 Misc conf
The Complexity of Flood Filling Games.
FUN
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
2009 — —
Analyzing and improving local search : k-means and ICP.
David Arthur
2009 — conf
Pricing Strategies for Viral Marketing on Social Networks.
WINE
David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu
2009 J jnl
Pricing strategies for viral marketing on Social Networks
CoRR
David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu
2009 J jnl
Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method.
SIAM J. Comput.
David Arthur, Sergei Vassilvitskii
2009 — conf
eEvidence: Supplying Evidence to the Patient Interaction.
Nursing Informatics
Paula M. Procter, Min-Yen Kan, Siu Yin Lee, Siti Zubaidah, Wai Kin Yip, Jin Jhao, David Arthur, Goh Mien Li
2009 A* conf
k-Means Has Polynomial Smoothed Complexity.
FOCS
David Arthur, Bodo Manthey, Heiko Röglin
2009 J jnl
k-Means has Polynomial Smoothed Complexity
CoRR
David Arthur, Bodo Manthey, Heiko Röglin
2007 — conf
Fast Sorting and Pattern-avoiding Permutations.
ANALCO
David Arthur
2007 A* conf
k-means++: the advantages of careful seeding.
SODA
David Arthur, Sergei Vassilvitskii
2006 A* conf
Analyzing BitTorrent and related peer-to-peer networks.
SODA
David Arthur, Rina Panigrahy
2006 — conf
How slow is the
SCG
David Arthur, Sergei Vassilvitskii
2006 A* conf
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method.
FOCS
David Arthur, Sergei Vassilvitskii
2003 J jnl
The Restricted Arc-Width of a Graph.
Electron. J. Comb.
David Arthur
2002 — conf
Constructing A Virtual Behavior Change Support System : A Mobile Internet Healthcare Solution For Problem Drinkers.
ECIS
Eric Y. Cheng, David Arthur