| 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 | 40 | 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, 2023 | 13 | 2023 |
| A spectral bound on hypergraph discrepancy A Potukuchi arXiv preprint arXiv:1907.04117, 2019 | 13 | 2019 |
| Algorithms for the ferromagnetic Potts model on expanders C Carlson, E Davies, N Fraiman, A Kolla, A Potukuchi, C Yap 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 10 | 2022 |
| Simplified inpproximability of hypergraph coloring via t-agreeing families P Austrin, A Bhangale, A Potukuchi arXiv preprint arXiv:1904.01163, 2019 | 10 | 2019 |
| On the list recoverability of randomly punctured codes B Lund, A Potukuchi arXiv preprint arXiv:2005.02478, 2020 | 8 | 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 | 6 | 2022 |
| 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 | 6 | 2018 |
| Blocking sets, minimal codes and trifferent codes A Bishnoi, J D'haeseleer, D Gijswijt, A Potukuchi arXiv preprint arXiv:2301.09457, 2023 | 5 | 2023 |
| 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 |
| 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 |
| On the Alon-Füredi bound A Bishnoi, PL Clark, A Potukuchi, JR Schmitt Electronic Notes in Discrete Mathematics 54, 57-62, 2016 | 1 | 2016 |
| Approximately counting independent sets in dense bipartite graphs via subspace enumeration C Carlson, E Davies, A Kolla, A Potukuchi arXiv preprint arXiv:2307.09533, 2023 | | 2023 |
| “All” Critical Gradient Descent Solutions Are Optimal & Small Running time J Edmonds, A Potukuchi | | 2023 |
| Combinatorial Problems in Algorithms and Complexity Theory A Potukuchi Rutgers The State University of New Jersey, School of Graduate Studies, 2020 | | 2020 |
Anurag BishnoiAssistant Professor at TU DelftE-mailová adresa ověřena na: tudelft.nl
