Follow
Markus Bläser
Markus Bläser
Saarland University, Saarland Informatics Campus, Saarbrücken, Germany
Verified email at cs.uni-saarland.de
Title
Cited by
Cited by
Year
Fast matrix multiplication
M Bläser
Theory of Computing, 1-60, 2013
1092013
A new approximation algorithm for the asymmetric TSP with triangle inequality
M Bläser
ACM Transactions on Algorithms (TALG) 4 (4), 1-15, 2008
106*2008
On the complexity of the multiplication of matrices of small formats
M Bläser
Journal of Complexity 19 (1), 43-60, 2003
812003
Computing small partial coverings
M Bläser
Information Processing Letters 85 (6), 327-331, 2003
622003
A 5/2n^2 Lower Bound for the Rank of-Matrix Multiplication over Arbitrary Fields
M Bläser
FOCS'99, 45-50, 1999
57*1999
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
482009
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
482006
A 3/4-approximation algorithm for maximum ATSP with weights zero and one
M Bläser
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
452004
Lower bounds for the multiplicative complexity of matrix multiplication
M Bläser
computational complexity 8 (3), 203-226, 1999
391999
An 8/13-approximation algorithm for the asymmetric maximum TSP
M Bläser
Journal of Algorithms 50 (1), 23-48, 2004
382004
Computing cycle covers without short cycles
M Bläser, B Siebert
Lecture notes in computer science, 368-379, 2001
372001
Approximating maximum weight cycle covers in directed graphs with weights zero and one
M Bläser, B Manthey
Algorithmica 42, 121-139, 2005
352005
Complexity of the cover polynomial
M Bläser, H Dell
Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007
342007
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
31*2006
On the complexity of the interlace polynomial
M Bläser, C Hoffmann
arXiv preprint arXiv:0707.4565, 2007
292007
Generalized matrix completion and algebraic natural proofs
M Bläser, C Ikenmeyer, G Jindal, V Lysikov
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
212018
On degeneration of tensors and algebras
M Bläser, V Lysikov
arXiv preprint arXiv:1606.04253, 2016
212016
Two approximation algorithms for 3-cycle covers
M Bläser, B Manthey
Approximation Algorithms for Combinatorial Optimization: 5th International …, 2002
212002
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
20*2009
An improved approximation algorithm for TSP with distances one and two
M Bläser, LS Ram
Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005
192005
The system can't perform the operation now. Try again later.
Articles 1–20