Alessandro Epasto

Orcid: 0000-0003-0456-3217

Affiliations:
  • Google, New York, NY, USA


According to our database1, Alessandro Epasto authored at least 44 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Scalable Algorithm for Individually Fair K-means Clustering.
CoRR, 2024

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

Differentially Private Clustering in Data Streams.
CoRR, 2023

k-Means Clustering with Distance-Based Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Private estimation algorithms for stochastic block models and mixture models.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

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

Differentially Private Hierarchical Clustering with Provable Approximation Guarantees.
Proceedings of the International Conference on Machine Learning, 2023

2022
Smooth Anonymity for Sparse Binary Matrices.
CoRR, 2022

k-Clustering with Fair Outliers.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Massively Parallel and Dynamic Algorithms for Minimum Size Clustering.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Private and Scalable $k$-Clustering.
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

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

2020
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Smoothly Bounding User Contributions in Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 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

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Fair Correlation Clustering.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts.
Proceedings of the World Wide Web Conference, 2019

On-Device Algorithms for Public-Private Data with Absolute Privacy.
Proceedings of the World Wide Web Conference, 2019

Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement).
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 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

Clustering without Over-Representation.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018
Efficient Approximation for Restricted Biclique Cover Problems.
Algorithms, 2018

Incentive-Aware Learning for Large Markets.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2017
TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size.
ACM Trans. Knowl. Discov. Data, 2017

The Spread of Physical Activity Through Social Networks.
Proceedings of the 26th International Conference on World Wide Web, 2017

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

Bicriteria Distributed Submodular Maximization in a Few Rounds.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Real-Time Targeted-Influence Queries over Large Graphs.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Ego-net Community Mining Applied to Friend Suggestion.
Proc. VLDB Endow., 2015

Efficient Densest Subgraph Computation in Evolving Graphs.
Proceedings of the 24th International Conference on World Wide Web, 2015

Efficient Algorithms for Public-Private Social Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014
Communities, Random Walks, and Social Sybil Defense.
Internet Math., 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

Spreading rumours without the network.
Proceedings of the second ACM conference on Online social networks, 2014

2013
SoK: The Evolution of Sybil Defense via Social Networks.
Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

Signals from the crowd: uncovering social relationships through smartphone probes.
Proceedings of the 2013 Internet Measurement Conference, 2013

2010
On a Model for Integrated Information
CoRR, 2010


  Loading...