Markus Bläser
Markus Bläser
Saarland University, Saarland Informatics Campus, Saarbrücken, Germany
Verified email at cs.uni-saarland.de
TitleCited byYear
A new approximation algorithm for the asymmetric TSP with triangle inequality.
M Bläser
ACM Trans. Algorithms 4 (4), 47:1-47:15, 2008
91*2008
On the complexity of the multiplication of matrices of small formats
M Bläser
Journal of Complexity 19 (1), 43-60, 2003
592003
Fast matrix multiplication
M Bläser
Theory of Computing, 1-60, 2013
492013
A 5/2n^2 Lower Bound for the Rank of-Matrix Multiplication over Arbitrary Fields
M Bläser
FOCS'99, 45-50, 1999
49*1999
Computing small partial coverings
M Bläser
Information Processing Letters 85 (6), 327-331, 2003
482003
Deterministically testing sparse polynomial identities of unbounded degree
M Bläser, M Hardt, RJ Lipton, NK Vishnoi
Information Processing Letters 109 (3), 187-192, 2009
382009
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
M Bläser, B Manthey, J Sgall
Journal of Discrete Algorithms 4 (4), 623-632, 2006
382006
A 3/4-approximation algorithm for maximum ATSP with weights zero and one
M Bläser
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
382004
Computing cycle covers without short cycles
M Bläser, B Siebert
European Symposium on Algorithms, 368-379, 2001
352001
Lower bounds for the multiplicative complexity of matrix multiplication
M Bläser
computational complexity 8 (3), 203-226, 1999
341999
Complexity of the cover polynomial
M Bläser, H Dell
International Colloquium on Automata, Languages, and Programming, 801-812, 2007
322007
Approximating maximum weight cycle covers in directed graphs with weights zero and one
M Bläser, B Manthey
Algorithmica 42 (2), 121-139, 2005
322005
An 8/13-approximation algorithm for the asymmetric maximum TSP
M Bläser
Journal of Algorithms 50 (1), 23-48, 2004
302004
Private computation: k-connected versus 1-connected networks
M Bläser, A Jakoby, M Liskiewicz, B Manthey
Journal of cryptology 19 (3), 341-357, 2006
28*2006
On the complexity of the interlace polynomial
M Bläser, C Hoffmann
arXiv preprint arXiv:0707.4565, 2007
262007
Lower bounds for the bilinear complexity of associative algebras
M Bläser
computational complexity 9 (2), 73-112, 2000
202000
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
M Bläser, LS Ram, M Sviridenko
Operations Research Letters 37 (3), 176-180, 2009
19*2009
An improved approximation algorithm for TSP with distances one and two
M Bläser, LS Ram
International Symposium on Fundamentals of Computation Theory, 504-515, 2005
182005
Two approximation algorithms for 3-cycle covers
M Bläser, B Manthey
International Workshop on Approximation Algorithms for Combinatorial …, 2002
182002
Smoothed analysis of partitioning algorithms for Euclidean functionals
M Bläser, B Manthey, BVR Rao
Algorithmica 66 (2), 397-418, 2013
172013
The system can't perform the operation now. Try again later.
Articles 1–20