Computing small partial coveringsBLÄSER, Markus.Information processing letters. 2003, Vol 85, Num 6, pp 327-331, issn 0020-0190, 5 p.Article

Complete problems for Valiant's class of qp-computable families of polynomialsBLÄSER, Markus.Lecture notes in computer science. 2001, pp 1-10, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Computing cycle covers without short cyclesBLÄSER, Markus; SIEBERT, Bodo.Lecture notes in computer science. 2001, pp 368-379, issn 0302-9743, isbn 3-540-42493-8Conference Paper

A 5/2n²-lower bound for the multiplicative complexity of n x n-matrix multiplicationBLÄSER, Markus.Lecture notes in computer science. 2001, pp 99-109, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Private computation : k-connected versus 1-connected networksBLÄSER, Markus; JAKOBY, Andreas; LISKIEWICZ, Maciej et al.Journal of cryptology. 2006, Vol 19, Num 3, pp 341-357, issn 0933-2790, 17 p.Article

Algebras of minimal rank over perfect fieldsBLÄSER, Markus.Proceedings - IEEE Conference on Computational Complexity. 2002, pp 113-122, issn 1093-0159, isbn 0-7695-1468-5, 10 p.Conference Paper

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problemsBLÄSER, Markus; SHANKAR RAM, L; SVIRIDENKO, Maxim et al.Operations research letters. 2009, Vol 37, Num 3, pp 176-180, issn 0167-6377, 5 p.Article

The complexity of bivariate power series arithmeticBLÄSER, Markus.Theoretical computer science. 2003, Vol 295, Num 1-3, pp 65-83, issn 0304-3975, 19 p.Conference Paper

Fast Evaluation of Interlace Polynomials on Graphs of Bounded TreewidthBLÄSER, Markus; HOFFMANN, Christian.Algorithmica. 2011, Vol 61, Num 1, pp 3-35, issn 0178-4617, 33 p.Article

Algebras of minimal rank over arbitrary fieldsBLÄSER, Markus.Lecture notes in computer science. 2003, pp 403-414, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

Uniform computational complexity of the derivatives of C∞-functionsBLÄSER, Markus.Theoretical computer science. 2002, Vol 284, Num 2, pp 199-206, issn 0304-3975Article

Two approximation algorithms for 3-cycle coversBLÄSER, Markus; MANTHEY, Bodo.Lecture notes in computer science. 2002, pp 40-50, issn 0302-9743, isbn 3-540-44186-7, 11 p.Conference Paper

Improvements of the alder-strassen bound: Algebras with nonzero radicalBLÄSER, Markus.Lecture notes in computer science. 2001, pp 79-91, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Private computation: K-connected versus 1-connected networksBLÄSER, Markus; JAKOBY, Andreas; LISKIEWICZ, Maciej et al.Lecture notes in computer science. 2002, pp 194-209, issn 0302-9743, isbn 3-540-44050-X, 16 p.Conference Paper

Beyond the Alder-Strassen boundBLÄSER, Markus.Theoretical computer science. 2005, Vol 331, Num 1, pp 3-21, issn 0304-3975, 19 p.Conference Paper

Deterministically testing sparse polynomial identities of unbounded degreeBLASER, Markus; HARDT, Moritz; LIPTON, Richard J et al.Information processing letters. 2009, Vol 109, Num 3, pp 187-192, issn 0020-0190, 6 p.Article