| Publication | Date of Publication | Type |
|---|
| Proper \(q\)-caterpillars are distinguished by their chromatic symmetric functions | 2024-08-19 | Paper |
| Parameterised counting in logspace | 2023-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092414 | 2022-07-21 | Paper |
| Limitations of sums of bounded read formulas and ABPs | 2022-03-21 | Paper |
| On measures of space over real and complex numbers | 2021-04-21 | Paper |
| On hard instances of non-commutative permanent | 2020-03-23 | Paper |
| On proving parameterized size lower bounds for multilinear algebraic models | 2020-02-24 | Paper |
| Lower bounds for special cases of syntactic multilinear ABPs | 2020-01-29 | Paper |
| Lower bounds for Sum and Sum of Products of Read-once Formulas | 2019-12-16 | Paper |
| Linear projections of the Vandermonde polynomial | 2019-10-18 | Paper |
| A note on parameterized polynomial identity testing using hitting set generators | 2019-09-20 | Paper |
| Lower bounds for special cases of syntactic multilinear ABPs | 2018-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636588 | 2018-04-19 | Paper |
| Testing polynomial equivalence by scaling matrices | 2017-11-22 | Paper |
| On \(\varSigma\wedge\varSigma\wedge\varSigma\) circuits: the role of middle \(\varSigma\) fan-in, homogeneity and bottom degree | 2017-11-22 | Paper |
| On weak-space complexity over complex numbers | 2017-11-22 | Paper |
| On constant depth circuits parameterized by degree: identity testing and depth reduction | 2017-10-23 | Paper |
| Building above read-once polynomials: identity testing and hardness of representation | 2016-12-21 | Paper |
| On Hard Instances of Non-Commutative Permanent | 2016-09-02 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2015-09-03 | Paper |
| Parameterized Analogues of Probabilistic Computation | 2015-02-19 | Paper |
| Building above Read-once Polynomials: Identity Testing and Hardness of Representation | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191148 | 2014-09-24 | Paper |
| Monomials, multilinearity and identity testing in simple read-restricted circuits | 2014-02-11 | Paper |
| Resource trade-offs in syntactically multilinear arithmetic circuits | 2013-09-30 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2013-09-20 | Paper |
| Smoothed analysis of partitioning algorithms for Euclidean functionals | 2013-05-13 | Paper |
| Small space analogues of Valiant's classes and the limitations of skew formulas | 2013-04-11 | Paper |
| Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs | 2012-09-25 | Paper |
| Isomorphism testing of read-once functions and polynomials | 2012-08-31 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| A Probabilistic Analysis of Christofides’ Algorithm | 2012-08-14 | Paper |
| On the complexity of matroid isomorphism problem | 2011-10-11 | Paper |
| Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals | 2011-08-12 | Paper |
| Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} | 2010-05-05 | Paper |
| Small-Space Analogues of Valiant’s Classes | 2009-10-20 | Paper |
| Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae | 2009-02-03 | Paper |
| Arithmetizing Classes Around NC 1 and L | 2007-09-03 | Paper |
