| Publication | Date of Publication | Type |
|---|
| Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization | 2024-11-14 | Paper |
| Learning generalized depth three arithmetic circuits in the non-degenerate case | 2024-08-22 | Paper |
| Equivalence test for read-once arithmetic formulas | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070394 | 2023-11-20 | Paper |
| Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits | 2022-12-05 | Paper |
| Determinant Equivalence Test over Finite Fields and over Q | 2022-07-21 | Paper |
| On the Symmetries of and Equivalence Test for Design Polynomials. | 2022-07-21 | Paper |
| A super-quadratic lower bound for depth four arithmetic circuits | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089246 | 2022-07-18 | Paper |
| Type I and Type II error rates in the last observation carried forward method under informative dropout | 2020-12-03 | Paper |
| Reconstruction of Full Rank Algebraic Branching Programs | 2020-05-26 | Paper |
| Reconstruction of non-degenerate homogeneous depth three circuits | 2020-01-30 | Paper |
| Average-case linear matrix factorization and reconstruction of low width algebraic branching programs | 2019-12-19 | Paper |
| Reconstruction of Full Rank Algebraic Branching Programs | 2019-12-16 | Paper |
| On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree | 2019-01-31 | Paper |
| Multi-\(k\)-ic depth three circuit lower bound | 2018-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601827 | 2018-01-24 | Paper |
| Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598169 | 2017-12-19 | Paper |
| On the size of homogeneous and of depth four formulas with low individual degree | 2017-09-29 | Paper |
| An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas | 2017-03-10 | Paper |
| Multi-k-ic Depth Three Circuit Lower Bound | 2017-01-24 | Paper |
| Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits | 2016-09-02 | Paper |
| Give-and-take based peer-to-peer content distribution networks | 2016-07-01 | Paper |
| Lower bounds for depth-three arithmetic circuits with small bottom fanin | 2016-06-30 | Paper |
| Lower Bounds for Sums of Powers of Low Degree Univariates | 2015-10-27 | Paper |
| On the Sum of Square Roots of Polynomials and Related Problems | 2015-09-24 | Paper |
| Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas | 2015-06-26 | Paper |
| A super-polynomial lower bound for regular arithmetic formulas | 2015-06-26 | Paper |
| Quasi-polynomial hitting-set for set-depth-Δ formulas | 2014-08-07 | Paper |
| Jacobian hits circuits | 2014-05-13 | Paper |
| Fast integer multiplication using modular arithmetic | 2013-07-24 | Paper |
| A case of depth-3 identity testing, sparse factorization and duality | 2013-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910754 | 2013-03-19 | Paper |
| The power of depth 2 circuits over algebras | 2012-10-24 | Paper |
| Covering a set of points in a plane using two parallel rectangles | 2010-08-20 | Paper |
| Simpler algorithm for estimating frequency moments of data streams | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302073 | 2009-01-05 | Paper |
| Bias in the last observation carried forward method under informative dropout | 2008-12-08 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Asymptotic Bias in the Linear Mixed Effects Model Under Non-Ignorable Missing Data Mechanisms | 2005-05-06 | Paper |
