Obserwuj
Sergei Vassilvitskii
Sergei Vassilvitskii
Google
Zweryfikowany adres z google.com - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
k-means++: The advantages of careful seeding
D Arthur, S Vassilvitskii
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2006
91182006
Scalable k-means++
B Bahmani, B Moseley, A Vattani, R Kumar, S Vassilvitskii
arXiv preprint arXiv:1203.6402, 2012
8032012
A model of computation for mapreduce
H Karloff, S Suri, S Vassilvitskii
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
6472010
How slow is the k-means method?
D Arthur, S Vassilvitskii
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
5652006
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
5072011
Fair clustering through fairlets
F Chierichetti, R Kumar, S Lattanzi, S Vassilvitskii
Advances in neural information processing systems 30, 2017
3452017
Generalized distances between rankings
R Kumar, S Vassilvitskii
Proceedings of the 19th international conference on World wide web, 571-580, 2010
3292010
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
2922011
Densest subgraph in streaming and mapreduce
B Bahmani, R Kumar, S Vassilvitskii
arXiv preprint arXiv:1201.6567, 2012
2482012
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
2362015
Competitive caching with machine learned advice
T Lykouris, S Vassilvitskii
Journal of the ACM (JACM) 68 (4), 1-25, 2021
2202021
Bidding for representative allocations for display advertising
A Ghosh, P McAfee, K Papineni, S Vassilvitskii
Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009
1672009
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
1552002
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
119*2010
Efficiently computing succinct trade-off curves
S Vassilvitskii, M Yannakakis
Theoretical Computer Science 348 (2-3), 334-356, 2005
1152005
Online scheduling via learned weights
S Lattanzi, T Lavastida, B Moseley, S Vassilvitskii
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
1122020
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
110*2014
Optimal online assignment with forecasts
E Vee, S Vassilvitskii, J Shanmugasundaram
Proceedings of the 11th ACM conference on Electronic commerce, 109-118, 2010
1092010
Indexing boolean expressions
S Whang, C Brower, J Shanmugasundaram, S Vassilvitskii, E Vee, ...
Stanford InfoLab, 2009
1072009
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
1042009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20