Alessandro Epasto
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
11
Active years
2013–2025
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICML | Scalable Private Partition Selection via Adaptive Weighting. | Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam |
| 2025 | ICML | Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model. | Rachel Cummings, Alessandro Epasto, Jieming Mao, Tamalika Mukherjee, Tingting Ou, Peilin Zhong |
| 2025 | ICML | Retraining with Predicted Hard Labels Provably Increases Model Accuracy. | Rudrajit Das, Inderjit S. Dhillon, Alessandro Epasto, Adel Javanmard, Jieming Mao, Vahab Mirrokni, Sujay Sanghavi, Peilin Zhong |
| 2025 | ICML | Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures. | Alina Ene, Alessandro Epasto, Vahab Mirrokni, Hoai-An Nguyen, Huy L. Nguyen, David P. Woodruff, Peilin Zhong |
| 2025 | KDD | Differentially Private Synthetic Data Release for Topics API Outputs. | Travis Dick, Alessandro Epasto, Adel Javanmard, Josh Karlin, Andrs Muoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong |
| 2024 | AISTATS | A Scalable Algorithm for Individually Fair k-Means Clustering. | MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi |
| 2024 | ICML | Perturb-and-Project: Differentially Private Similarities and Marginals. | Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong |
| 2024 | WWW | Smooth Anonymity for Sparse Graphs. | Alessandro Epasto, Hossein Esfandiari, Vahab Mirrokni, Andrs Muoz Medina |
| 2023 | ICML | Differentially Private Hierarchical Clustering with Provable Approximation Guarantees. | Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni |
| 2022 | KDD | Scalable Differentially Private Clustering via Hierarchically Separated Trees. | Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Muoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii |
| 2022 | SODA | Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | SODA | Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | WSDM | k-Clustering with Fair Outliers. | Matteo Almanza, Alessandro Epasto, Alessandro Panconesi, Giuseppe Re |
| 2021 | KDD | Clustering for Private Interest-based Advertising. | Alessandro Epasto, Andrs Muoz Medina, Steven Avery, Yijian Bai, Rbert Busa-Fekete, CJ Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis, Junyi Jiao, Jakub Lacki, Jason Lee, Arne Mauser, Brian Milch, Vahab S. Mirrokni, Deepak Ravichandran, Wei Shi, Max Spero, Yunting Sun, Umar Syed, Sergei Vassilvitskii, Shuo Wang |
| 2020 | AISTATS | Fair Correlation Clustering. | Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian |
| 2020 | AISTATS | Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. | Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian |
| 2019 | KDD | Clustering without Over-Representation. | Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian |
| 2019 | PODS | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. | Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | WWW | On-Device Algorithms for Public-Private Data with Absolute Privacy. | Alessandro Epasto, Hossein Esfandiari, Vahab S. Mirrokni |
| 2019 | WWW | Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts. | Alessandro Epasto, Bryan Perozzi |
| 2019 | SPAA | Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2018 | WWW | Incentive-Aware Learning for Large Markets. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo |
| 2017 | KDD | Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters. | Alessandro Epasto, Silvio Lattanzi, Renato Paes Leme |
| 2017 | WWW | Submodular Optimization Over Sliding Windows. | Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2017 | WWW | The Spread of Physical Activity Through Social Networks. | David Stck, Haraldur Tmas Hallgrmsson, Greg Ver Steeg, Alessandro Epasto, Luca Foschini |
| 2017 | SPAA | Bicriteria Distributed Submodular Maximization in a Few Rounds. | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2016 | AAAI | Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. | Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin |
| 2016 | KDD | TRIST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. | Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal |
| 2015 | KDD | Efficient Algorithms for Public-Private Social Networks. | Flavio Chierichetti, Alessandro Epasto, Ravi Kumar, Silvio Lattanzi, Vahab S. Mirrokni |
| 2015 | WWW | Efficient Densest Subgraph Computation in Evolving Graphs. | Alessandro Epasto, Silvio Lattanzi, Mauro Sozio |
| 2014 | WWW | Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. | Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni |
| 2013 | IMC | Signals from the crowd: uncovering social relationships through smartphone probes. | Marco Valerio Barbera, Alessandro Epasto, Alessandro Mei, Vasile Claudiu Perta, Julinda Stefa |
| 2013 | SP | SoK: The Evolution of Sybil Defense via Social Networks. | Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi |