Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2020
Citations
42
42
h-index
2
2
i10-index
1
1
0
14
7
2021
2022
2023
2024
3
14
13
12
Public access
View all
View all
1 article
0 articles
available
not available
Based on funding mandates
Follow
Ansh Nagda
Student,
UC Berkeley
Verified email at berkeley.edu -
Homepage
Theoretical Computer Science
Articles
Cited by
Public access
Title
Sort
Sort by citations
Sort by year
Sort by 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
37
2020
Sublinear time hypergraph sparsification via cut and edge sampling queries
Y Chen, S Khanna, A Nagda
arXiv preprint arXiv:2106.10386
, 2021
3
2021
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
F Ebrahimnejad, A Nagda, SO Gharan
arXiv preprint arXiv:2103.08683
, 2021
2
2021
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
Show more
Privacy
Terms
Help
About Scholar
Search help