The SCEAS System
Navigation Menu

Search the dblp DataBase


Sergei Vassilvitskii: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Arthur, Sergei Vassilvitskii
    How slow is the k-means method? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:144-153 [Conf]
  2. David Arthur, Sergei Vassilvitskii
    Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:153-164 [Conf]
  3. Sergei Vassilvitskii, Mihalis Yannakakis
    Efficiently Computing Succinct Trade-Off Curves. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1201-1213 [Conf]
  4. Sergei Vassilvitskii, Jeremy Kubica, Eleanor G. Rieffel, John W. Suh, Mark Yim
    On the General Reconfiguration Problem for Expanding Cube Style Modular Robots. [Citation Graph (0, 0)][DBLP]
    ICRA, 2002, pp:801-808 [Conf]
  5. Sergei Vassilvitskii, Mark Yim, John W. Suh
    A Complete, Local and Parallel Reconfiguration Algorithm for Cube Style Modular Robots. [Citation Graph (0, 0)][DBLP]
    ICRA, 2002, pp:117-122 [Conf]
  6. Sergei Vassilvitskii, Eric Brill
    Using web-graph distance for relevance feedback in web search. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2006, pp:147-153 [Conf]
  7. Sergei Vassilvitskii, Mihalis Yannakakis
    Efficiently computing succinct trade-off curves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:334-356 [Journal]
  8. Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii
    On threshold behavior in query incentive networks. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:66-74 [Conf]
  9. David Arthur, Sergei Vassilvitskii
    k-means++: the advantages of careful seeding. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1027-1035 [Conf]

  10. Tracing the Path: New Model and Algorithms for Collaborative Filtering. [Citation Graph (, )][DBLP]

  11. Similarity caching. [Citation Graph (, )][DBLP]

  12. Optimal online assignment with forecasts. [Citation Graph (, )][DBLP]

  13. Optimal envy-free pricing with metric substitutability. [Citation Graph (, )][DBLP]

  14. Efficiently evaluating complex boolean expressions. [Citation Graph (, )][DBLP]

  15. The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]

  16. Finding the Jaccard Median. [Citation Graph (, )][DBLP]

  17. A Model of Computation for MapReduce. [Citation Graph (, )][DBLP]

  18. Sponsored Search Auctions with Reserve Prices: Going Beyond Separability. [Citation Graph (, )][DBLP]

  19. Social Networks and Stable Matchings in the Job Market. [Citation Graph (, )][DBLP]

  20. Contract Auctions for Sponsored Search. [Citation Graph (, )][DBLP]

  21. Bidding for Representative Allocations for Display Advertising. [Citation Graph (, )][DBLP]

  22. Nearest-neighbor caching for content-match applications. [Citation Graph (, )][DBLP]

  23. Adaptive bidding for display advertising. [Citation Graph (, )][DBLP]

  24. Generalized distances between rankings. [Citation Graph (, )][DBLP]

  25. Getting recommender systems to think outside the box. [Citation Graph (, )][DBLP]

  26. Top-k aggregation using intersections of ranked inputs. [Citation Graph (, )][DBLP]

  27. Bidding for Representative Allocations for Display Advertising [Citation Graph (, )][DBLP]

  28. Social Networks and Stable Matchings in the Job Market [Citation Graph (, )][DBLP]

  29. Inventory Allocation for Online Graphical Display Advertising [Citation Graph (, )][DBLP]

  30. Battling Predictability and Overconcentration in Recommender Systems. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002