| |
I am a third-year PhD student in theoretical computer science at
Stanford University under
Rajeev Motwani. My research
interests are a little eclectic, but so far I have been focusing on analyzing
and improving local search algorithms.
I also have a CV in a likely futile attempt to keep it current.
Papers
- k-means++: The advantages of careful seeding,
(David Arthur and
Sergei Vassilvitskii).
Appeared in SODA 2007.
ps,
pdf,
slides.
- Fast Sorting and Pattern-Avoiding Permutations,
(David Arthur).
Appeared in ANALCO 2007.
slides.
- Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method,
(David Arthur and
Sergei Vassilvitskii).
Appeared in FOCS 2006.
ps,
pdf.
- How slow is the k-means method?
(David Arthur and
Sergei Vassilvitskii).
Appeared in SOCG 2006.
ps,
pdf,
implementation,
slides.
- Analyzing the efficiency of BitTorrent and related peer-to-peer networks,
(David Arthur and
Rina Panigrahy).
Appeared in SODA 2006.
ps,
pdf,
slides.
- The restricted arc-width of a graph,
(David Arthur).
Appeared in EJC, 2003.
ps,
pdf.
Other Interests
- Fantasy and science fiction books.
A Song of Ice and Fire,
The Sandman,
Ender's Game and
Speaker for the Dead.
- Classic rock.
The Beatles,
Bob Dylan, and
Pink Floyd.
- Movies of all sorts.
The Lord of the Rings,
The Sixth Sense,
Casablanca,
A Fish Called Wanda,
The Big Lebowski,
and of course, ye olde
super-hero
movies.
- Math/CS competitions.
TopCoder (especially
this,
this, and
this),
ACM ICPC,
IOI,
Putnam,
and IMO.
- Games of all kinds.
Video games,
card games,
sports, and
fake sports.
- Humor.
The Simpsons, and
Calvin and Hobbes.
- Duke basketball in
all
iterations.
|
