Sergei Vassilvitskii

Orcid: 0000-0003-0235-1624

Affiliations:
  • Google, New York, NY, USA
  • Stanford University, USA (PhD)


According to our database1, Sergei Vassilvitskii authored at least 126 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Winner-Pays-Bid Auctions Minimize Variance.
CoRR, 2024

Scaling Laws for Downstream Task Performance of Large Language Models.
CoRR, 2024

Controlling Tail Risk in Online Ski-Rental.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Scheduling (Dagstuhl Seminar 23061).
Dagstuhl Reports, February, 2023

Measuring Re-identification Risk.
Proc. ACM Manag. Data, 2023

How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacy.
J. Artif. Intell. Res., 2023

Massively Parallel Computation: Algorithms and Applications.
Found. Trends Optim., 2023

Improved Differentially Private Densest Subgraph: Local and Purely Additive.
CoRR, 2023

Challenges towards the Next Frontier in Privacy.
CoRR, 2023

How to DP-fy ML: A Practical Tutorial to Machine Learning with Differential Privacy.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Differentially Private Continual Releases of Streaming Frequency Moment Estimations.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Speeding Up Bellman Ford via Minimum Violation Permutations.
Proceedings of the International Conference on Machine Learning, 2023

Learning-augmented private algorithms for multiple quantile release.
Proceedings of the International Conference on Machine Learning, 2023

Predictive Flows for Faster Ford-Fulkerson.
Proceedings of the International Conference on Machine Learning, 2023

Label differential privacy and private training data release.
Proceedings of the International Conference on Machine Learning, 2023

Easy Differentially Private Linear Regression.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Private Algorithms with Private Predictions.
CoRR, 2022

Smooth Anonymity for Sparse Binary Matrices.
CoRR, 2022

Learning Predictions for Algorithms with Predictions.
CoRR, 2022

Plume: Differential Privacy at Scale.
CoRR, 2022

Algorithms with predictions.
Commun. ACM, 2022

Learning Predictions for Algorithms with Predictions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Algorithms with Prediction Portfolios.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Scalable Differentially Private Clustering via Hierarchically Separated Trees.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Label differential privacy via clustering.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Training Text-to-Text Transformers with Privacy Guarantees.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2022, 2022

2021
Competitive Caching with Machine Learned Advice.
J. ACM, 2021

Secretaries with Advice.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Robust Online Correlation Clustering.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Faster Matchings via Learned Duals.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Clustering for Private Interest-based Advertising.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Private optimization without constraint violations.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Online Scheduling via Learned Weights.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Sliding Window Algorithms for k-Clustering Problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fair Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Algorithms with Predictions.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Differentially Private Covariance Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes.
Proceedings of the 36th International Conference on Machine Learning, 2019

Bounding User Contributions: A Bias-Variance Trade-off in Differential Privacy.
Proceedings of the 36th International Conference on Machine Learning, 2019

Residual Based Sampling for Online Low Rank Approximation.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Consistent Online Optimization: Convex and Submodular.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Matroids, Matchings, and Fairness.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation).
J. ACM, 2018

Testing Incentive Compatibility in Display Ad Auctions.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Maximizing Induced Cardinality Under a Determinantal Point Process.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Online Learning for Non-Stationary A/B Tests.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Local Search Methods for k-Means with Outliers.
Proc. VLDB Endow., 2017

Submodular Optimization Over Sliding Windows.
Proceedings of the 26th International Conference on World Wide Web, 2017

Indexing Public-Private Graphs.
Proceedings of the 26th International Conference on World Wide Web, 2017

Revenue Optimization with Approximate Bid Predictions.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Fair Clustering Through Fairlets.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Statistical Cost Sharing.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Consistent k-Clustering.
Proceedings of the 34th International Conference on Machine Learning, 2017

SQML: large-scale in-database machine learning with pure SQL.
Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, 2017

2016
Incentivizing advertiser networks to submit multiple bids.
Int. J. Game Theory, 2016

A Field Guide to Personalized Reserve Prices.
Proceedings of the 25th International Conference on World Wide Web, 2016

On Mixtures of Markov Chains.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Pricing a Low-regret Seller.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Sketching, Embedding and Dimensionality Reduction in Information Theoretic Spaces.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Fast Greedy Algorithms in MapReduce and Streaming.
ACM Trans. Parallel Comput., 2015

To Match or Not to Match: Economics of Cookie Matching in Online Advertising.
ACM Trans. Economics and Comput., 2015

Display Advertising Auctions with Arbitrage.
ACM Trans. Economics and Comput., 2015

Sketching, Embedding, and Dimensionality Reduction for Information Spaces.
CoRR, 2015

Inverting a Steady-State.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Driven by Food: Modeling Geographic Choice.
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Algorithmic Cartography: Placing Points of Interest and Ads on Maps.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014
Parallel Algorithms for Unsupervised Tagging.
Trans. Assoc. Comput. Linguistics, 2014

Algorithms for Large Scale Graphs (NII Shonan Meeting 2014-12).
NII Shonan Meet. Rep., 2014

Advertising in a stream.
Proceedings of the 23rd International World Wide Web Conference, 2014

The dynamics of repeat consumption.
Proceedings of the 23rd International World Wide Web Conference, 2014

Scalable K-Means by ranked retrieval.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Value of Targeting.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Connected Components in MapReduce and Beyond.
Proceedings of the ACM Symposium on Cloud Computing, 2014

2013
Rank quantization.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Sharding social networks.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

MapReduce Algorithmics.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Near-Optimal Bounds for Cross-Validation via Loss Stability.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Scalable K-Means++.
Proc. VLDB Endow., 2012

Densest Subgraph in Streaming and MapReduce.
Proc. VLDB Endow., 2012

Handling forecast errors while bidding for display advertising.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Ad serving using a compact allocation plan.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Ad Auctions with Data.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

SHALE: an efficient algorithm for allocation of guaranteed display advertising.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Inventory Allocation for Online Graphical Display Advertising using Multi-objective Optimization.
Proceedings of the ICORES 2012, 2012

2011
Optimal Envy-Free Pricing with Metric Substitutability.
SIAM J. Comput., 2011

Counting triangles and the curse of the last reducer.
Proceedings of the 20th International Conference on World Wide Web, 2011

Efficiently evaluating graph constraints in content-based publish/subscribe.
Proceedings of the 20th International Conference on World Wide Web, 2011

Filtering: a method for solving graph problems in MapReduce.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Hiring a secretary from a poset.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

The Multiple Attribution Problem in Pay-Per-Conversion Advertising.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Cross-Validation and Mean-Square Stability.
Proceedings of the Innovations in Computer Science, 2011

Efficiently encoding term co-occurrences in inverted indexes.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Factorization-based lossless compression of inverted indices.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Inventory Allocation for Online Graphical Display Advertising
CoRR, 2010

Generalized distances between rankings.
Proceedings of the 19th International Conference on World Wide Web, 2010

A Model of Computation for MapReduce.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Finding the Jaccard Median.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Efficiently evaluating complex boolean expressions.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Optimal online assignment with forecasts.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

2009
Impression-plus-click auctions.
SIGecom Exch., 2009

The Hiring Problem and Lake Wobegon Strategies.
SIAM J. Comput., 2009

Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method.
SIAM J. Comput., 2009

Indexing Boolean Expressions.
Proc. VLDB Endow., 2009

Battling Predictability and Overconcentration in Recommender Systems.
IEEE Data Eng. Bull., 2009

Nearest-neighbor caching for content-match applications.
Proceedings of the 18th International Conference on World Wide Web, 2009

Adaptive bidding for display advertising.
Proceedings of the 18th International Conference on World Wide Web, 2009

Top-<i>k</i> aggregation using intersections of ranked inputs.
Proceedings of the Second International Conference on Web Search and Web Data Mining, 2009

Contract Auctions for Sponsored Search.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Bidding for Representative Allocations for Display Advertising.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Social Networks and Stable Matchings in the Job Market.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Getting recommender systems to think outside the box.
Proceedings of the 2009 ACM Conference on Recommender Systems, 2009

Similarity caching.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

2008
Relaxation in text search using taxonomies.
Proc. VLDB Endow., 2008

Sponsored Search Auctions with Reserve Prices: Going Beyond Separability.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
K-means: algorithms, analyses, experiments.
PhD thesis, 2007

k-means++: the advantages of careful seeding.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On threshold behavior in query incentive networks.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Tracing the Path: New Model and Algorithms for Collaborative Filtering.
Proceedings of the 23rd International Conference on Data Engineering Workshops, 2007

2006
Using web-graph distance for relevance feedback in web search.
Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

How slow is the <i>k</i>-means method?
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Distinct Values Estimators for Power Law Distributions.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005
Efficiently computing succinct trade-off curves.
Theor. Comput. Sci., 2005

2002
A Complete, Local and Parallel Reconfiguration Algorithm for Cube Style Modular Robots.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

On the General Reconfiguration Problem for Expanding Cube Style Modular Robots.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002


  Loading...