default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Silvio Lattanzi
Google Research, Zurich, Switzerland
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 146 matches
- 2024
- T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. Algorithmica 86(1): 171-193 (2024) - Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Margin-Based Active Learning of Classifiers. J. Mach. Learn. Res. 25: 127:1-127:45 (2024) - Paul Dütting, Silvio Lattanzi, Renato Paes Leme, Sergei Vassilvitskii:
Secretaries with Advice. Math. Oper. Res. 49(2): 856-879 (2024) - MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi:
A Scalable Algorithm for Individually Fair k-Means Clustering. AISTATS 2024: 3151-3159 - Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis:
Dynamic Correlation Clustering in Sublinear Update Time. ICML 2024 - Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser:
Multi-View Stochastic Block Models. ICML 2024 - Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024 - Sara Ahmadian, MohammadHossein Bateni, Hossein Esfandiari, Silvio Lattanzi, Morteza Monemizadeh, Ashkan Norouzi-Fard:
Resilient k-Clustering. KDD 2024: 29-38 - Luz Angelica Caudillo-Mata, Silvio Lattanzi, Andrés Muñoz Medina, Leman Akoglu, Aristides Gionis, Sergei Vassilvitskii:
Proceedings of the 17th ACM International Conference on Web Search and Data Mining, WSDM 2024, Merida, Mexico, March 4-8, 2024. ACM 2024 [contents] - MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi:
A Scalable Algorithm for Individually Fair K-means Clustering. CoRR abs/2402.06730 (2024) - Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - Vincent Cohen-Addad, Tommaso d'Orsi, Silvio Lattanzi, Rajai Nasser:
Multi-View Stochastic Block Models. CoRR abs/2406.04860 (2024) - Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis:
Dynamic Correlation Clustering in Sublinear Update Time. CoRR abs/2406.09137 (2024) - Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. CoRR abs/2408.01325 (2024) - 2023
- Sungjin Im, Ravi Kumar, Silvio Lattanzi, Benjamin Moseley, Sergei Vassilvitskii:
Massively Parallel Computation: Algorithms and Applications. Found. Trends Optim. 5(4): 340-417 (2023) - Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii:
Speeding Up Bellman Ford via Minimum Violation Permutations. ICML 2023: 18584-18598 - Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis:
Multi-Swap k-Means++. NeurIPS 2023 - Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering in Õ(k) Update Time. NeurIPS 2023 - Michael Kapralov, Akash Kumar, Silvio Lattanzi, Aida Mousavifar:
Learning Hierarchical Cluster Structure of Graphs in Sublinear Time. SODA 2023: 925-939 - Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - Michael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii:
Improved Differentially Private Densest Subgraph: Local and Purely Additive. CoRR abs/2308.10316 (2023) - Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis:
Multi-Swap k-Means++. CoRR abs/2309.16384 (2023) - Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis:
Fully Dynamic k-Clustering in Õ(k) Update Time. CoRR abs/2310.17420 (2023) - Ainesh Bakshi, Vincent Cohen-Addad, Samuel B. Hopkins, Rajesh Jayaram, Silvio Lattanzi:
A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies. CoRR abs/2311.17840 (2023) - 2022
- T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. COCOON 2022: 150-161 - Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Approximate Cluster Recovery from Noisy Labels. COLT 2022: 1463-1509 - Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis:
Online and Consistent Correlation Clustering. ICML 2022: 4157-4179 - Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Muñoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii:
Scalable Differentially Private Clustering via Hierarchically Separated Trees. KDD 2022: 221-230
skipping 116 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-09 01:51 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint