| On zeros of a polynomial in a finite grid A Bishnoi, PL Clark, A Potukuchi, JR Schmitt Combinatorics, Probability and Computing 27 (3), 310-333, 2018 | 47 | 2018 |
| Improved inapproximability of rainbow coloring P Austrin, A Bhangale, A Potukuchi Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 24 | 2020 |
| Discrepancy in random hypergraph models A Potukuchi arXiv preprint arXiv:1811.01491, 2018 | 22 | 2018 |
| Approximately counting independent sets in bipartite graphs via graph containers M Jenssen, W Perkins, A Potukuchi Random Structures & Algorithms 63 (1), 215-241, 2023 | 20 | 2023 |
| Algorithms for the ferromagnetic Potts model on expanders C Carlson, E Davies, N Fraiman, A Kolla, A Potukuchi, C Yap Combinatorics, Probability and Computing 33 (4), 487-517, 2024 | 18 | 2024 |
| Blocking sets, minimal codes and trifferent codes A Bishnoi, J D'haeseleer, D Gijswijt, A Potukuchi Journal of the London Mathematical Society 109 (6), e12938, 2024 | 13 | 2024 |
| A spectral bound on hypergraph discrepancy A Potukuchi arXiv preprint arXiv:1907.04117, 2019 | 13 | 2019 |
| On the list recoverability of randomly punctured codes B Lund, A Potukuchi arXiv preprint arXiv:2005.02478, 2020 | 12 | 2020 |
| Independent sets of a given size and structure in the hypercube M Jenssen, W Perkins, A Potukuchi Combinatorics, Probability and Computing 31 (4), 702-720, 2022 | 11 | 2022 |
| Simplified inpproximability of hypergraph coloring via t-agreeing families P Austrin, A Bhangale, A Potukuchi arXiv preprint arXiv:1904.01163, 2019 | 11 | 2019 |
| On the evolution of structure in triangle-free graphs M Jenssen, W Perkins, A Potukuchi arXiv preprint arXiv:2312.09202, 2023 | 5 | 2023 |
| Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields S Kopparty, A Potukuchi Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 5 | 2018 |
| Lower tails for triangles inside the critical window M Jenssen, W Perkins, A Potukuchi, M Simkin arXiv preprint arXiv:2411.18563, 2024 | 2 | 2024 |
| Sampling, counting, and large deviations for triangle-free graphs near the critical density M Jenssen, W Perkins, A Potukuchi, M Simkin 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | 2 | 2024 |
| Enumerating independent sets in Abelian Cayley graphs A Potukuchi, L Yepremyan arXiv preprint arXiv:2109.06152, 2021 | 2 | 2021 |
| Improved efficiency for covering codes matching the sphere-covering bound A Potukuchi, Y Zhang 2020 IEEE International Symposium on Information Theory (ISIT), 102-107, 2020 | 2 | 2020 |
| On the complexity of Andreev's Problem A Potukuchi arXiv preprint arXiv:1907.07969, 2019 | 2 | 2019 |
| Sampling and counting triangle-free graphs near the critical density M Jenssen, W Perkins, A Potukuchi, M Simkin arXiv preprint arXiv:2410.22951, 2024 | 1 | 2024 |
| Trifferent codes and affine blocking sets A Bishnoi, D Gijsiwijt, J D’haesleer, A Potukuchi Program Committee Chair, 140, 2022 | 1 | 2022 |
| On the geometry of stable steiner tree instances J Freitag, N Mohammadi, A Potukuchi, L Reyzin arXiv preprint arXiv:2109.13457, 2021 | 1 | 2021 |
Anurag BishnoiAssistant Professor at TU DelftVerified email at tudelft.nl
