| Publication | Date of Publication | Type |
|---|
| Lower bounds for the sum of small-size algebraic branching programs | 2024-11-12 | Paper |
| VDOO: a short, fast, post-quantum multivariate digital signature scheme | 2024-10-23 | Paper |
| Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials | 2024-09-12 | Paper |
| Improved lower bound, and proof barrier, for constant depth algebraic circuits | 2024-08-06 | Paper |
| Solving polynomial systems over non-fields and applications to modular polynomial factoring | 2024-05-24 | Paper |
| Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) | 2024-05-22 | Paper |
| An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function | 2023-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6115364 | 2023-07-12 | Paper |
| Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) | 2023-07-10 | Paper |
| Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091766 | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002729 | 2021-07-28 | Paper |
| Blackbox identity testing for sum of special ROABPs and its border class | 2021-07-16 | Paper |
| Computing Igusa’s local zeta function of univariates in deterministic polynomial-time | 2021-03-11 | Paper |
| Efficiently factoring polynomials modulo \(p^4\) | 2021-02-18 | Paper |
| Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree | 2021-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121898 | 2020-09-22 | Paper |
| Efficiently Factoring Polynomials Modulo p4 | 2020-09-10 | Paper |
| Irreducibility and Deterministic r-th Root Finding over Finite Fields | 2020-09-09 | Paper |
| Bootstrapping variables in algebraic circuits | 2020-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215662 | 2020-02-12 | Paper |
| Discovering the roots: uniform closure results for algebraic classes under factoring | 2019-08-22 | Paper |
| Bootstrapping variables in algebraic circuits | 2019-08-22 | Paper |
| Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications | 2019-02-20 | Paper |
| Erratum: ``PRIMES is in P | 2019-01-18 | Paper |
| Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits | 2018-12-10 | Paper |
| Polynomial interpolation and identity testing from high powers over finite fields | 2018-04-06 | Paper |
| Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits | 2018-03-21 | Paper |
| Integer factoring using small algebraic dependencies | 2018-03-21 | Paper |
| Deterministic identity testing for sum of read-once oblivious arithmetic branching programs | 2018-01-24 | Paper |
| Deterministic identity testing for sum of read-once oblivious arithmetic branching programs | 2017-12-18 | Paper |
| Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs | 2017-10-11 | Paper |
| Identity testing for constant-width, and commutative, read-once oblivious ABPs | 2017-10-10 | Paper |
| Progress on polynomial identity testing. II | 2016-09-22 | 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 |
| Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits | 2015-06-08 | Paper |
| Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas | 2014-08-07 | Paper |
| Deterministic polynomial factoring and association schemes | 2014-07-23 | Paper |
| Algebraic independence in positive characteristic: a \(p\)-adic calculus | 2014-06-11 | Paper |
| Blackbox identity testing for bounded top fanin depth-3 circuits | 2014-06-05 | Paper |
| Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits | 2014-05-13 | Paper |
| From sylvester-gallai configurations to rank bounds | 2014-02-17 | Paper |
| Entropy-based location management in long-term evolution cellular systems | 2013-10-18 | Paper |
| Algebraic independence and blackbox identity testing | 2013-06-06 | Paper |
| A case of depth-3 identity testing, sparse factorization and duality | 2013-04-11 | Paper |
| Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn't matter | 2013-02-04 | Paper |
| The power of depth 2 circuits over algebras | 2012-10-24 | Paper |
| Schemes for deterministic polynomial factoring | 2012-05-13 | Paper |
| Trading GRH for algebra: algorithms for factoring polynomials and related structures | 2012-02-17 | Paper |
| Algebraic independence and blackbox identity testing | 2011-07-07 | Paper |
| An almost optimal rank bound for depth-3 identities | 2011-05-17 | Paper |
| Deterministic polynomial time algorithms for matrix completion problems | 2011-04-04 | Paper |
| Progress on polynomial identity testing | 2010-01-13 | Paper |
| Diagonal Circuit Identity Testing and Lower Bounds | 2008-08-28 | Paper |
| Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms | 2008-03-19 | Paper |
| Polynomial identity testing for depth 3 circuits | 2008-02-22 | Paper |
| Complexity of ring morphism problems | 2007-11-14 | Paper |
| PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS | 2007-06-20 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| PRIMES is in P | 2005-04-18 | Paper |
