Sublinear time spectral density estimation V Braverman, A Krishnan, C Musco Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 20* | 2022 |
Lifelong learning with sketched structural regularization H Li, A Krishnan, J Wu, S Kolouri, PK Pilly, V Braverman Asian conference on machine learning, 985-1000, 2021 | 17 | 2021 |
Schatten norms in matrix streams: Hello sparsity, goodbye dimension V Braverman, R Krauthgamer, A Krishnan, R Sinoff International Conference on Machine Learning, 1100-1110, 2020 | 17 | 2020 |
Near-optimal entrywise sampling of numerically sparse matrices V Braverman, R Krauthgamer, AR Krishnan, S Sapir Conference on Learning Theory, 759-773, 2021 | 11 | 2021 |
On Sketching the to norms A Krishnan, S Mohanty, DP Woodruff arXiv preprint arXiv:1806.06429, 2018 | 9 | 2018 |
Lower bounds for pseudo-deterministic counting in a stream V Braverman, R Krauthgamer, A Krishnan, S Sapir arXiv preprint arXiv:2303.16287, 2023 | 6 | 2023 |
Projective Clustering Product Quantization A Krishnan, E Liberty arXiv preprint arXiv:2112.02179, 2021 | 4 | 2021 |
Competitively pricing parking in a tree M Bender, J Gilbert, A Krishnan, K Pruhs Web and Internet Economics: 16th International Conference, WINE 2020 …, 2020 | 3 | 2020 |
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search S Bruch, A Krishnan, FM Nardini arXiv preprint arXiv:2405.12207, 2024 | | 2024 |
Leibniz International Proceedings in Informatics (LIPIcs): 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) V Braverman, R Krauthgamer, A Krishnan, S Sapir Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2023 | | 2023 |
FAST AND MEMORY EFFICIENT ALGORITHMS FOR STRUCTURED MATRIX SPECTRUM APPROXIMATION A Krishnan Johns Hopkins University, 2022 | | 2022 |
Pricing Online Metric Matching Algorithms on Trees A Krishnan Carnegie Mellon University Pittsburgh, PA, 2018 | | 2018 |