default search action
Manik Dhar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Manik Dhar, Zeev Dvir, Ben Lund
:
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg-Erman Proof. Discret. Comput. Geom. 71(2): 327-357 (2024) - [j3]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. TheoretiCS 3 (2024) - [j2]Joshua Brakensiek
Improved Field Size Bounds for Higher Order MDS Codes. IEEE Trans. Inf. Theory 70(10): 6950-6960 (2024) - [c8]Joshua Brakensiek
Generalized GM-MDS: Polynomial Codes Are Higher Order MDS. STOC 2024: 728-739 - [c7]Joshua Brakensiek
AG Codes Achieve List Decoding Capacity over Constant-Sized Fields. STOC 2024: 740-751 - [i9]Joshua Brakensiek, Manik Dhar, Jiyang Gao, Sivakanth Gopi, Matt Larson:
Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes. CoRR abs/2405.00778 (2024) - 2023
- [b1]Manik Dhar:
Beyond the polynomial method: Kakeya sets over finite rings and high dimensional variants. Princeton University, USA, 2023 - [c6]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Improved Field Size Bounds for Higher Order MDS Codes. ISIT 2023: 1243-1248 - [c5]Manik Dhar, Sivakanth Gopi:
A construction of Maximally Recoverable LRCs for small number of local groups. ISIT 2023: 1753-1757 - [i8]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Generalized GM-MDS: Polynomial Codes are Higher Order MDS. CoRR abs/2310.12888 (2023) - [i7]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang:
AG codes achieve list decoding capacity over contant-sized fields. CoRR abs/2310.12898 (2023) - 2022
- [c4]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. FOCS 2022: 419-428 - [i6]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. CoRR abs/2204.01665 (2022) - [i5]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Improved Field Size Bounds for Higher Order MDS Codes. CoRR abs/2212.11262 (2022) - [i4]Manik Dhar, Sivakanth Gopi:
A construction of Maximally Recoverable LRCs for small number of local groups. CoRR abs/2212.12123 (2022) - [i3]Manik Dhar, Zeev Dvir:
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j1]Manik Dhar, Zeev Dvir:
Proof of the Kakeya set conjecture over rings of integers modulo square-free N. Comb. Theory 1(0) (2021)
2010 – 2019
- 2018
- [c3]Aditya Grover, Manik Dhar, Stefano Ermon:
Flow-GAN: Combining Maximum Likelihood and Adversarial Learning in Generative Models. AAAI 2018: 3069-3076 - [c2]Manik Dhar, Aditya Grover, Stefano Ermon:
Modeling Sparse Deviations for Compressed Sensing using Generative Models. ICML 2018: 1222-1231 - [i2]Manik Dhar, Aditya Grover, Stefano Ermon:
Modeling Sparse Deviations for Compressed Sensing using Generative Models. CoRR abs/1807.01442 (2018) - 2017
- [i1]Aditya Grover, Manik Dhar, Stefano Ermon:
Flow-GAN: Bridging implicit and prescribed learning in generative models. CoRR abs/1705.08868 (2017) - 2016
- [c1]Suyash P. Awate
Robust kernel principal nested spheres. ICPR 2016: 402-407
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-11-26 21:41 CET 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: