| 2008 |
|---|
| 11 | EE | Andrei Z. Broder,
Adam Kirsch,
Ravi Kumar,
Michael Mitzenmacher,
Eli Upfal,
Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies.
SODA 2008: 1184-1193 |
| 2007 |
|---|
| 10 | EE | Esteban Arcaute,
Adam Kirsch,
Ravi Kumar,
David Liben-Nowell,
Sergei Vassilvitskii:
On threshold behavior in query incentive networks.
ACM Conference on Electronic Commerce 2007: 66-74 |
| 9 | EE | Rajeev Motwani,
Sergei Vassilvitskii:
Tracing the Path: New Model and Algorithms for Collaborative Filtering.
ICDE Workshops 2007: 853-862 |
| 8 | EE | David Arthur,
Sergei Vassilvitskii:
k-means++: the advantages of careful seeding.
SODA 2007: 1027-1035 |
| 2006 |
|---|
| 7 | EE | 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 |
| 6 | EE | Sergei Vassilvitskii,
Eric Brill:
Using web-graph distance for relevance feedback in web search.
SIGIR 2006: 147-153 |
| 5 | EE | David Arthur,
Sergei Vassilvitskii:
How slow is the k-means method?
Symposium on Computational Geometry 2006: 144-153 |
| 2005 |
|---|
| 4 | EE | Sergei Vassilvitskii,
Mihalis Yannakakis:
Efficiently computing succinct trade-off curves.
Theor. Comput. Sci. 348(2-3): 334-356 (2005) |
| 2004 |
|---|
| 3 | EE | Sergei Vassilvitskii,
Mihalis Yannakakis:
Efficiently Computing Succinct Trade-Off Curves.
ICALP 2004: 1201-1213 |
| 2002 |
|---|
| 2 | | Sergei Vassilvitskii,
Mark Yim,
John W. Suh:
A Complete, Local and Parallel Reconfiguration Algorithm for Cube Style Modular Robots.
ICRA 2002: 117-122 |
| 1 | | Sergei Vassilvitskii,
Jeremy Kubica,
Eleanor G. Rieffel,
John W. Suh,
Mark Yim:
On the General Reconfiguration Problem for Expanding Cube Style Modular Robots.
ICRA 2002: 801-808 |
