Silvio Lattanzi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
73
Venues
18
Active years
2008–2026
Best venue rank
A*
Where they publish
Papers
73 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | COLT | Algorithmic Thinking Theory. | MohammadHossein Bateni, Vincent Cohen-Addad, Yuzhou Gu, Silvio Lattanzi, Simon Meierhans, Christopher Mohri |
| 2026 | COLT | Active Learning on Adversarially Corrupted Graphs. | Marco Bressan, Nicol Cesa-Bianchi, Tommaso d'Orsi, Emmanuel Esposito, Silvio Lattanzi |
| 2026 | ICALP | Learning Multinomial Logits in O(n log n) Time. | Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins |
| 2026 | SODA | Spectral Clustering with Side Information. | Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali, Weronika Wrzos-Kaminska |
| 2025 | COLT | Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams. | Ainesh Bakshi, Vincent Cohen-Addad, Rajesh Jayaram, Sam Hopkins, Silvio Lattanzi |
| 2025 | ICALP | Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds. | Michael Kapralov, Akash Kumar, Silvio Lattanzi, Aida Mousavifar, Weronika Wrzos-Kaminska |
| 2025 | ICML | Almost Optimal Fully Dynamic k-Center Clustering with Recourse. | Sayan Bhattacharya, Martn Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis |
| 2025 | ICML | Algorithms and Hardness for Active Learning on Graphs. | Vincent Cohen-Addad, Silvio Lattanzi, Simon Meierhans |
| 2025 | SODA | Almost Tight Bounds for Differentially Private Densest Subgraph. | Michael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii |
| 2025 | STOC | Almost Optimal PAC Learning for k-Means. | Vincent Cohen-Addad, Silvio Lattanzi, Chris Schwiegelshohn |
| 2025 | STOC | The Cost of Consistency: Submodular Maximization with Constant Recourse. | Paul Dtting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam |
| 2024 | AISTATS | A Scalable Algorithm for Individually Fair k-Means Clustering. | MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi |
| 2024 | FOCS | Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. | Sayan Bhattacharya, Martn Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis |
| 2024 | ICML | Multi-View Stochastic Block Models. | Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser |
| 2024 | ICML | Dynamic Correlation Clustering in Sublinear Update Time. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2024 | ICML | Consistent Submodular Maximization. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 2024 | KDD | Resilient k-Clustering. | Sara Ahmadian, MohammadHossein Bateni, Hossein Esfandiari, Silvio Lattanzi, Morteza Monemizadeh, Ashkan Norouzi-Fard |
| 2023 | ICML | Fully Dynamic Submodular Maximization over Matroids. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 2023 | ICML | Speeding Up Bellman Ford via Minimum Violation Permutations. | Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii |
| 2023 | SODA | Learning Hierarchical Cluster Structure of Graphs in Sublinear Time. | Michael Kapralov, Akash Kumar, Silvio Lattanzi, Aida Mousavifar |
| 2022 | COCOON | Fully Dynamic k-Center Clustering with Outliers. | T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang |
| 2022 | COLT | Approximate Cluster Recovery from Noisy Labels. | Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2022 | ICML | Online and Consistent Correlation Clustering. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2022 | ICML | Deletion Robust Submodular Maximization over Matroids. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 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 | PODS | The Gibbs-Rand Model. | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi |
| 2021 | COLT | Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. | Marco Bressan, Nicol Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice |
| 2021 | ICML | Correlation Clustering in Constant Many Parallel Rounds. | Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski |
| 2021 | WWW | Twin Peaks, a Model for Recurring Cascades. | Matteo Almanza, Silvio Lattanzi, Alessandro Panconesi, Giuseppe Re |
| 2021 | SODA | Consistent k-Clustering for General Metrics. | Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2021 | SODA | Spectral Clustering Oracles in Sublinear Time. | Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler |
| 2020 | ITA | Residual Based Sampling for Online Low Rank Approximation. | Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2020 | SODA | Online Scheduling via Learned Weights. | Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii |
| 2019 | AISTATS | Matroids, Matchings, and Fairness. | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii |
| 2019 | AISTATS | Consistent Online Optimization: Convex and Submodular. | Mohammad Reza Karimi Jaghargh, Andreas Krause, Silvio Lattanzi, Sergei Vassilvitskii |
| 2019 | FOCS | Residual Based Sampling for Online Low Rank Approximation. | Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | ICML | Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. | Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi |
| 2019 | ICML | Improved Parallel Algorithms for Density-Based Network Clustering. | Mohsen Ghaffari, Silvio Lattanzi, Slobodan Mitrovic |
| 2019 | ICML | A Better k-means++ Algorithm via Local Search. | Silvio Lattanzi, Christian Sohler |
| 2019 | PODS | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. | Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | SPAA | Dynamic Algorithms for the Massively Parallel Computation Model. | Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis |
| 2018 | AISTATS | One-shot Coresets: The Case of k-Clustering. | Olivier Bachem, Mario Lucic, Silvio Lattanzi |
| 2018 | ICML | Parallel and Streaming Algorithms for K-Core Decomposition. | Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni |
| 2017 | ICML | Algorithms for $\ell_p$ Low-Rank Approximation. | Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff |
| 2017 | ICML | Consistent k-Clustering. | Silvio Lattanzi, Sergei Vassilvitskii |
| 2017 | KDD | Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters. | Alessandro Epasto, Silvio Lattanzi, Renato Paes Leme |
| 2017 | WWW | Indexing Public-Private Graphs. | Aaron Archer, Silvio Lattanzi, Peter Likarish, Sergei Vassilvitskii |
| 2017 | WWW | Submodular Optimization Over Sliding Windows. | Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2016 | WWW | On Sampling Nodes in a Network. | Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi, Tams Sarls |
| 2016 | WWW | Linking Users Across Domains with Location Data: Theory and Validation. | Christopher J. Riederer, Yunsung Kim, Augustin Chaintreau, Nitish Korula, Silvio Lattanzi |
| 2016 | SODA | Expanders via Local Edge Flips. | Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia |
| 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 |
| 2015 | WSDM | Distributed Graph Algorithmics: Theory and Practice. | Silvio Lattanzi, Vahab S. Mirrokni |
| 2015 | WSDM | The Power of Random Neighbors in Social Networks. | Silvio Lattanzi, Yaron Singer |
| 2014 | CLOUD | Connected Components in MapReduce and Beyond. | Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni, Vibhor Rastogi, Sergei Vassilvitskii |
| 2014 | WWW | Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. | Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni |
| 2014 | SODA | Learning Entangled Single-Sample Gaussians. | Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi |
| 2014 | SIGMETRICS | Filter & follow: how social media foster content curation. | Avner May, Augustin Chaintreau, Nitish Korula, Silvio Lattanzi |
| 2014 | WAW | Efficient Computation of the Weighted Clustering Coefficient. | Silvio Lattanzi, Stefano Leonardi |
| 2013 | ICML | A Local Algorithm for Finding Well-Connected Clusters. | Zeyuan Allen Zhu, Silvio Lattanzi, Vahab S. Mirrokni |
| 2013 | SP | SoK: The Evolution of Sybil Defense via Social Networks. | Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi |
| 2013 | WSDM | Arrival and departure dynamics in social networks. | Shaomei Wu, Atish Das Sarma, Alex Fabrikant, Silvio Lattanzi, Andrew Tomkins |
| 2011 | WWW | Milgram-routing in social networks. | Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar |
| 2011 | WSDM | An algorithmic treatment of strong queries. | Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan |
| 2011 | SPAA | Filtering: a method for solving graph problems in MapReduce. | Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii |
| 2010 | SODA | Rumour Spreading and Graph Conductance. | Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi |
| 2010 | STOC | Almost tight bounds for rumour spreading with conductance. | Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi |
| 2009 | FOCS | Models for the Compressible Web. | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan |
| 2009 | ICALP | Rumor Spreading in Social Networks. | Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi |
| 2009 | KDD | On compressing social networks. | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan |
| 2009 | STOC | Affiliation networks. | Silvio Lattanzi, D. Sivakumar |
| 2008 | WSDM | On placing skips optimally in expectation. | Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi |