Follow
Ansh Nagda
Ansh Nagda
Student, UC Berkeley
Verified email at cs.washington.edu
Title
Cited by
Cited by
Year
Near-linear size hypergraph cut sparsifiers
Y Chen, S Khanna, A Nagda
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 61-72, 2020
312020
Sublinear time hypergraph sparsification via cut and edge sampling queries
Y Chen, S Khanna, A Nagda
arXiv preprint arXiv:2106.10386, 2021
22021
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
F Ebrahimnejad, A Nagda, SO Gharan
arXiv preprint arXiv:2103.08683, 2021
22021
On approximability of the Permanent of PSD matrices
F Ebrahimnejad, A Nagda, SO Gharan
arXiv preprint arXiv:2404.10959, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–4