


default search action
David Arthur
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
- [b1]David Arthur:
Analyzing and improving local search : k-means and ICP. Stanford University, USA, 2009
Journal Articles
- 2023
- [j4]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:
Kora: A Cloud-Native Event Streaming Platform for Kafka. Proc. VLDB Endow. 16(12): 3822-3834 (2023) - 2011
- [j3]David Arthur, Bodo Manthey, Heiko Röglin
:
Smoothed Analysis of the k-Means Method. J. ACM 58(5): 19:1-19:31 (2011) - 2009
- [j2]David Arthur, Sergei Vassilvitskii:
Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method. SIAM J. Comput. 39(2): 766-782 (2009) - 2003
- [j1]David Arthur:
The Restricted Arc-Width of a Graph. Electron. J. Comb. 10 (2003)
Conference and Workshop Papers
- 2010
- [c10]David Arthur, Raphaël Clifford
, Markus Jalsenius, Ashley Montanaro
, Benjamin Sach
:
The Complexity of Flood Filling Games. FUN 2010: 307-318 - 2009
- [c9]David Arthur, Bodo Manthey, Heiko Röglin
:
k-Means Has Polynomial Smoothed Complexity. FOCS 2009: 405-414 - [c8]Paula M. Procter, Min-Yen Kan, Siu Yin Lee, Siti Zubaidah, Wai Kin Yip, Jin Jhao, David Arthur, Goh Mien Li:
eEvidence: Supplying Evidence to the Patient Interaction. Nursing Informatics 2009: 488-492 - [c7]David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu:
Pricing Strategies for Viral Marketing on Social Networks. WINE 2009: 101-112 - 2007
- [c6]David Arthur:
Fast Sorting and Pattern-avoiding Permutations. ANALCO 2007: 169-174 - [c5]David Arthur, Sergei Vassilvitskii:
k-means++: the advantages of careful seeding. SODA 2007: 1027-1035 - 2006
- [c4]David Arthur, Sergei Vassilvitskii:
How slow is the k-means method? SCG 2006: 144-153 - [c3]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 - [c2]David Arthur, Rina Panigrahy:
Analyzing BitTorrent and related peer-to-peer networks. SODA 2006: 961-969 - 2002
- [c1]Eric Y. Cheng, David Arthur:
Constructing A Virtual Behavior Change Support System : A Mobile Internet Healthcare Solution For Problem Drinkers. ECIS 2002: 1617-1625
Informal and Other Publications
- 2010
- [i4]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) - [i3]David Arthur, Steve Y. Oudot:
Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing. CoRR abs/1011.4955 (2010) - 2009
- [i2]David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu:
Pricing strategies for viral marketing on Social Networks. CoRR abs/0902.3485 (2009) - [i1]David Arthur, Bodo Manthey, Heiko Röglin:
k-Means has Polynomial Smoothed Complexity. CoRR abs/0904.1113 (2009)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint