On the Alon-Füredi bound. - Anurag Bishnoi; Pete L. Clark; Aditya Potukuchi; John R. Schmitt (Electron. Notes Discret. Math., 2016)

A short note on the joint entropy of n/2-wise independence. - Amey Bhangale; Aditya Potukuchi (CoRR, 2017)

A Note on the Joint Entropy of N/2-Wise Independence. - Amey Bhangale; Aditya Potukuchi (ISIT, 2018)

Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. - Swastik Kopparty; Aditya Potukuchi (SODA, 2018)

Discrepancy in random hypergraph models. - Aditya Potukuchi (CoRR, 2018)

On Zeros of a Polynomial in a Finite Grid. - Anurag Bishnoi; Pete L. Clark; Aditya Potukuchi; John R. Schmitt (Comb. Probab. Comput., 2018)

On the AC^0[oplus] Complexity of Andreev's Problem. - Aditya Potukuchi (FSTTCS, 2019)

Improved efficiency for explicit covering codes matching the sphere-covering bound. - Aditya Potukuchi; Yihan Zhang 001 (CoRR, 2019)

Simplified inpproximability of hypergraph coloring via t-agreeing families. - Per Austrin; Amey Bhangale; Aditya Potukuchi (Electron. Colloquium Comput. Complex., 2019)

On the AC0[⊕] complexity of Andreev's Problem. - Aditya Potukuchi (Electron. Colloquium Comput. Complex., 2019)

A Spectral Bound on Hypergraph Discrepancy. - Aditya Potukuchi (ICALP, 2020)

Improved efficiency for covering codes matching the sphere-covering bound. - Aditya Potukuchi; Yihan Zhang 001 (ISIT, 2020)

Improved Inapproximability of Rainbow Coloring. - Per Austrin; Amey Bhangale; Aditya Potukuchi (SODA, 2020)

On the list recoverability of randomly punctured codes. - Ben Lund 002; Aditya Potukuchi (Electron. Colloquium Comput. Complex., 2020)

Enumerating independent sets in Abelian Cayley graphs. - Aditya Potukuchi; Liana Yepremyan (CoRR, 2021)

On the Geometry of Stable Steiner Tree Instances. - James Freitag; Neshat Mohammadi; Aditya Potukuchi; Lev Reyzin (CCCG, 2022)

Independent sets of a given size and structure in the hypercube. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi (Comb. Probab. Comput., 2022)

Blocking sets, minimal codes and trifferent codes. - Anurag Bishnoi; Jozefien D'haeseleer; Dion Gijswijt; Aditya Potukuchi (CoRR, 2023)

Approximately counting independent sets in dense bipartite graphs via subspace enumeration. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (CoRR, 2023)

Approximately counting independent sets in bipartite graphs via graph containers. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi (Random Struct. Algorithms, 2023)

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (FOCS, 2024)

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (ICALP, 2024)

Sampling and counting triangle-free graphs near the critical density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (CoRR, 2024)

Algorithms for the ferromagnetic Potts model on expanders. - Charlie Carlson; Ewan Davies; Nicolas Fraiman; Alexandra Kolla; Aditya Potukuchi; Corrine Yap (Comb. Probab. Comput., 2024)

Unbalanced Random Matching Markets with Partial Preferences. - Aditya Potukuchi; Shikha Singh 002 (ICALP, 2025)

Error-Correcting Graph Codes. - Swastik Kopparty; Aditya Potukuchi; Harry Sha (ITCS, 2025)