Abhishek Bhowmick

Orcid: 0000-0002-5925-7084

Affiliations:
  • University of Texas at Austin, Department of Computer Science


According to our database1, Abhishek Bhowmick authored at least 20 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory.
IEEE Trans. Inf. Theory, February, 2023

2019
Statistical Framework for Uncertainty Quantification in Computational Molecular Modeling.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

2018
The List Decoding Radius for Reed-Muller Codes Over Small Fields.
IEEE Trans. Inf. Theory, 2018

2017
A note on character sums in finite fields.
Finite Fields Their Appl., 2017

2016
On Higher-Order Fourier Analysis over Non-Prime Fields.
Proceedings of the Approximation, 2016

2015
On primitive elements in finite fields of low characteristic.
Finite Fields Their Appl., 2015

Using higher-order Fourier analysis over general fields.
Electron. Colloquium Comput. Complex., 2015

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory.
Electron. Colloquium Comput. Complex., 2015

Quantifying and Visualizing Uncertainties in Molecular Models.
CoRR, 2015

Deterministic Extractors for Additive Sources: Extended Abstract.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
New Bounds for Matching Vector Families.
SIAM J. Comput., 2014

List decoding Reed-Muller codes over small fields.
Electron. Colloquium Comput. Complex., 2014

Nonclassical polynomials as a barrier to polynomial lower bounds.
Electron. Colloquium Comput. Complex., 2014

Deterministic Extractors for Additive Sources.
CoRR, 2014

On Low Discrepancy Samplings in Product Spaces of Motion Groups.
CoRR, 2014

2012
New Lower Bounds for Matching Vector Codes.
Electron. Colloquium Comput. Complex., 2012

2011
Noiseless Database Privacy.
IACR Cryptol. ePrint Arch., 2011

Update efficient codes for distributed storage.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology.
Proceedings of the Scientific and Statistical Database Management, 2010

2008
Bounds on the Leakage of the Input's Distribution in Information-Hiding Protocols.
Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008


  Loading...