Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	David
Last name:	Arthur
DBLP:	65/770
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 13 of 13  

Select a publication
Show	Title	Venue	Rating	Date
	David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach. The Complexity of Flood Filling Games	CoRR 2010, Volume 0	(0)	2010
	David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu 0002. Pricing Strategies for Viral Marketing on Social Networks.	Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009	(0)	2009
	Paula M. Procter, Min-Yen Kan, Siu Yin Lee, Siti Zubaidah Zubaidah, Wai Kin Yip, Jin Jhao Jhao, David Arthur, Goh Mien Li. eEvidence: Supplying Evidence to the Patient Interaction.	Connecting Health and Humans - Proceedings of NI2009, The 10th International Congress on Nursing Informatics, 28 June - 1 July 2009, Helsinki, Finland 2009	(0)	2009
	David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu 0002. Pricing strategies for viral marketing on Social Networks	CoRR 2009, Volume 0	(0)	2009
	David Arthur, Bodo Manthey, Heiko Röglin. k-Means has Polynomial Smoothed Complexity	CoRR 2009, Volume 0	(0)	2009
	David Arthur, Sergei Vassilvitskii. Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method.	SIAM J. Comput. 2009, Volume 39	(0)	2009
	David Arthur, Bodo Manthey, Heiko Röglin. k-Means Has Polynomial Smoothed Complexity.	50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009	(0)	2009
	David Arthur, Sergei Vassilvitskii. k-means++: the advantages of careful seeding.	Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 2007	(0)	2007
	David Arthur, Sergei Vassilvitskii. How slow is the	Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006 2006	(0)	2006
	David Arthur, Sergei Vassilvitskii. Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method.	47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006	(0)	2006
	David Arthur, Rina Panigrahy. Analyzing BitTorrent and related peer-to-peer networks.	Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006	(0)	2006
	David Arthur. The Restricted Arc-Width of a Graph.	Electr. J. Comb. 2003, Volume 10	(0)	2003
	Eric Y. Cheng, David Arthur. Constructing A Virtual Behavior Change Support System : A Mobile Internet Healthcare Solution For Problem Drinkers.	Proceedings of the 10th European Conference on Information Systems, Information Systems and the Future of the Digital Economy, ECIS 2002, Gdansk, Poland, June 6-8, 2002 2002	(0)	2002

Your query returned 13 matches in the database.