Sledovat
Aditya Potukuchi
Název
Citace
Citace
Rok
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
462018
Improved inapproximability of rainbow coloring
P Austrin, A Bhangale, A Potukuchi
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
242020
Discrepancy in random hypergraph models
A Potukuchi
arXiv preprint arXiv:1811.01491, 2018
222018
Approximately counting independent sets in bipartite graphs via graph containers
M Jenssen, W Perkins, A Potukuchi
Random Structures & Algorithms 63 (1), 215-241, 2023
192023
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
172022
A spectral bound on hypergraph discrepancy
A Potukuchi
arXiv preprint arXiv:1907.04117, 2019
132019
On the list recoverability of randomly punctured codes
B Lund, A Potukuchi
arXiv preprint arXiv:2005.02478, 2020
112020
Simplified inpproximability of hypergraph coloring via t-agreeing families
P Austrin, A Bhangale, A Potukuchi
arXiv preprint arXiv:1904.01163, 2019
112019
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
102024
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
92022
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
52018
On the evolution of structure in triangle-free graphs
M Jenssen, W Perkins, A Potukuchi
arXiv preprint arXiv:2312.09202, 2023
22023
Enumerating independent sets in Abelian Cayley graphs
A Potukuchi, L Yepremyan
arXiv preprint arXiv:2109.06152, 2021
22021
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
22020
On the complexity of Andreev's Problem
A Potukuchi
arXiv preprint arXiv:1907.07969, 2019
22019
Trifferent codes and affine blocking sets
A Bishnoi, D Gijsiwijt, J D’haesleer, A Potukuchi
Program Committee Chair, 140, 2022
12022
On the geometry of stable steiner tree instances
J Freitag, N Mohammadi, A Potukuchi, L Reyzin
arXiv preprint arXiv:2109.13457, 2021
12021
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
12020
On the AC^ 0+ complexity of Andreev’s Problem
A Potukuchi
Electronic Colloquium on Computational Complexity (ECCC) 26, 96, 2019
12019
On the Alon-Füredi bound
A Bishnoi, PL Clark, A Potukuchi, JR Schmitt
Electronic Notes in Discrete Mathematics 54, 57-62, 2016
12016
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20