| k-means++: The advantages of careful seeding D Arthur, S Vassilvitskii Stanford, 2006 | 6322 | 2006 |
| Scalable k-means++ B Bahmani, B Moseley, A Vattani, R Kumar, S Vassilvitskii arXiv preprint arXiv:1203.6402, 2012 | 650 | 2012 |
| A model of computation for mapreduce H Karloff, S Suri, S Vassilvitskii Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 549 | 2010 |
| How slow is the k-means method? D Arthur, S Vassilvitskii Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 481 | 2006 |
| Counting triangles and the curse of the last reducer S Suri, S Vassilvitskii Proceedings of the 20th international conference on World wide web, 607-614, 2011 | 450 | 2011 |
| Generalized distances between rankings R Kumar, S Vassilvitskii Proceedings of the 19th international conference on World wide web, 571-580, 2010 | 262 | 2010 |
| Filtering: a method for solving graph problems in mapreduce S Lattanzi, B Moseley, S Suri, S Vassilvitskii Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011 | 256 | 2011 |
| Fast greedy algorithms in mapreduce and streaming R Kumar, B Moseley, S Vassilvitskii, A Vattani ACM Transactions on Parallel Computing (TOPC) 2 (3), 1-22, 2015 | 196 | 2015 |
| Densest subgraph in streaming and mapreduce B Bahmani, R Kumar, S Vassilvitskii arXiv preprint arXiv:1201.6567, 2012 | 196 | 2012 |
| Fair clustering through fairlets F Chierichetti, R Kumar, S Lattanzi, S Vassilvitskii arXiv preprint arXiv:1802.05733, 2018 | 150 | 2018 |
| Bidding for representative allocations for display advertising A Ghosh, P McAfee, K Papineni, S Vassilvitskii International workshop on internet and network economics, 208-219, 2009 | 145 | 2009 |
| A complete, local and parallel reconfiguration algorithm for cube style modular robots S Vassilvitskii, M Yim, J Suh Proceedings 2002 IEEE International Conference on Robotics and Automation …, 2002 | 143 | 2002 |
| WORST-CASE AND SMOOTHED ANALYSIS OF THE ICP ALGORITHM, WITH AN APPLICATION TO THE κ-MEANS METHOD D ARTHUR, S VASSILVITSKII SIAM journal on computing 39 (2), 766-782, 2010 | 107* | 2010 |
| Efficiently computing succinct trade-off curves S Vassilvitskii, M Yannakakis Theoretical Computer Science 348 (2-3), 334-356, 2005 | 106 | 2005 |
| Indexing boolean expressions S Whang, C Brower, J Shanmugasundaram, S Vassilvitskii, E Vee, ... Stanford InfoLab, 2009 | 102 | 2009 |
| Optimal online assignment with forecasts E Vee, S Vassilvitskii, J Shanmugasundaram Proceedings of the 11th ACM conference on Electronic commerce, 109-118, 2010 | 91 | 2010 |
| Adaptive bidding for display advertising A Ghosh, BIP Rubinstein, S Vassilvitskii, M Zinkevich Proceedings of the 18th international conference on World wide web, 251-260, 2009 | 90 | 2009 |
| Connected components in mapreduce and beyond R Kiveris, S Lattanzi, V Mirrokni, V Rastogi, S Vassilvitskii Proceedings of the ACM Symposium on Cloud Computing, 1-13, 2014 | 87* | 2014 |
| Getting recommender systems to think outside the box Z Abbassi, S Amer-Yahia, LVS Lakshmanan, S Vassilvitskii, C Yu Proceedings of the third ACM conference on Recommender systems, 285-288, 2009 | 71 | 2009 |
| The dynamics of repeat consumption A Anderson, R Kumar, A Tomkins, S Vassilvitskii Proceedings of the 23rd international conference on World wide web, 419-430, 2014 | 69 | 2014 |
Ravi KumarGoogleVerified email at google.com
