| Publication | Date of Publication | Type |
|---|
| On the multilinear complexity of associative algebras | 2024-10-08 | Paper |
| scientific article; zbMATH DE number 7788490 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7758310 (Why is no real title available?) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7711611 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-12 | Paper |
scientific article; zbMATH DE number 7650211 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561323 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561749 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559090 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559388 (Why is no real title available?) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7204284 (Why is no real title available?) | 2020-05-26 | Paper |
| Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory | 2019-11-06 | Paper |
A deterministic PTAS for the algebraic rank of bounded degree polynomials
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Generalized matrix completion and algebraic natural proofs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The border support rank of two-by-two matrix multiplication is seven
Chicago Journal of Theoretical Computer Science | 2019-01-29 | Paper |
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A deterministic PTAS for the commutative rank of matrix spaces
Theory of Computing | 2018-06-15 | Paper |
On degeneration of tensors and algebras
(available as arXiv preprint) | 2018-03-21 | Paper |
| Testing polynomial equivalence by scaling matrices | 2017-11-22 | Paper |
Ulrich complexity
Differential Geometry and its Applications | 2017-11-21 | Paper |
Smoothed complexity theory
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Explicit tensors
Perspectives in Computational Complexity | 2016-09-22 | Paper |
A new deterministic algorithm for sparse multivariate polynomial interpolation
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
| scientific article; zbMATH DE number 6469199 (Why is no real title available?) | 2015-08-03 | Paper |
Noncommutativity makes determinants hard
Information and Computation | 2015-06-09 | Paper |
Noncommutativity makes determinants hard
Automata, Languages, and Programming | 2013-08-06 | Paper |
Smoothed analysis of partitioning algorithms for Euclidean functionals
Algorithmica | 2013-05-13 | Paper |
| On the Complexity of the Interlace Polynomial | 2013-03-19 | Paper |
On the Complexity of the Interlace Polynomial
(available as arXiv preprint) | 2013-03-19 | Paper |
Weighted counting of \(k\)-matchings is \#W[1-hard]
Parameterized and Exact Computation | 2013-01-07 | Paper |
Smoothed complexity theory
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Complexity and approximability of the cover polynomial
Computational Complexity | 2012-08-24 | Paper |
A Probabilistic Analysis of Christofides’ Algorithm
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Randomness efficient testing of sparse black box identities of unbounded degree over the reals | 2012-01-23 | Paper |
The complexity of the cover polynomials for planar graphs of bounded degree
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Fast evaluation of interlace polynomials on graphs of bounded treewidth
Algorithmica | 2011-08-16 | Paper |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Privacy in non-private environments
Theory of Computing Systems | 2011-04-01 | Paper |
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
Theory of Computing Systems | 2010-08-13 | Paper |
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters | 2010-06-16 | Paper |
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters | 2010-03-24 | Paper |
Semisimple algebras of almost minimal rank over the reals
Theoretical Computer Science | 2009-11-06 | Paper |
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters | 2009-08-14 | Paper |
Computing small partial coverings
Information Processing Letters | 2009-03-23 | Paper |
Approximating Multi-criteria Max-TSP
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Semisimple Algebras of Almost Minimal Rank over the Reals
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Asymptotically Optimal Hitting Sets Against Polynomials
Automata, Languages and Programming | 2008-08-28 | Paper |
Approximately fair cost allocation in metric traveling salesman games
Theory of Computing Systems | 2008-06-06 | Paper |
Complexity of the Bollobás-Riordan Polynomial
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
Algorithmic Game Theory | 2008-05-02 | Paper |
Complexity of the Cover Polynomial
Automata, Languages and Programming | 2007-11-28 | Paper |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Private computation: \(k\)-connected versus 1-connected networks
Journal of Cryptology | 2006-11-03 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the number of multiplications needed to invert a monic power series over fields of characteristic two
Journal of Complexity | 2005-09-02 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| Privacy in Non-private Environments | 2005-08-12 | Paper |
Approximating maximum weight cycle covers in directed graphs with weights zero and one
Algorithmica | 2005-08-02 | Paper |
Beyond the Alder-Strassen bound.
Theoretical Computer Science | 2005-04-06 | Paper |
A Complete Characterization of the Algebras of Minimal Bilinear Complexity
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119645 (Why is no real title available?) | 2004-11-29 | Paper |
An -approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms | 2004-10-04 | Paper |
| scientific article; zbMATH DE number 2079394 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038707 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1979498 (Why is no real title available?) | 2003-09-14 | Paper |
The complexity of bivariate power series arithmetic.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962831 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1947046 (Why is no real title available?) | 2003-07-07 | Paper |
| scientific article; zbMATH DE number 1942421 (Why is no real title available?) | 2003-06-30 | Paper |
On the complexity of the multiplication of matrices of small formats
Journal of Complexity | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1875429 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1834648 (Why is no real title available?) | 2002-11-25 | Paper |
On the multiplicative complexity of the inversion and division of Hamiltonian quaternions
Foundations of Computational Mathematics | 2002-10-06 | Paper |
| scientific article; zbMATH DE number 1796947 (Why is no real title available?) | 2002-09-05 | Paper |
Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
Theoretical Computer Science | 2002-07-31 | Paper |
| scientific article; zbMATH DE number 1754586 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1689048 (Why is no real title available?) | 2002-01-09 | Paper |
Lower bounds for the bilinear complexity of associative algebras
Computational Complexity | 2001-04-17 | Paper |
Lower bounds for the multiplicative complexity of matrix multiplication
Computational Complexity | 2000-12-19 | Paper |
