| Publication | Date of Publication | Type |
|---|
| Towards optimal depth-reductions for algebraic formulas | 2024-11-19 | Paper |
| On the partial derivative method applied to lopsided set-multilinear polynomials | 2024-07-05 | Paper |
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7650312 (Why is no real title available?) | 2023-02-03 | Paper |
| New bounds for the number of connected components of fewnomial hypersurfaces | 2022-08-09 | Paper |
On the Markov numbers: fixed numerator, denominator, and sum conjectures
Advances in Applied Mathematics | 2021-08-05 | Paper |
| Reconstruction of full rank algebraic branching programs | 2020-05-26 | Paper |
Reconstruction of full rank algebraic branching programs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
Theory of Computing | 2019-01-31 | Paper |
On the sensitivity conjecture for disjunctive normal forms
(available as arXiv preprint) | 2018-04-19 | Paper |
| On the sensitivity conjecture for read-\(k\) formulas | 2018-03-21 | Paper |
| An almost cubic lower bound for depth three arithmetic circuits | 2017-12-19 | Paper |
Building efficient and compact data structures for simplicial complexes
Algorithmica | 2017-10-10 | Paper |
Building efficient and compact data structures for simplicial complexes
(available as arXiv preprint) | 2017-10-10 | Paper |
On the size of homogeneous and of depth four formulas with low individual degree
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Detecting wheels
Applicable Analysis and Discrete Mathematics | 2016-06-27 | Paper |
\textsf{VNP} = \textsf{VP} in the multilinear world
Information Processing Letters | 2015-12-01 | Paper |
Log-concavity and lower bounds for arithmetic circuits
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
A \(\tau \)-conjecture for Newton polygons
Foundations of Computational Mathematics | 2015-04-20 | Paper |
On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
Discrete & Computational Geometry | 2015-02-19 | Paper |
Improved bounds for reduction to depth 4 and depth 3
Information and Computation | 2015-01-30 | Paper |
A Wronskian approach to the real \(\tau\)-conjecture
Journal of Symbolic Computation | 2014-12-09 | Paper |
Improved Bounds for Reduction to Depth 4 and Depth 3
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters | 2013-09-02 | Paper |
Rational and lacunary algebraic curves
(available as arXiv preprint) | N/A | Paper |
