| 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 |
| Hitting sets for orbits of circuit classes and polynomial families | 2023-11-20 | Paper |
Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits
ACM Transactions on Computation Theory | 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 |
scientific article; zbMATH DE number 7559443 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Type I and type II error rates in the last observation carried forward method under informative dropout
Journal of Applied Statistics | 2020-12-03 | Paper |
| Reconstruction of full rank algebraic branching programs | 2020-05-26 | Paper |
Reconstruction of non-degenerate homogeneous depth three circuits
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
Computational Complexity | 2019-12-19 | 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 |
Multi-\(k\)-ic depth three circuit lower bound
Theory of Computing Systems | 2018-02-01 | Paper |
| Lower bounds for depth three arithmetic circuits with small bottom fanin | 2018-01-24 | Paper |
| Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits | 2018-01-24 | Paper |
| An almost cubic lower bound for depth three arithmetic circuits | 2017-12-19 | 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 |
An exponential lower bound for homogeneous depth four arithmetic formulas
SIAM Journal on Computing | 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
SIAM Journal on Computing | 2016-09-02 | Paper |
Give-and-take based peer-to-peer content distribution networks
Sādhanā | 2016-07-01 | Paper |
Lower bounds for depth-three arithmetic circuits with small bottom fanin
Computational Complexity | 2016-06-30 | Paper |
Lower bounds for sums of powers of low degree univariates
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
A super-polynomial lower bound for regular arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Jacobian hits circuits: hitting-sets, lower bounds for depth-\(D\) occur-\(k\) formulas \& depth-\(3\) transcendence degree-\(k\) circuits
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Fast integer multiplication using modular arithmetic
SIAM Journal on Computing | 2013-07-24 | Paper |
A case of depth-3 identity testing, sparse factorization and duality
Computational Complexity | 2013-04-11 | Paper |
| Factoring polynomials over finite fields using balance test | 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
Information Processing Letters | 2010-08-20 | Paper |
Simpler algorithm for estimating frequency moments of data streams
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5485562 (Why is no real title available?) | 2009-01-05 | Paper |
Bias in the last observation carried forward method under informative dropout
Journal of Statistical Planning and Inference | 2008-12-08 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Asymptotic Bias in the Linear Mixed Effects Model Under Non-Ignorable Missing Data Mechanisms
Journal of the Royal Statistical Society Series B: Statistical Methodology | 2005-05-06 | Paper |
