Local Algorithms for Finding Densely Connected Clusters. - Peter Macgregor; He Sun 001 (ICML, 2021)

Finding Bipartite Components in Hypergraphs. - Peter Macgregor; He Sun 001 (NeurIPS, 2021)

A Tighter Analysis of Spectral Clustering, and Beyond. - Peter Macgregor; He Sun 001 (ICML, 2022)

On Learning the Structure of Clusters in Graphs. - Peter Macgregor (CoRR, 2022)

Is the Algorithmic Kadison-Singer Problem Hard? - Ben Jourdan; Peter Macgregor; He Sun 001 (ISAAC, 2023)

Fast Approximation of Similarity Graphs with Kernel Density Estimation. - Peter Macgregor; He Sun 001 (NeurIPS, 2023)

Fast and Simple Spectral Clustering in Theory and Practice. - Peter Macgregor (NeurIPS, 2023)

Spectral Toolkit of Algorithms for Graphs: Technical Report (1). - Peter Macgregor; He Sun 001 (CoRR, 2023)

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime. - Ben Jourdan; Peter Macgregor; He Sun 001 (CoRR, 2024)

Spectral Toolkit of Algorithms for Graphs: Technical Report (2). - Peter Macgregor; He Sun 001 (CoRR, 2024)

Dynamic DBSCAN with Euler Tour Sequences. - Seiyun Shin; Ilan Shomorony; Peter Macgregor (AISTATS, 2025)

Coreset Spectral Clustering. - Ben Jourdan; Gregory Schwartzman; Peter Macgregor; He Sun 001 (ICLR, 2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation. - Steinar Laenen; Peter Macgregor; He Sun 001 (CoRR, 2025)