Aditya Potukuchi

40 papers A* 8A 1B 2Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2025 A conf
Error-Correcting Graph Codes.
ITCS
Swastik Kopparty, Aditya Potukuchi, Harry Sha
2025 A* conf
Unbalanced Random Matching Markets with Partial Preferences.
ICALP
Aditya Potukuchi, Shikha Singh
2024 A* conf
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs.
ICALP
Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi
2024 J jnl
Algorithms for the ferromagnetic Potts model on expanders.
Comb. Probab. Comput.
Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap
2024 J jnl
Error-Correcting Graph Codes.
CoRR
Swastik Kopparty, Aditya Potukuchi, Harry Sha
2024 J jnl
Sampling and counting triangle-free graphs near the critical density.
CoRR
Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2024 A* conf
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density.
FOCS
Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2024 J jnl
Unbalanced Random Matching Markets with Partial Preferences.
CoRR
Aditya Potukuchi, Shikha Singh
2023 J jnl
Approximately counting independent sets in bipartite graphs via graph containers.
Random Struct. Algorithms
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2023 J jnl
Approximately counting independent sets in dense bipartite graphs via subspace enumeration.
CoRR
Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi
2023 J jnl
Blocking sets, minimal codes and trifferent codes.
CoRR
Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi
2022 A* conf
Algorithms for the ferromagnetic Potts model on expanders.
FOCS
Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap
2022 J jnl
Algorithms for the ferromagnetic Potts model on expanders.
CoRR
Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap
2022 A* conf
Approximately counting independent sets in bipartite graphs via graph containers.
SODA
Matthew Jenssen, Aditya Potukuchi, Will Perkins
2022 J jnl
Independent sets of a given size and structure in the hypercube.
Comb. Probab. Comput.
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2022 — conf
On the Geometry of Stable Steiner Tree Instances.
CCCG
James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin
2021 J jnl
Approximately counting independent sets in bipartite graphs via graph containers.
CoRR
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2021 J jnl
Enumerating independent sets in Abelian Cayley graphs.
CoRR
Aditya Potukuchi, Liana Yepremyan
2021 J jnl
On the Geometry of Stable Steiner Tree Instances.
CoRR
James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin
2020 A* conf
A Spectral Bound on Hypergraph Discrepancy.
ICALP
Aditya Potukuchi
2020 A* conf
Improved Inapproximability of Rainbow Coloring.
SODA
Per Austrin, Amey Bhangale, Aditya Potukuchi
2020 B conf
Improved efficiency for covering codes matching the sphere-covering bound.
ISIT
Aditya Potukuchi, Yihan Zhang
2020 — conf
On the List Recoverability of Randomly Punctured Codes.
APPROX-RANDOM
Ben Lund, Aditya Potukuchi
2020 J jnl
On the list recoverability of randomly punctured codes.
CoRR
Ben Lund, Aditya Potukuchi
2020 J jnl
On the list recoverability of randomly punctured codes.
Electron. Colloquium Comput. Complex.
Ben Lund, Aditya Potukuchi
2019 J jnl
A spectral bound on hypergraph discrepancy.
CoRR
Aditya Potukuchi
2019 J jnl
Improved efficiency for explicit covering codes matching the sphere-covering bound.
CoRR
Aditya Potukuchi, Yihan Zhang
2019 J jnl
On the AC
CoRR
Aditya Potukuchi
2019 J jnl
On the AC
Electron. Colloquium Comput. Complex.
Aditya Potukuchi
2019 — conf
On the AC^0[oplus] Complexity of Andreev's Problem.
FSTTCS
Aditya Potukuchi
2019 J jnl
Simplified inpproximability of hypergraph coloring via t-agreeing families.
CoRR
Per Austrin, Amey Bhangale, Aditya Potukuchi
2019 J jnl
Simplified inpproximability of hypergraph coloring via t-agreeing families.
Electron. Colloquium Comput. Complex.
Per Austrin, Amey Bhangale, Aditya Potukuchi
2018 B conf
A Note on the Joint Entropy of N/2-Wise Independence.
ISIT
Amey Bhangale, Aditya Potukuchi
2018 J jnl
Discrepancy in random hypergraph models.
CoRR
Aditya Potukuchi
2018 J jnl
Improved Inapproximability of Rainbow Coloring.
CoRR
Per Austrin, Amey Bhangale, Aditya Potukuchi
2018 J jnl
On Zeros of a Polynomial in a Finite Grid.
Comb. Probab. Comput.
Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt
2018 A* conf
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields.
SODA
Swastik Kopparty, Aditya Potukuchi
2017 J jnl
A short note on the joint entropy of n/2-wise independence.
CoRR
Amey Bhangale, Aditya Potukuchi
2017 J jnl
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields.
CoRR
Swastik Kopparty, Aditya Potukuchi
2016 J jnl
On the Alon-Füredi bound.
Electron. Notes Discret. Math.
Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt