| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126356 | 2024-04-09 | Paper |
| Reed Solomon Codes Against Adversarial Insertions and Deletions | 2024-03-19 | Paper |
| Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions | 2024-03-14 | Paper |
| Learnability can be independent of set theory (invited paper) | 2023-11-14 | Paper |
| Polynomial time deterministic identity testing algorithm for Σ [3 ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials] | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6115375 | 2023-07-12 | Paper |
| Reed-Muller Codes | 2023-01-23 | Paper |
| A generalized Sylvester–Gallai-type theorem for quadratic polynomials | 2022-12-19 | Paper |
| Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions | 2022-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092455 | 2022-07-21 | Paper |
| Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel | 2022-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028363 | 2022-02-09 | Paper |
| Reed–Muller Codes: Theory and Algorithms | 2021-07-23 | Paper |
| On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures | 2021-02-02 | Paper |
| Sylvester-Gallai type theorems for quadratic polynomials | 2020-10-20 | Paper |
| Sylvester-Gallai type theorems for quadratic polynomials | 2020-01-30 | Paper |
| A PSPACE construction of a hitting set for the closure of small algebraic circuits | 2019-08-22 | Paper |
| Approximate nonnegative rank is equivalent to the smooth rectangle bound | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4612482 | 2019-01-31 | Paper |
| On the degree of univariate polynomials over the integers | 2018-04-12 | Paper |
| Teaching and Compressing for Low VC-Dimension | 2018-02-26 | Paper |
| Proof Complexity Lower Bounds from Algebraic Circuit Complexity | 2017-10-10 | Paper |
| Efficiently decoding Reed-Muller codes from random errors | 2017-09-29 | Paper |
| Succinct hitting sets and barriers to proving algebraic circuits lower bounds | 2017-08-17 | Paper |
| On the structure of Boolean functions with small spectral norm | 2017-07-28 | Paper |
| Efficiently Decoding Reed–Muller Codes From Random Errors | 2017-07-27 | Paper |
| New Constructions of WOM Codes Using the Wozencraft Ensemble | 2017-06-08 | Paper |
| On the structure of Boolean functions with small spectral norm | 2017-05-19 | Paper |
| Direct sum fails for zero error average communication | 2017-05-19 | Paper |
| High Sum-Rate Three-Write and Nonbinary WOM Codes | 2017-05-16 | Paper |
| Capacity-Achieving Multiwrite WOM Codes | 2017-05-16 | Paper |
| Reed–Muller Codes for Random Erasures and Errors | 2017-04-28 | Paper |
| Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. | 2017-03-31 | Paper |
| Direct sum fails for zero-error average communication | 2016-11-29 | Paper |
| On the degree of univariate polynomials over the integers | 2016-10-07 | Paper |
| Read-once polynomial identity testing | 2015-09-21 | Paper |
| Reed-Muller Codes for Random Erasures and Errors | 2015-08-21 | Paper |
| Hitting sets for multilinear read-once algebraic branching programs, in any order | 2015-06-26 | Paper |
| Equivalence of polynomial identity testing and polynomial factorization | 2015-06-23 | Paper |
| Lower bounds for matrix product, in bounded depth circuits with arbitrary gates | 2015-02-27 | Paper |
| Explicit construction of a small epsilon-net for linear threshold functions | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497117 | 2015-02-03 | Paper |
| On the minimal Fourier degree of symmetric Boolean functions | 2014-08-14 | Paper |
| On the structure of cubic and quartic polynomials | 2014-08-13 | Paper |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in | 2014-08-13 | Paper |
| Optimal Testing of Multivariate Polynomials over Small Prime Fields | 2014-07-30 | Paper |
| Tight Lower Bounds for 2-query LCCs over Finite Fields | 2014-07-30 | Paper |
| Testing Equivalence of Polynomials under Shifts | 2014-07-01 | Paper |
| Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound | 2014-07-01 | Paper |
| On identity testing of tensors, low-rank recovery and compressed sensing | 2014-05-13 | Paper |
| Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in | 2014-04-11 | Paper |
| Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields] | 2014-01-29 | Paper |
| Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing | 2013-10-04 | Paper |
| Optimal Testing of Multivariate Polynomials over Small Prime Fields | 2013-07-24 | Paper |
| On sunflowers and matrix multiplication | 2013-07-19 | Paper |
| Capacity Achieving Two-Write WOM Codes | 2012-06-29 | Paper |
| Explicit Dimension Reduction and Its Applications | 2012-05-30 | Paper |
| Towards dimension expanders over finite fields | 2011-12-20 | Paper |
| Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in | 2011-12-20 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2011-11-07 | Paper |
| On Sums of Locally Testable Affine Invariant Properties | 2011-08-17 | Paper |
| Recent Results on Polynomial Identity Testing | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002772 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002826 | 2011-05-24 | Paper |
| Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions | 2011-04-04 | Paper |
| The black-box query complexity of polynomial summation | 2011-02-18 | Paper |
| Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators | 2011-02-18 | Paper |
| The complexity of Boolean functions in different characteristics | 2011-02-18 | Paper |
| Arithmetic Circuits: A survey of recent results and open questions | 2011-01-24 | Paper |
| On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors | 2010-09-07 | Paper |
| Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits | 2010-09-06 | Paper |
| Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits | 2010-08-16 | Paper |
| Derandomizing homomorphism testing in general groups | 2010-08-15 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates | 2010-01-06 | Paper |
| Improved Polynomial Identity Testing for Read-Once Formulas | 2009-10-28 | Paper |
| A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits | 2009-08-20 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549624 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302074 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302099 | 2009-01-05 | Paper |
| Locally Testable Cyclic Codes | 2008-12-21 | Paper |
| An improved analysis of linear mergers | 2008-02-22 | Paper |
| Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits | 2007-10-22 | Paper |
| Derandomizing Homomorphism Testing in General Groups | 2007-09-07 | Paper |
| On ε‐biased generators in NC0 | 2006-09-06 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Deterministic polynomial identity testing in non-commutative models | 2005-06-16 | Paper |
| Lower Bounds for Matrix Product | 2003-09-28 | Paper |
| Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates | 2003-06-19 | Paper |
| Affine projections of symmetric polynomials. | 2003-05-14 | Paper |
| Depth-3 arithmetic circuits over fields of characteristic zero | 2002-02-28 | Paper |
