Sergei Vassilvitskii

Google Publications

Previous Publications

  •   

    Maximally representative allocations for guaranteed delivery advertising campaigns

    R. Preston McAfee, Kishore Papineni, Sergei Vassilvitskii

    Review of Economic Design, vol. 17 (2013), pp. 83-94

  •  

    Ad Serving Using a Compact Allocation Plan

    Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Y. Zien

    CoRR, vol. abs/1203.3593 (2012)

  •   

    Ad auctions with data

    Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii

    INFOCOM Workshops (2012), pp. 184-189

  •  

    Ad serving using a compact allocation plan

    Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Y. Zien

    ACM Conference on Electronic Commerce (2012), pp. 319-336

  •   

    Ad serving using a compact allocation plan

    Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarjan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Zien

    Proceedings of the 13th ACM Conference on Electronic Commerce, ACM, New York, NY, USA (2012), pp. 319-336

  •  

    Densest Subgraph in Streaming and MapReduce

    Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii

    PVLDB, vol. 5 (2012), pp. 454-465

  •  

    Handling forecast errors while bidding for display advertising

    Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii

    WWW (2012), pp. 371-380

  •  

    Inventory Allocation for Online Graphical Display Advertising using Multi-objective Optimization

    Jian Yang, Erik Vee, Sergei Vassilvitskii, John Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy

    ICORES (2012), pp. 293-304

  •  

    SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising

    Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang

    CoRR, vol. abs/1203.3619 (2012)

  •  

    SHALE: an efficient algorithm for allocation of guaranteed display advertising

    Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang

    KDD (2012), pp. 1195-1203

  •  

    Scalable K-Means++

    Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii

    PVLDB, vol. 5 (2012), pp. 622-633

  •  

    Counting triangles and the curse of the last reducer

    Siddharth Suri, Sergei Vassilvitskii

    WWW (2011), pp. 607-614

  •  

    Cross-Validation and Mean-Square Stability

    Satyen Kale, Ravi Kumar, Sergei Vassilvitskii

    ICS (2011), pp. 487-495

  •  

    Efficiently Encoding Term Co-occurrences in Inverted Indexes

    Marcus Fontoura, Maxim Gurevich, Vanja Josifovski, Sergei Vassilvitskii

    20th ACM Conference on Information and Knowledge Management (CIKM 2011) (to appear)

  •  

    Efficiently Evaluating Graph Constraints in Content-Based Publish/Subscribe

    Andrei Broder, Shirshanka Das, Marcus Fontoura, Bhaskar Ghosh, Vanja Josifovski, Jayavel Shanmugasundaram, Sergei Vassilvitskii

    The 20th International World Wide Web Confererence (WWW 2011)

  •  

    Efficiently encoding term co-occurrences in inverted indexes

    Marcus Fontoura, Maxim Gurevich, Vanja Josifovski, Sergei Vassilvitskii

    CIKM (2011), pp. 307-316

  •  

    Efficiently evaluating graph constraints in content-based publish/subscribe

    Andrei Z. Broder, Shirshanka Das, Marcus Fontoura, Bhaskar Ghosh, Vanja Josifovski, Jayavel Shanmugasundaram, Sergei Vassilvitskii

    WWW (2011), pp. 497-506

  •  

    Factorization-based Lossless Compression of Inverted Indices

    George Beskales, Marcus Fontoura, Maxim Gurevich, Vanja Josifovski, Sergei Vassilvitskii

    20th ACM Conference on Information and Knowledge Management (CIKM 2011) (to appear)

  •  

    Factorization-based Lossless Compression of Inverted Indices

    George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski

    CoRR, vol. abs/1108.1956 (2011)

  •  

    Factorization-based lossless compression of inverted indices

    George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski

    CIKM (2011), pp. 327-332

  •  

    Filtering: a method for solving graph problems in MapReduce

    Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii

    SPAA (2011), pp. 85-94

  •  

    Filtering: a method for solving graph problems in MapReduce.

    Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii

    SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85-94

  •  

    Hiring a secretary from a poset

    Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani

    ACM Conference on Electronic Commerce (2011), pp. 39-48

  •  

    Hiring a secretary from a poset.

    Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani

    Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), pp. 39-48

  •  

    Optimal Envy-Free Pricing with Metric Substitutability

    Ning Chen, Arpita Ghosh, Sergei Vassilvitskii

    SIAM J. Comput., vol. 40 (2011), pp. 623-645

  •  

    The Multiple Attribution Problem in Pay-Per-Conversion Advertising

    Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee

    SAGT (2011), pp. 31-43

  •  

    A Model of Computation for MapReduce

    Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii

    SODA (2010), pp. 938-948

  •  

    Efficiently evaluating complex boolean expressions

    Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien

    SIGMOD Conference (2010), pp. 3-14

  •  

    Finding the Jaccard Median

    Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii

    SODA (2010), pp. 293-311

  •  

    Generalized distances between rankings

    Ravi Kumar, Sergei Vassilvitskii

    WWW (2010), pp. 571-580

  •  

    Inventory Allocation for Online Graphical Display Advertising

    Jian Yang, Erik Vee, Sergei Vassilvitskii, John Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy

    CoRR, vol. abs/1008.3551 (2010)

  •  

    Optimal online assignment with forecasts

    Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasundaram

    ACM Conference on Electronic Commerce (2010), pp. 109-118

  •  

    Adaptive bidding for display advertising

    Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Vassilvitskii, Martin Zinkevich

    WWW (2009), pp. 251-260

  •  

    Battling Predictability and Overconcentration in Recommender Systems

    Sihem Amer-Yahia, Laks V. S. Lakshmanan, Sergei Vassilvitskii, Cong Yu

    IEEE Data Eng. Bull., vol. 32 (2009), pp. 33-40

  •  

    Bidding for Representative Allocations for Display Advertising

    Arpita Ghosh, Randolph Preston McAfee, Kishore Papineni, Sergei Vassilvitskii

    CoRR, vol. abs/0910.0880 (2009)

  •  

    Bidding for Representative Allocations for Display Advertising

    Arpita Ghosh, Randolph Preston McAfee, Kishore Papineni, Sergei Vassilvitskii

    WINE (2009), pp. 208-219

  •  

    Contract Auctions for Sponsored Search

    Sharad Goel, Sébastien Lahaie, Sergei Vassilvitskii

    WINE (2009), pp. 196-207

  •  

    Getting Recommender Systems to Think outside the Box

    Zeinab Abbassi, Sihem Amer-Yahia, Laks V. S. Lakshmanan, Sergei Vassilvitskii, Cong Yu

    RecSys (2009), pp. 285-288

  •  

    Impression-plus-click auctions

    Sharad Goel, Sébastien Lahaie, Sergei Vassilvitskii

    SIGecom Exchanges, vol. 8 (2009), pp. 8

  •  

    Indexing Boolean Expressions

    Steven Euijong Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina

    Proc. 35th Int'l Conf. on Very Large Data Bases (PVLDB) (2009), pp. 37-48

  •  

    Indexing Boolean Expressions

    Steven Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina

    PVLDB, vol. 2 (2009), pp. 37-48

  •  

    Nearest-neighbor caching for content-match applications

    Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii

    WWW (2009), pp. 441-450

  •  

    Similarity caching

    Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii

    PODS (2009), pp. 127-136

  •  

    Social Networks and Stable Matchings in the Job Market

    Esteban Arcaute, Sergei Vassilvitskii

    CoRR, vol. abs/0910.0916 (2009)

  •  

    Social Networks and Stable Matchings in the Job Market

    Esteban Arcaute, Sergei Vassilvitskii

    WINE (2009), pp. 220-231

  •  

    The Hiring Problem and Lake Wobegon Strategies

    Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii

    SIAM J. Comput., vol. 39 (2009), pp. 1233-1255

  •  

    Top-k aggregation using intersections of ranked inputs

    Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vassilvitskii

    WSDM (2009), pp. 222-231

  •  

    Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method

    David Arthur, Sergei Vassilvitskii

    SIAM J. Comput., vol. 39 (2009), pp. 766-782

  •  

    Optimal envy-free pricing with metric substitutability

    Ning Chen, Arpita Ghosh, Sergei Vassilvitskii

    ACM Conference on Electronic Commerce (2008), pp. 60-69

  •  

    Relaxation in text search using taxonomies

    Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Christopher Olston, Andrew Tomkins, Sergei Vassilvitskii

    PVLDB, vol. 1 (2008), pp. 672-683

  •  

    Sponsored Search Auctions with Reserve Prices: Going Beyond Separability

    Rica Gonen, Sergei Vassilvitskii

    WINE (2008), pp. 597-608

  •  

    The hiring problem and Lake Wobegon strategies

    Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii

    SODA (2008), pp. 1184-1193

  •  

    On threshold behavior in query incentive networks

    Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii

    ACM Conference on Electronic Commerce (2007), pp. 66-74

  •  

    Tracing the Path: New Model and Algorithms for Collaborative Filtering

    Rajeev Motwani, Sergei Vassilvitskii

    ICDE Workshops (2007), pp. 853-862

  •  

    k-means++: the advantages of careful seeding

    David Arthur, Sergei Vassilvitskii

    SODA (2007), pp. 1027-1035

  •  

    How slow is the k-means method?

    David Arthur, Sergei Vassilvitskii

    Symposium on Computational Geometry (2006), pp. 144-153

  •  

    Using web-graph distance for relevance feedback in web search

    Sergei Vassilvitskii, Eric Brill

    SIGIR (2006), pp. 147-153

  •  

    Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

    David Arthur, Sergei Vassilvitskii

    FOCS (2006), pp. 153-164

  •  

    Efficiently computing succinct trade-off curves

    Sergei Vassilvitskii, Mihalis Yannakakis

    Theor. Comput. Sci., vol. 348 (2005), pp. 334-356

  •  

    Efficiently Computing Succinct Trade-Off Curves

    Sergei Vassilvitskii, Mihalis Yannakakis

    ICALP (2004), pp. 1201-1213

  •  

    On the General Reconfiguration Problem for Expanding Cube Style Modular Robots

    Sergei Vassilvitskii, Jeremy Kubica, Eleanor G. Rieffel, John W. Suh, Mark Yim

    ICRA (2002), pp. 801-808

  •  

    On the General Reconfiguration Problem for Expanding Cube Style Modular Robots

    Sergei Vassilvitskii, Jeremy Kubica, Eleanor G. Rieffel, John W. Suh, Mark Yim

    Proceedings of the 2002 IEEE Int. Conference on Robotics and Automation, pp. 801-808