default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya Potukuchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Charlie Carlson, Ewan Davies
, Alexandra Kolla, Aditya Potukuchi:
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. ICALP 2024: 35:1-35:18- [i20]Aditya Potukuchi, Shikha Singh:
Unbalanced Random Matching Markets with Partial Preferences. CoRR abs/2402.09667 (2024) - [i19]Swastik Kopparty, Aditya Potukuchi, Harry Sha:
Error-Correcting Graph Codes. CoRR abs/2406.13867 (2024) - 2023
- [j4]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023) - [i18]Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi:
Blocking sets, minimal codes and trifferent codes. CoRR abs/2301.09457 (2023) - [i17]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
Approximately counting independent sets in dense bipartite graphs via subspace enumeration. CoRR abs/2307.09533 (2023) - 2022
- [j3]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31(4): 702-720 (2022) - [c10]James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
On the Geometry of Stable Steiner Tree Instances. CCCG 2022: 156-161 - [c9]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. FOCS 2022: 344-355 - [c8]Matthew Jenssen, Aditya Potukuchi, Will Perkins:
Approximately counting independent sets in bipartite graphs via graph containers. SODA 2022: 499-516 - [i16]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. CoRR abs/2204.01923 (2022) - 2021
- [i15]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. CoRR abs/2109.03744 (2021) - [i14]Aditya Potukuchi, Liana Yepremyan:
Enumerating independent sets in Abelian Cayley graphs. CoRR abs/2109.06152 (2021) - [i13]James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
On the Geometry of Stable Steiner Tree Instances. CoRR abs/2109.13457 (2021) - 2020
- [c7]Ben Lund, Aditya Potukuchi:
On the List Recoverability of Randomly Punctured Codes. APPROX-RANDOM 2020: 30:1-30:11 - [c6]Aditya Potukuchi:
A Spectral Bound on Hypergraph Discrepancy. ICALP 2020: 93:1-93:14 - [c5]Aditya Potukuchi, Yihan Zhang:
Improved efficiency for covering codes matching the sphere-covering bound. ISIT 2020: 102-107 - [c4]Per Austrin, Amey Bhangale, Aditya Potukuchi:
Improved Inapproximability of Rainbow Coloring. SODA 2020: 1479-1495 - [i12]Ben Lund, Aditya Potukuchi:
On the list recoverability of randomly punctured codes. CoRR abs/2005.02478 (2020) - [i11]Ben Lund, Aditya Potukuchi:
On the list recoverability of randomly punctured codes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c3]Aditya Potukuchi:
On the AC^0[oplus] Complexity of Andreev's Problem. FSTTCS 2019: 25:1-25:14 - [i10]Aditya Potukuchi, Yihan Zhang:
Improved efficiency for explicit covering codes matching the sphere-covering bound. CoRR abs/1902.07408 (2019) - [i9]Per Austrin, Amey Bhangale, Aditya Potukuchi:
Simplified inpproximability of hypergraph coloring via t-agreeing families. CoRR abs/1904.01163 (2019) - [i8]Aditya Potukuchi:
A spectral bound on hypergraph discrepancy. CoRR abs/1907.04117 (2019) - [i7]Aditya Potukuchi:
On the AC0[⊕] complexity of Andreev's Problem. CoRR abs/1907.07969 (2019) - [i6]Per Austrin, Amey Bhangale, Aditya Potukuchi:
Simplified inpproximability of hypergraph coloring via t-agreeing families. Electron. Colloquium Comput. Complex. TR19 (2019) - [i5]Aditya Potukuchi:
On the AC0[⊕] complexity of Andreev's Problem. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j2]Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt:
On Zeros of a Polynomial in a Finite Grid. Comb. Probab. Comput. 27(3): 310-333 (2018) - [c2]Amey Bhangale, Aditya Potukuchi:
A Note on the Joint Entropy of N/2-Wise Independence. ISIT 2018: 2560-2564 - [c1]Swastik Kopparty, Aditya Potukuchi:
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. SODA 2018: 680-691 - [i4]Per Austrin, Amey Bhangale, Aditya Potukuchi:
Improved Inapproximability of Rainbow Coloring. CoRR abs/1810.02784 (2018) - [i3]Aditya Potukuchi:
Discrepancy in random hypergraph models. CoRR abs/1811.01491 (2018) - 2017
- [i2]Amey Bhangale, Aditya Potukuchi:
A short note on the joint entropy of n/2-wise independence. CoRR abs/1709.00752 (2017) - [i1]Swastik Kopparty, Aditya Potukuchi:
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. CoRR abs/1712.06039 (2017) - 2016
- [j1]Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt:
On the Alon-Füredi bound. Electron. Notes Discret. Math. 54: 57-62 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
