| A tighter analysis of spectral clustering, and beyond P Macgregor, H Sun International Conference on Machine Learning, 14717-14742, 2022 | 13 | 2022 |
| Local Algorithms for Finding Densely Connected Clusters P Macgregor, H Sun International Conference on Machine Learning 38, 2021 | 7 | 2021 |
| Finding bipartite components in hypergraphs P Macgregor, H Sun Advances in Neural Information Processing Systems 34, 7912-7923, 2021 | 6 | 2021 |
| Spectral toolkit of algorithms for graphs: Technical report (1) P Macgregor, H Sun arXiv preprint arXiv:2304.03170, 2023 | 2 | 2023 |
| Is the Algorithmic Kadison-Singer Problem Hard? B Jourdan, P Macgregor, H Sun arXiv preprint arXiv:2205.02161, 2022 | 1 | 2022 |
| Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime B Jourdan, P Macgregor, H Sun arXiv preprint arXiv:2402.08545, 2024 | | 2024 |
| Fast Approximation of Similarity Graphs with Kernel Density Estimation P Macgregor, H Sun Advances in Neural Information Processing Systems 36, 2024 | | 2024 |
| Fast and Simple Spectral Clustering in Theory and Practice P Macgregor Advances in Neural Information Processing Systems 36, 2024 | | 2024 |
| On Learning the Structure of Clusters in Graphs P Macgregor arXiv preprint arXiv:2212.14345, 2022 | | 2022 |
He SunReader in Algorithms & Complexity, University of EdinburghVerified email at ed.ac.uk
