| Publication | Date of Publication | Type |
|---|
| Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070385 | 2023-11-20 | Paper |
| On the probabilistic degree of OR over the reals | 2023-10-12 | Paper |
| The discrepancy of greater-than | 2023-09-15 | Paper |
| Schur polynomials do not have small formulas if the determinant does not | 2023-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875656 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875662 | 2023-02-03 | Paper |
| Parity helps to compute majority | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090936 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092463 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090378 | 2022-07-18 | Paper |
| A \#SAT algorithm for small constant-depth circuits with PTF gates | 2022-03-22 | Paper |
| Strongly Exponential Separation between Monotone VP and Monotone VNP | 2022-03-07 | Paper |
| Decoding Variants of Reed-Muller Codes over Finite Grids | 2022-03-07 | Paper |
| On Vanishing Properties of Polynomials on Symmetric Sets of the Boolean Cube, in Positive Characteristic | 2021-11-09 | Paper |
| On the Probabilistic Degrees of Symmetric Boolean Functions | 2021-09-17 | Paper |
| A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] | 2021-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005182 | 2021-08-04 | Paper |
| A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993289 | 2021-06-15 | Paper |
| A robust version of Hegedus’s lemma, with applications | 2021-01-19 | Paper |
| Local decoding and testing of polynomials over grids | 2020-11-30 | Paper |
| Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111381 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111256 | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215664 | 2020-02-12 | Paper |
| A fixed-depth size-hierarchy theorem for AC 0 [⊕ via the coin problem] | 2020-01-30 | Paper |
| Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees | 2019-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967232 | 2019-07-03 | Paper |
| On polynomial approximations to AC | 2019-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4612476 | 2019-01-31 | Paper |
| Robust Multiplication-Based Tests for Reed–Muller Codes | 2019-01-18 | Paper |
| Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications | 2019-01-14 | Paper |
| Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636465 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636564 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636610 | 2018-04-19 | Paper |
| On the hardness of the noncommutative determinant | 2018-04-18 | Paper |
| Composition limits and separating examples for some Boolean function complexity measures | 2018-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368898 | 2017-10-11 | Paper |
| Average-case lower bounds and satisfiability algorithms for small threshold circuits | 2017-10-10 | Paper |
| Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes | 2017-03-10 | Paper |
| An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas | 2017-03-10 | Paper |
| On Improved Degree Lower Bounds for Polynomial Approximation. | 2017-02-21 | Paper |
| Certifying polynomials for AC^0(parity) circuits, with applications | 2017-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955002 | 2017-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2830870 | 2016-11-01 | Paper |
| A tail bound for read-kfamilies of functions | 2015-10-12 | Paper |
| Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication | 2015-10-08 | Paper |
| The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials | 2015-09-16 | Paper |
| Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes | 2015-06-26 | Paper |
| Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas | 2015-06-26 | Paper |
| Lower bounds for depth 4 formulas computing iterated matrix multiplication | 2015-06-26 | Paper |
| On the hardness of the noncommutative determinant | 2014-08-13 | Paper |
| Almost settling the hardness of noncommutative determinant | 2014-06-05 | Paper |
| On the Limits of Sparsification | 2013-08-12 | Paper |
| Optimal Hitting Sets for Combinatorial Shapes | 2012-11-02 | Paper |
| Arithmetic Circuits and the Hadamard Product of Polynomials | 2012-10-24 | Paper |
| The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets | 2012-01-23 | Paper |
| Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions | 2011-08-17 | Paper |
| Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates | 2011-08-17 | Paper |
| New results on noncommutative and commutative polynomial identity testing | 2011-02-18 | Paper |
| On Lower Bounds for Constant Width Arithmetic Circuits | 2009-12-17 | Paper |
