dblp.uni-trier.dewww.uni-trier.de

Sergei Vassilvitskii

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
17EERavi Kumar, Kunal Punera, Torsten Suel, Sergei Vassilvitskii: Top-k aggregation using intersections of ranked inputs. WSDM 2009: 222-231
16EEArpita Ghosh, Benjamin I. P. Rubinstein, Sergei Vassilvitskii, Martin Zinkevich: Adaptive bidding for display advertising. WWW 2009: 251-260
15EESandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii: Nearest-neighbor caching for content-match applications. WWW 2009: 441-450
2008
14EENing Chen, Arpita Ghosh, Sergei Vassilvitskii: Optimal envy-free pricing with metric substitutability. ACM Conference on Electronic Commerce 2008: 60-69
13EEAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193
12EERica Gonen, Sergei Vassilvitskii: Sponsored Search Auctions with Reserve Prices: Going Beyond Separability. WINE 2008: 597-608
11EEMarcus Fontoura, Vanja Josifovski, Ravi Kumar, Christopher Olston, Andrew Tomkins, Sergei Vassilvitskii: Relaxation in text search using taxonomies. PVLDB 1(1): 672-683 (2008)
2007
10EEEsteban 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
9EERajeev Motwani, Sergei Vassilvitskii: Tracing the Path: New Model and Algorithms for Collaborative Filtering. ICDE Workshops 2007: 853-862
8EEDavid Arthur, Sergei Vassilvitskii: k-means++: the advantages of careful seeding. SODA 2007: 1027-1035
2006
7EEDavid Arthur, Sergei Vassilvitskii: Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method. FOCS 2006: 153-164
6EESergei Vassilvitskii, Eric Brill: Using web-graph distance for relevance feedback in web search. SIGIR 2006: 147-153
5EEDavid Arthur, Sergei Vassilvitskii: How slow is the k-means method? Symposium on Computational Geometry 2006: 144-153
2005
4EESergei Vassilvitskii, Mihalis Yannakakis: Efficiently computing succinct trade-off curves. Theor. Comput. Sci. 348(2-3): 334-356 (2005)
2004
3EESergei 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

Coauthor Index

1Esteban Arcaute [10]
2David Arthur [5] [7] [8]
3Eric Brill [6]
4Andrei Z. Broder [13] [15]
5Ning Chen [14]
6Flavio Chierichetti [15]
7Marcus Fontoura [11]
8Arpita Ghosh [14] [16]
9Rica Gonen [12]
10Vanja Josifovski [11] [15]
11Adam Kirsch [10] [13]
12Jeremy Kubica [1]
13Ravi Kumar (S. Ravi Kumar) [10] [11] [13] [15] [17]
14David Liben-Nowell [10]
15Michael Mitzenmacher [13]
16Rajeev Motwani [9]
17Christopher Olston (Chris Olston) [11]
18Sandeep Pandey [15]
19Kunal Punera [17]
20Eleanor G. Rieffel [1]
21Benjamin I. P. Rubinstein [16]
22Torsten Suel [17]
23John W. Suh [1] [2]
24Andrew Tomkins [11]
25Eli Upfal [13]
26Mihalis Yannakakis [3] [4]
27Mark Yim [1] [2]
28Martin Zinkevich [16]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)