Lattanzi, Silvio
113  results:
Search for persons X
?
1

Secretaries with Advice:

Dütting, Paul ; Lattanzi, Silvio ; Paes Leme, Renato.
Mathematics of Operations Research.  49 (2024)  2 - p. 856-879 , 2024
 
?
4

Fully Dynamic k-Center Clustering with Outliers:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
 
?
5

The Gibbs-Rand Model:

, In: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
 
?
6

Scalable Differentially Private Clustering via Hierarchical..:

, In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining,
 
?
7

Consistent k-clustering for general metrics:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
8

Spectral Clustering Oracles in Sublinear Time:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Gluch, Grzegorz ; Kapralov, Michael ; Lattanzi, Silvio.. - p. 1598-1617 , 2021
 
?
9

Twin Peaks, a Model for Recurring Cascades:

, In: Proceedings of the Web Conference 2021,
 
?
10

Spectral clustering oracles in sublinear time:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Gluch, Grzegorz ; Kapralov, Michael ; Lattanzi, Silvio.. - p. 1598-1617 , 2021
 
?
11

Consistent k-Clustering for General Metrics:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
 
?
12

Secretaries with Advice:

, In: Proceedings of the 22nd ACM Conference on Economics and Computation,
 
?
13

Online scheduling via learned weights:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
14

Residual Based Sampling for Online Low Rank Approximation:

, In: 2020 Information Theory and Applications Workshop (ITA),
 
?
15

A Framework for Parallelizing Hierarchical Clustering Metho..:

, In: Machine Learning and Knowledge Discovery in Databases; Lecture Notes in Computer Science,
 
1-15