default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhishek Bhowmick 0001
Person information
- affiliation: University of Texas at Austin, Department of Computer Science
Other persons with the same name
- Abhishek Bhowmick 0002 — Carnegie Mellon University, Computer Architecture Lab (CALCM) (and 1 more)
- Abhishek Bhowmick 0003 — Apple Inc., ML Privacy Team
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Abhishek Bhowmick
, Shachar Lovett:
Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory. IEEE Trans. Inf. Theory 69(2): 963-977 (2023)
2010 – 2019
- 2019
- [j5]Muhibur Rasheed, Nathan Clement, Abhishek Bhowmick, Chandrajit L. Bajaj:
Statistical Framework for Uncertainty Quantification in Computational Molecular Modeling. IEEE ACM Trans. Comput. Biol. Bioinform. 16(4): 1154-1167 (2019) - 2018
- [j4]Abhishek Bhowmick, Shachar Lovett:
The List Decoding Radius for Reed-Muller Codes Over Small Fields. IEEE Trans. Inf. Theory 64(6): 4382-4391 (2018) - 2017
- [j3]Abhishek Bhowmick, Thái Hoàng Lê, Yu-Ru Liu:
A note on character sums in finite fields. Finite Fields Their Appl. 46: 247-254 (2017) - 2016
- [c10]Arnab Bhattacharyya, Abhishek Bhowmick, Chetan Gupta:
On Higher-Order Fourier Analysis over Non-Prime Fields. APPROX-RANDOM 2016: 23:1-23:29 - [c9]Muhibur Rasheed, Nathan Clement, Abhishek Bhowmick, Chandrajit Bajaj:
Statistical Framework for Uncertainty Quantification in Computational Molecular Modeling. BCB 2016: 146-155 - 2015
- [j2]Abhishek Bhowmick, Thái Hoàng Lê:
On primitive elements in finite fields of low characteristic. Finite Fields Their Appl. 35: 64-77 (2015) - [c8]Abhishek Bhowmick, Shachar Lovett:
Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds. CCC 2015: 72-87 - [c7]Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:
Deterministic Extractors for Additive Sources: Extended Abstract. ITCS 2015: 277-286 - [c6]Abhishek Bhowmick, Shachar Lovett:
The List Decoding Radius of Reed-Muller Codes over Small Fields. STOC 2015: 277-285 - [i16]Arnab Bhattacharyya, Abhishek Bhowmick:
Using higher-order Fourier analysis over general fields. CoRR abs/1505.00619 (2015) - [i15]Abhishek Bhowmick, Shachar Lovett:
Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. CoRR abs/1506.02047 (2015) - [i14]Muhibur Rasheed, Nathan Clement, Abhishek Bhowmick, Chandrajit L. Bajaj:
Quantifying and Visualizing Uncertainties in Molecular Models. CoRR abs/1508.03882 (2015) - [i13]Abhishek Bhowmick, Shachar Lovett:
Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. Electron. Colloquium Comput. Complex. TR15 (2015) - [i12]Arnab Bhattacharyya, Abhishek Bhowmick:
Using higher-order Fourier analysis over general fields. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Bounds for Matching Vector Families. SIAM J. Comput. 43(5): 1654-1683 (2014) - [i11]Abhishek Bhowmick, Shachar Lovett:
List decoding Reed-Muller codes over small fields. CoRR abs/1407.3433 (2014) - [i10]Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:
Deterministic Extractors for Additive Sources. CoRR abs/1410.7253 (2014) - [i9]Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman:
On Low Discrepancy Samplings in Product Spaces of Motion Groups. CoRR abs/1411.7753 (2014) - [i8]Abhishek Bhowmick, Shachar Lovett:
Nonclassical polynomials as a barrier to polynomial lower bounds. CoRR abs/1412.4719 (2014) - [i7]Abhishek Bhowmick, Thái Hoàng Lê:
On primitive elements in finite fields of low characteristic. CoRR abs/1412.7373 (2014) - [i6]Abhishek Bhowmick, Shachar Lovett:
Nonclassical polynomials as a barrier to polynomial lower bounds. Electron. Colloquium Comput. Complex. TR14 (2014) - [i5]Abhishek Bhowmick, Shachar Lovett:
List decoding Reed-Muller codes over small fields. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c5]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New bounds for matching vector families. STOC 2013: 823-832 - 2012
- [i4]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Lower Bounds for Matching Vector Codes. CoRR abs/1204.1367 (2012) - [i3]Abhishek Bhowmick, Zeev Dvir, Shachar Lovett:
New Lower Bounds for Matching Vector Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c4]Raghav Bhaskar, Abhishek Bhowmick, Vipul Goyal, Srivatsan Laxman, Abhradeep Thakurta:
Noiseless Database Privacy. ASIACRYPT 2011: 215-232 - [c3]Ankit Singh Rawat, Sriram Vishwanath, Abhishek Bhowmick, Emina Soljanin:
Update efficient codes for distributed storage. ISIT 2011: 1457-1461 - [i2]Raghav Bhaskar, Abhishek Bhowmick, Vipul Goyal, Srivatsan Laxman, Abhradeep Thakurta:
Noiseless Database Privacy. IACR Cryptol. ePrint Arch. 2011: 487 (2011) - 2010
- [c2]Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Singh:
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology. SSDBM 2010: 214-232 - [i1]Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Singh:
Finding top-k similar pairs of objects annotated with terms from an ontology. CoRR abs/1001.2625 (2010)
2000 – 2009
- 2008
- [c1]Abhishek Bhowmick, Catuscia Palamidessi:
Bounds on the Leakage of the Input's Distribution in Information-Hiding Protocols. TGC 2008: 36-51
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-04-25 05:55 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:
