|
Research Area: Search Technologies, Computational Advertising |
Profile
Sergei Vassilvitskii is a research scientist at Yahoo! working on all things related to computational advertising, from search & caching algorithms to mechanism design & bidding agents. He received his Ph.D. from Stanford in 2007, where he was a National Defense Science & Engineering Graduate Fellow (2002-2005) and a Microsoft Research Graduate Fellow (2006-2007). He received his B.S. from Cornell in 2002.
Recent Publications, Projects and News
- The Hiring Problem and Lake Wobegon Strategies Andrei Broder; Adam Kirsch; Ravi Kumar; Michael Mitzenmacher; Eli Upfal; Sergei Vassilvitskii, Symposium on Discrete Algorithms, 2008
- Relaxation in Text Search using Taxonomies M. Fontoura; V. Josifovski; R. Kumar; C. Olston; A. Tomkins; S. Vassilvitskii, International Conference on Very Large Data Bases, 2008
- Optimal Envy-free Pricing with Metric Substitutability Ning Chen; Arpita Ghosh; Sergei Vassilvitskii, ACM Conference on Electronic Commerce (EC'08), 2008 [view abstract]
- k-means++: The advantages of Careful Seeding David Arthur; Sergei Vassilvitskii, Symposium on Discrete Algorithms, 2007
- On threshold behavior in query incentive networks. Arcaute, Esteban ; Kirsch, Adam ; Kumar, Ravi ; Liben-Nowell, David ; Vassilvitskii, Sergei, ACM Conference on Electronic Commerce, 2007
- Distinct Value Estimators in Power Law Distributions. Rajeev Motwani; Sergei Vassilvitskii, 2006
- How slow is the k-means method? David Arthur; Sergei Vassilvitskii, Symposium on Computational Geometry, 2006
- Using Web Graph Distance For Relevance Feedback in Web Search Sergei Vassilvitskii; Erik Brill, SIGIR, 2006
- Worst-case and Smoothed Analyses of the ICP Algorithm, With an Application to the k-means Method David Arthur; Sergei Vassilvitskii, Symposium on Foundations of Computer Science, 2006
- Efficiently Computing Succinct Trade-off Curves. Sergei Vassilvitskii; Mihalis Yannakakis, ICALP, 2004