Silvio Lattanzi

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Consistent Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Multi-View Stochastic Block Models.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Dynamic Correlation Clustering in Sublinear Update Time.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Scalable Algorithm for Individually Fair k-Means Clustering.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Massively Parallel Computation: Algorithms and Applications.

[BibT_eX]

[DOI]

Found. Trends Optim., 2023

A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Differentially Private Densest Subgraph: Local and Purely Additive.

[BibT_eX]

[DOI]

CoRR, 2023

Learning Hierarchical Cluster Structure of Graphs in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fully Dynamic k-Clustering in Õ(k) Update Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multi-Swap k-Means++.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Speeding Up Bellman Ford via Minimum Violation Permutations.

[BibT_eX]

[DOI]

Ola Svensson

Proceedings of the International Conference on Machine Learning, 2023

Fully Dynamic Submodular Maximization over Matroids.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

2022

On Classification Thresholds for Graph Attention with Edge Features.

[BibT_eX]

[DOI]

CoRR, 2022

Deletion Robust Non-Monotone Submodular Maximization over Matroids.

[BibT_eX]

[DOI]

CoRR, 2022

TF-GNN: Graph Neural Networks in TensorFlow.

[BibT_eX]

[DOI]

CoRR, 2022

Learning Hierarchical Structure of Clusterable Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

The Gibbs-Rand Model.

[BibT_eX]

[DOI]

Ravi Kumar

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Near-Optimal Correlation Clustering with Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient and Stable Fully Dynamic Facility Location.

[BibT_eX]

[DOI]

Sayan Bhattacharya

Nikos Parotsidis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Active Learning of Classifiers with Label and Seed Queries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Deletion Robust Submodular Maximization over Matroids.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Online and Consistent Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Approximate Cluster Recovery from Noisy Labels.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Twin Peaks, a Model for Recurring Cascades.

[BibT_eX]

[DOI]

Proceedings of the WWW '21: The Web Conference 2021, 2021

Spectral Clustering Oracles in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Consistent k-Clustering for General Metrics.

[BibT_eX]

[DOI]

Hendrik Fichtenberger

Filipe Miguel Gonçalves de Almeida

Ashkan Norouzi-Fard

Ola Svensson

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Robust Online Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Efficient and Local Parallel Random Walks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Parallel and Efficient Hierarchical k-Median Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On Margin-Based Cluster Recovery with Oracle Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Online Facility Location with Multiple Advice.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Correlation Clustering in Constant Many Parallel Rounds.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

2020

On Mean Estimation for Heteroscedastic Random Variables.

[BibT_eX]

[DOI]

CoRR, 2020

InstantEmbedding: Efficient Local Node Representations.

[BibT_eX]

[DOI]

Stefan Postavaru

Anton Tsitsulin

Yingtao Tian

Bryan Perozzi

CoRR, 2020

Online Scheduling via Learned Weights.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fully Dynamic Algorithm for Constrained Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fast and Accurate $k$-means++ via Rejection Sampling.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online MAP Inference of Determinantal Point Processes.

[BibT_eX]

[DOI]

Amin Karbasi

Mohammad Taghi Hajiaghayi

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Exact Recovery of Mangled Clusters with Same-Cluster Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Introduction to the Special Issue for SPAA'17.

[BibT_eX]

[DOI]

Mohammad Hossein Bateni

ACM Trans. Parallel Comput., 2019

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Saeed Seddighin

Cliff Stein

CoRR, 2019

Dynamic Algorithms for the Massively Parallel Computation Model.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

A Framework for Parallelizing Hierarchical Clustering Methods.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

A Better k-means++ Algorithm via Local Search.

[BibT_eX]

[DOI]

Christian Sohler

Proceedings of the 36th International Conference on Machine Learning, 2019

Improved Parallel Algorithms for Density-Based Network Clustering.

[BibT_eX]

[DOI]

Mohsen Ghaffari

Slobodan Mitrovic

Proceedings of the 36th International Conference on Machine Learning, 2019

Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.

[BibT_eX]

[DOI]

Ehsan Kazemi

Marko Mitrovic

Amin Karbasi

Proceedings of the 36th International Conference on Machine Learning, 2019

Residual Based Sampling for Online Low Rank Approximation.

[BibT_eX]

[DOI]

Mohammad Reza Karimi Jaghargh

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Consistent Online Optimization: Convex and Submodular.

[BibT_eX]

[DOI]

Andreas Krause

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Matroids, Matchings, and Fairness.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Rumor Spreading and Conductance.

[BibT_eX]

[DOI]

J. ACM, 2018

Mallows Models for Top-k Lists.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Non-Negative Sparse Regression and Column Subset Selection with L1 Error.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Parallel and Streaming Algorithms for K-Core Decomposition.

[BibT_eX]

[DOI]

Hossein Esfandiari

Proceedings of the 35th International Conference on Machine Learning, 2018

One-shot Coresets: The Case of k-Clustering.

[BibT_eX]

[DOI]

Olivier Bachem

Mario Lucic

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

ASYMP: Fault-tolerant Mining of Massive Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Submodular Optimization Over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on World Wide Web, 2017

Indexing Public-Private Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on World Wide Web, 2017

Fair Clustering Through Fairlets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Affinity Clustering: Hierarchical Clustering at Scale.

[BibT_eX]

[DOI]

Soheil Behnezhad

Mahsa Derakhshan

MohammadTaghi Hajiaghayi

Raimondas Kiveris

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters.

[BibT_eX]

[DOI]

Renato Paes Leme

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Consistent k-Clustering.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Algorithms for $\ell_p$ Low-Rank Approximation.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Efficient computation of the Weighted Clustering Coefficient.

[BibT_eX]

[DOI]

Stefano Leonardi

Internet Math., 2016

Linking Users Across Domains with Location Data: Theory and Validation.

[BibT_eX]

[DOI]

Christopher J. Riederer

Proceedings of the 25th International Conference on World Wide Web, 2016

On Sampling Nodes in a Network.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

Expanders via Local Edge Flips.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Community Detection on Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Ego-net Community Mining Applied to Friend Suggestion.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Efficient Densest Subgraph Computation in Evolving Graphs.

[BibT_eX]

[DOI]

Mauro Sozio

Proceedings of the 24th International Conference on World Wide Web, 2015

The Power of Random Neighbors in Social Networks.

[BibT_eX]

[DOI]

Yaron Singer

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Distributed Graph Algorithmics: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Efficient Algorithms for Public-Private Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Robust Hierarchical k-Center Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

On Learning Mixture Models for Permutations.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

An efficient reconciliation algorithm for social networks.

[BibT_eX]

[DOI]

Nitish Korula

Proc. VLDB Endow., 2014

Communities, Random Walks, and Social Sybil Defense.

[BibT_eX]

[DOI]

Internet Math., 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

Learning Entangled Single-Sample Gaussians.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Filter & follow: how social media foster content curation.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

Distributed Balanced Clustering via Mapping Coresets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Connected Components in MapReduce and Beyond.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Cloud Computing, 2014

On Reconstructing a Hidden Permutation.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2014

2013

Models for the Compressible Web.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Arrival and departure dynamics in social networks.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

SoK: The Evolution of Sybil Defense via Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

A Local Algorithm for Finding Well-Connected Clusters.

[BibT_eX]

[DOI]

Zeyuan Allen Zhu

Proceedings of the 30th International Conference on Machine Learning, 2013

2011

Rumor spreading in social networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Milgram-routing in social networks.

[BibT_eX]

[DOI]

D. Sivakumar

Proceedings of the 20th International Conference on World Wide Web, 2011

An algorithmic treatment of strong queries.

[BibT_eX]

[DOI]

Ravi Kumar

Prabhakar Raghavan

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Filtering: a method for solving graph problems in MapReduce.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Hiring a secretary from a poset.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Almost tight bounds for rumour spreading with conductance.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Rumour Spreading and Graph Conductance.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Affiliation networks.

[BibT_eX]

[DOI]

D. Sivakumar

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

On compressing social networks.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

2008

On placing skips optimally in expectation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Web Search and Web Data Mining, 2008

Gossiping (via mobile?) in social networks.

[BibT_eX]

[DOI]