| Publication | Date of Publication | Type |
|---|
Algebraic and combinatorial algorithms for \(S\)-packing coloring
ACM Communications in Computer Algebra | 2025-08-25 | Paper |
Proper \(q\)-caterpillars are distinguished by their chromatic symmetric functions
Discrete Mathematics | 2024-08-19 | Paper |
Parameterised counting in logspace
Algorithmica | 2023-10-06 | Paper |
scientific article; zbMATH DE number 7561696 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Limitations of sums of bounded read formulas and ABPs
(available as arXiv preprint) | 2022-03-21 | Paper |
| On measures of space over real and complex numbers | 2021-04-21 | Paper |
On hard instances of non-commutative permanent
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2020-01-29 | Paper |
Lower bounds for sum and sum of products of read-once formulas
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Linear projections of the Vandermonde polynomial
Theoretical Computer Science | 2019-10-18 | Paper |
A note on parameterized polynomial identity testing using hitting set generators
Information Processing Letters | 2019-09-20 | Paper |
Lower bounds for special cases of syntactic multilinear ABPs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
| Sum of products of read-once formulas | 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
Algorithmica | 2016-12-21 | Paper |
On hard instances of non-commutative permanent
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Random shortest paths: non-Euclidean instances for metric optimization problems
Algorithmica | 2015-09-03 | Paper |
Parameterized analogues of probabilistic computation
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
Building above read-once polynomials: identity testing and hardness of representation
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Complexity of testing reachability in matroids
Chicago Journal of Theoretical Computer Science | 2014-09-24 | Paper |
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science | 2014-02-11 | Paper |
Resource trade-offs in syntactically multilinear arithmetic circuits
Computational Complexity | 2013-09-30 | Paper |
Random shortest paths: non-Euclidean instances for metric optimization problems
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Smoothed analysis of partitioning algorithms for Euclidean functionals
Algorithmica | 2013-05-13 | Paper |
Small space analogues of Valiant's classes and the limitations of skew formulas
Computational Complexity | 2013-04-11 | Paper |
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| Isomorphism testing of read-once functions and polynomials | 2012-08-31 | Paper |
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
A Probabilistic Analysis of Christofides’ Algorithm
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On the complexity of matroid isomorphism problem
Theory of Computing Systems | 2011-10-11 | Paper |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}
Theory of Computing Systems | 2010-05-05 | Paper |
Small-Space Analogues of Valiant’s Classes
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Arithmetizing Classes Around NC 1 and L
STACS 2007 | 2007-09-03 | Paper |
