| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147409 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084351 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6115392 | 2023-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875535 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090953 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092471 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089178 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090425 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111164 | 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 | 2019-10-15 | Paper |
| Generalized matrix completion and algebraic natural proofs | 2019-08-22 | Paper |
| The border support rank of two-by-two matrix multiplication is seven | 2019-01-29 | Paper |
| A new approximation algorithm for the asymmetric TSP with triangle inequality | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568108 | 2018-06-15 | Paper |
| On degeneration of tensors and algebras | 2018-03-21 | Paper |
| Testing polynomial equivalence by scaling matrices | 2017-11-22 | Paper |
| Ulrich complexity | 2017-11-21 | Paper |
| Smoothed Complexity Theory | 2016-10-24 | Paper |
| Explicit Tensors | 2016-09-22 | Paper |
| A new deterministic algorithm for sparse multivariate polynomial interpolation | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501317 | 2015-08-03 | Paper |
| Noncommutativity makes determinants hard | 2015-06-09 | Paper |
| Noncommutativity Makes Determinants Hard | 2013-08-06 | Paper |
| Smoothed analysis of partitioning algorithms for Euclidean functionals | 2013-05-13 | Paper |
| On the Complexity of the Interlace Polynomial | 2013-03-19 | Paper |
| Weighted Counting of k-Matchings Is #W[1-Hard] | 2013-01-07 | Paper |
| Smoothed Complexity Theory | 2012-09-25 | Paper |
| Complexity and approximability of the cover polynomial | 2012-08-24 | Paper |
| A Probabilistic Analysis of Christofides’ Algorithm | 2012-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113719 | 2012-01-23 | Paper |
| The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree | 2011-08-17 | Paper |
| Fast evaluation of interlace polynomials on graphs of bounded treewidth | 2011-08-16 | Paper |
| Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals | 2011-08-12 | Paper |
| Privacy in non-private environments | 2011-04-01 | Paper |
| Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions | 2010-08-13 | Paper |
| Deterministically testing sparse polynomial identities of unbounded degree | 2010-06-16 | Paper |
| Adding cardinality constraints to integer programs with applications to maximum satisfiability | 2010-03-24 | Paper |
| Semisimple algebras of almost minimal rank over the reals | 2009-11-06 | Paper |
| Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth | 2009-10-29 | Paper |
| Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems | 2009-08-14 | Paper |
| Computing small partial coverings | 2009-03-23 | Paper |
| Approximating Multi-criteria Max-TSP | 2008-11-25 | Paper |
| Semisimple Algebras of Almost Minimal Rank over the Reals | 2008-09-17 | Paper |
| Asymptotically Optimal Hitting Sets Against Polynomials | 2008-08-28 | Paper |
| Approximately fair cost allocation in metric traveling salesman games | 2008-06-06 | Paper |
| Complexity of the Bollobás-Riordan Polynomial | 2008-06-05 | Paper |
| Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity | 2008-05-02 | Paper |
| Complexity of the Cover Polynomial | 2007-11-28 | Paper |
| An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality | 2007-02-14 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Private computation: \(k\)-connected versus 1-connected networks | 2006-11-03 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| On the number of multiplications needed to invert a monic power series over fields of characteristic two | 2005-09-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 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 | 2005-08-02 | Paper |
| Beyond the Alder-Strassen bound. | 2005-04-06 | Paper |
| A Complete Characterization of the Algebras of Minimal Bilinear Complexity | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828916 | 2004-11-29 | Paper |
| An -approximation algorithm for the asymmetric maximum TSP | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471353 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449172 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425953 | 2003-09-14 | Paper |
| The complexity of bivariate power series arithmetic. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418668 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411276 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409119 | 2003-06-30 | Paper |
| On the complexity of the multiplication of matrices of small formats | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796188 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779144 | 2002-11-25 | Paper |
| On the multiplicative complexity of the inversion and division of Hamiltonian quaternions | 2002-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551338 | 2002-09-05 | Paper |
| Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. | 2002-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535011 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762793 | 2002-01-09 | Paper |
| Lower bounds for the bilinear complexity of associative algebras | 2001-04-17 | Paper |
| Lower bounds for the multiplicative complexity of matrix multiplication | 2000-12-19 | Paper |
