Aditya Potukuchi

According to our database, Aditya Potukuchi authored at least 22 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Unbalanced Random Matching Markets with Partial Preferences.

Aditya Potukuchi, Shikha Singh

CoRR, 2024

2023

Approximately counting independent sets in bipartite graphs via graph containers.

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Random Struct. Algorithms, August, 2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi

CoRR, 2023

Blocking sets, minimal codes and trifferent codes.

Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi

CoRR, 2023

2022

Independent sets of a given size and structure in the hypercube.

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Comb. Probab. Comput., 2022

Algorithms for the ferromagnetic Potts model on expanders.

Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

On the Geometry of Stable Steiner Tree Instances.

James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Enumerating independent sets in Abelian Cayley graphs.

Aditya Potukuchi, Liana Yepremyan

CoRR, 2021

2020

On the list recoverability of randomly punctured codes.

Ben Lund, Aditya Potukuchi

Electron. Colloquium Comput. Complex., 2020

Improved Inapproximability of Rainbow Coloring.

Per Austrin, Amey Bhangale, Aditya Potukuchi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Improved efficiency for covering codes matching the sphere-covering bound.

Aditya Potukuchi, Yihan Zhang

Proceedings of the IEEE International Symposium on Information Theory, 2020

A Spectral Bound on Hypergraph Discrepancy.

Aditya Potukuchi

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

On the AC⁰[⊕] complexity of Andreev's Problem.

Aditya Potukuchi

Electron. Colloquium Comput. Complex., 2019

Simplified inpproximability of hypergraph coloring via t-agreeing families.

Per Austrin, Amey Bhangale, Aditya Potukuchi

Electron. Colloquium Comput. Complex., 2019

Improved efficiency for explicit covering codes matching the sphere-covering bound.

Aditya Potukuchi, Yihan Zhang

CoRR, 2019

On the AC^0[oplus] Complexity of Andreev's Problem.

Aditya Potukuchi

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

On Zeros of a Polynomial in a Finite Grid.

Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt

Comb. Probab. Comput., 2018

Discrepancy in random hypergraph models.

Aditya Potukuchi

CoRR, 2018

Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields.

Swastik Kopparty, Aditya Potukuchi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Note on the Joint Entropy of N/2-Wise Independence.

Amey Bhangale, Aditya Potukuchi

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

A short note on the joint entropy of n/2-wise independence.

Amey Bhangale, Aditya Potukuchi

CoRR, 2017

2016

On the Alon-Füredi bound.

Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt

Electron. Notes Discret. Math., 2016