| Publication | Date of Publication | Type |
|---|
3D Poissonian image deblurring via patch-based tensor logarithmic Schatten-\(p\) minimization
Inverse Problems | 2024-06-18 | Paper |
A generalization of a theorem of Rothschild and van Lint
Theoretical Computer Science | 2023-04-12 | Paper |
Finding optimal non-datapath caching strategies via network flow
Theoretical Computer Science | 2023-02-01 | Paper |
Strategy-proof mechanism for online resource allocation in cloud and edge collaboration
Computing | 2022-03-22 | Paper |
A generalization of a theorem of Rothschild and van Lint
Computer Science – Theory and Applications | 2022-03-21 | Paper |
Explainable deep learning: a field guide for the uninitiated
Journal of Artificial Intelligence Research | 2022-02-07 | Paper |
Symbolic-numeric integration of rational functions
Numerical Algorithms | 2020-04-22 | Paper |
Collective Reconstructive Embeddings for Cross-Modal Hashing
IEEE Transactions on Image Processing | 2019-10-28 | Paper |
A new coding-based algorithm for finding closest pair of vectors
Theoretical Computer Science | 2019-06-06 | Paper |
Conditional density estimation with dimensionality reduction via squared-loss conditional entropy minimization
Neural Computation | 2019-06-04 | Paper |
Space-efficient local computation algorithms
(available as arXiv preprint) | 2019-05-10 | Paper |
| Space-efficient local computation algorithms | 2019-05-10 | Paper |
Hashing with Angular Reconstructive Embeddings
IEEE Transactions on Image Processing | 2019-02-06 | Paper |
A new algorithm for finding closest pair of vectors (extended abstract)
(available as arXiv preprint) | 2018-11-28 | Paper |
\(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product
Journal of Computer and System Sciences | 2018-09-07 | Paper |
| \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product | 2017-12-19 | Paper |
Symbolic-Numeric Integration of Rational Functions
(available as arXiv preprint) | 2017-12-05 | Paper |
Sunflowers and testing triangle-freeness of functions
Computational Complexity | 2017-10-18 | Paper |
The basic polynomial algebra subprograms
ACM Communications in Computer Algebra | 2017-06-22 | Paper |
Sunflowers and testing triangle-freeness of functions
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Fourier sparsity of \(\mathrm{GF}(2)\) polynomials
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Lower bounds for testing triangle-freeness in Boolean functions
Computational Complexity | 2015-07-08 | Paper |
Basic polynomial algebra subprograms
ACM Communications in Computer Algebra | 2015-03-18 | Paper |
Dense Arithmetic over Finite Fields with the CUMODP Library
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
The basic polynomial algebra subprograms
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
| Lower bounds for testing triangle-freeness in Boolean functions | 2014-05-22 | Paper |
Robust characterizations of \(k\)-wise independence over product spaces and related testing results
Random Structures & Algorithms | 2013-10-29 | Paper |
Tight lower bounds for testing linear isomorphism
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Converting online algorithms to local computation algorithms
Automata, Languages, and Programming | 2013-08-12 | Paper |
| Testing linear-invariant non-linear properties | 2012-04-24 | Paper |
Testing linear-invariant non-linear properties
(available as arXiv preprint) | 2012-04-24 | Paper |
| A fast adaptive beamforming algorithm based on the minimum bit error rate criterion | 2011-09-29 | Paper |
Testing linear-invariant non-linear properties
Theory of Computing | 2011-05-24 | Paper |
Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2)
SIAM Journal on Computing | 2010-11-04 | Paper |
Testing Linear-Invariant Non-linear Properties: A Short Report
Property Testing | 2010-10-12 | Paper |
Testing non-uniform \(k\)-wise independent distributions over product spaces (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5485485 (Why is no real title available?) | 2009-01-05 | Paper |
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
Lecture Notes in Computer Science | 2008-11-27 | Paper |
