Scalable fair clustering A Backurs, P Indyk, K Onak, B Schieber, A Vakilian, T Wagner International Conference on Machine Learning, 405-413, 2019 | 213 | 2019 |

Learning space partitions for nearest neighbor search Y Dong, P Indyk, I Razenshteyn, T Wagner arXiv preprint arXiv:1901.08544, 2019 | 102* | 2019 |

Space and time efficient kernel density estimation in high dimensions A Backurs, P Indyk, T Wagner Advances in neural information processing systems 32, 2019 | 61 | 2019 |

Scalable nearest neighbor search for optimal transport A Backurs, Y Dong, P Indyk, I Razenshteyn, T Wagner International Conference on machine learning, 497-506, 2020 | 58 | 2020 |

Semi-supervised learning on data streams via temporal label propagation T Wagner, S Guha, S Kasiviswanathan, N Mishra International Conference on Machine Learning, 5095-5104, 2018 | 54 | 2018 |

Unveiling transformers with lego: a synthetic reasoning task Y Zhang, A Backurs, S Bubeck, R Eldan, S Gunasekar, T Wagner arXiv preprint arXiv:2206.04301, 2022 | 44 | 2022 |

Sample-optimal low-rank approximation of distance matrices P Indyk, A Vakilian, T Wagner, DP Woodruff Conference on Learning Theory, 1723-1751, 2019 | 32 | 2019 |

Learning-based support estimation in sublinear time T Eden, P Indyk, S Narayanan, R Rubinfeld, S Silwal, T Wagner arXiv preprint arXiv:2106.08396, 2021 | 25 | 2021 |

A graph-theoretic approach to multitasking N Alon, D Reichman, I Shinkar, T Wagner, S Musslick, JD Cohen, ... Advances in neural information processing systems 30, 2017 | 15 | 2017 |

Triangle and four cycle counting with predictions in graph streams JY Chen, T Eden, P Indyk, H Lin, S Narayanan, R Rubinfeld, S Silwal, ... arXiv preprint arXiv:2203.09572, 2022 | 14 | 2022 |

Approximate nearest neighbors in limited space P Indyk, T Wagner Conference On Learning Theory, 2012-2036, 2018 | 14 | 2018 |

Practical data-dependent metric compression with provable guarantees P Indyk, I Razenshteyn, T Wagner Advances in Neural Information Processing Systems 30, 2017 | 14 | 2017 |

Near-optimal (euclidean) metric compression P Indyk, T Wagner Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 14 | 2017 |

Towards Resistance Sparsifiers M Dinitz, R Krauthgamer, T Wagner arXiv preprint arXiv:1506.07568, 2015 | 13 | 2015 |

Exponentially improving the complexity of simulating the Weisfeiler-Lehman test with graph neural networks A Aamand, J Chen, P Indyk, S Narayanan, R Rubinfeld, N Schiefer, ... Advances in Neural Information Processing Systems 35, 27333-27346, 2022 | 12 | 2022 |

Generalization bounds for data-driven numerical linear algebra P Bartlett, P Indyk, T Wagner Conference on Learning Theory, 2013-2040, 2022 | 10 | 2022 |

Few-shot data-driven algorithms for low rank approximation P Indyk, T Wagner, D Woodruff Advances in Neural Information Processing Systems 34, 10678-10690, 2021 | 8 | 2021 |

Faster kernel matrix algebra via density estimation A Backurs, P Indyk, C Musco, T Wagner International Conference on Machine Learning, 500-510, 2021 | 7 | 2021 |

Multitasking capacity: Hardness results and improved constructions N Alon, JD Cohen, TL Griffiths, P Manurangsi, D Reichman, I Shinkar, ... SIAM Journal on Discrete Mathematics 34 (1), 885-903, 2020 | 5 | 2020 |

Cheeger-Type Approximation for Sparsest *st*-CutR Krauthgamer, T Wagner ACM Transactions on Algorithms (TALG) 13 (1), 1-21, 2016 | 4 | 2016 |