| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Markus Bläser, Bodo Manthey |
Smoothed Complexity Theory  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Christian Hoffmann |
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Jean-Sébastien Coron, Alexey Pospelov |
Small Private Circuits |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Radu Curticapean |
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Engels |
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Holger Dell, Johann A. Makowsky |
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi |
Deterministically testing sparse polynomial identities of unbounded degree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Meyer de Voltaire |
Semisimple algebras of almost minimal rank over the reals. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Hoffmann |
Fast computation of interlace polynomials on graphs of bounded treewidth |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Christian Hoffmann |
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Thomas Heynen, Bodo Manthey |
Adding cardinality constraints to integer programs with applications to maximum satisfiability. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
A new approximation algorithm for the asymmetric TSP with triangle inequality. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, TSP, traveling salesman problem, cycle cover |
| 1 | Markus Bläser, Bodo Manthey, Oliver Putz |
Approximating Multi-Criteria Max-TSP |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram |
Approximately Fair Cost Allocation in Metric Traveling Salesman Games. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Fair cost allocations, Traveling salesman game, Approximate fair cost allocation, Combinatorial optimization, Cooperative games |
| 1 | Markus Bläser |
Metric TSP. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Holger Dell, Johann A. Makowsky |
Complexity of the Bollobás-Riordan Polynomial. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, Oliver Putz |
Approximating Multi-criteria Max-TSP. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Moritz Hardt, David Steurer |
Asymptotically Optimal Hitting Sets Against Polynomials. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Hoffmann |
On the Complexity of the Interlace Polynomial. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Elias Vicari |
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity. |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Hoffmann |
On the Complexity of the Interlace Polynomial |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Holger Dell |
Complexity of the Cover Polynomial. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Meyer de Voltaire |
Semisimple Algebras of Almost Minimal Rank over the Reals. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation: k-Connected versus 1-Connected Networks. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
Connectivity, Randomness, Secure multi-party computation, Secure function evaluation, Parity, Private computation |
| 1 | Markus Bläser, Bodo Manthey, Jiri Sgall |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Beyond the Alder-Strassen bound. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
On the number of multiplications needed to invert a monic power series over fields of characteristic two. |
J. Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers |
| 1 | Markus Bläser, L. Shankar Ram |
An Improved Approximation Algorithm for TSP with Distances One and Two. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram |
Approximate Fair Cost Allocation in Metric Traveling Salesman Games. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
An 8/13-approximation algorithm for the asymmetric maximum TSP. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
A Complete Characterization of the Algebras of Minimal Bilinear Complexity. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-private Environments. |
ASIACRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Computing small partial coverings. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Privacy in Non-Private Environments |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey |
Private Computation - k-connected versus 1-connected Networks |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Bläser |
The complexity of bivariate power series arithmetic. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
On the complexity of the multiplication of matrices of small formats. |
J. Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
A new approximation algorithm for the asymmetric TSP with triangle inequality. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Algebras of Minimal Rank over Arbitrary Fields. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Budget balanced mechanisms for the multicast pricing problem with rates. |
ACM Conference on Electronic Commerce |
2003 |
DBLP DOI BibTeX RDF |
cost-sharing functions, multicast pricing, mechanism design |
| 1 | Markus Bläser |
On the Multiplicative Complexity of the Inversion and Division of Hamiltonian Quaternions. |
Foundations of Computational Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Uniform computational complexity of the derivatives of Cinfinity-functions. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
An 8/13-approximation algorithm for the asymmetric maximum TSP. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert |
Private Computation - k-Connected versus 1-Connected Networks. |
CRYPTO |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Two Approximation Algorithms for 3-Cycle Covers. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Algebras of Minimal Rank over Perfect Fields. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
algebras of minimal rank, multiplication, bilinear complexity |
| 1 | Markus Bläser, Bodo Siebert |
Computing Cycle Covers without Short Cycles. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Computing Reciprocals of Bivariate Power Series. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser |
Lower bounds for the bilinear complexity of associative algebras. |
Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
Associative algebras, lower bound, rank, matrix multiplication, substitution method, bilinear complexity |
| 1 | Markus Bläser |
Lower bounds for the multiplicative complexity of matrix multiplication. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
multiplicative complexity, lower bound, Matrix multiplication, substitution method |
| 1 | Markus Bläser |
A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
associative algebras, computational complexity, rank, matrix multiplication, bilinear complexity |
| 1 | Markus Bläser |
Bivariate Polynomial Multiplication. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
multiplicative complexity, polynomial multiplication, bilinear complexity |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")