The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Markus Bläser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Bläser
    A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:61-71 [Conf]
  2. Markus Bläser, Bodo Manthey
    Two Approximation Algorithms for 3-Cycle Covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:40-50 [Conf]
  3. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-private Environments. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:137-151 [Conf]
  4. Markus Bläser
    Algebras of Minimal Rank over Perfect Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:113-122 [Conf]
  5. Markus Bläser
    Complete Problems for Valiant's Class of qp-Computable Families of Polynomials. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:1-10 [Conf]
  6. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
    Private Computation - k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:194-209 [Conf]
  7. Markus Bläser, Bodo Siebert
    Computing Cycle Covers without Short Cycles. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:368-379 [Conf]
  8. Markus Bläser, L. Shankar Ram
    An Improved Approximation Algorithm for TSP with Distances One and Two. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:504-515 [Conf]
  9. Markus Bläser
    Bivariate Polynomial Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:186-191 [Conf]
  10. Markus Bläser
    A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:45-50 [Conf]
  11. Markus Bläser
    Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:79-91 [Conf]
  12. Markus Bläser
    An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:157-163 [Conf]
  13. Markus Bläser, Bodo Manthey
    Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:187-198 [Conf]
  14. Markus Bläser
    Computing Reciprocals of Bivariate Power Series. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:186-197 [Conf]
  15. Markus Bläser, Bodo Manthey
    Budget balanced mechanisms for the multicast pricing problem with rates. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:194-195 [Conf]
  16. Markus Bläser
    An 8/13-approximation algorithm for the asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:64-73 [Conf]
  17. Markus Bläser
    A new approximation algorithm for the asymmetric TSP with triangle inequality. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:638-645 [Conf]
  18. Markus Bläser
    Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:625-626 [Conf]
  19. Markus Bläser
    A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:99-109 [Conf]
  20. Markus Bläser
    Algebras of Minimal Rank over Arbitrary Fields. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:403-414 [Conf]
  21. Markus Bläser, L. Shankar Ram, Maxim Sviridenko
    Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:350-359 [Conf]
  22. Markus Bläser, L. Shankar Ram
    Approximate Fair Cost Allocation in Metric Traveling Salesman Games. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:82-95 [Conf]
  23. Markus Bläser, Bodo Manthey
    Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:121-139 [Journal]
  24. Markus Bläser
    Lower bounds for the bilinear complexity of associative algebras. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:2, pp:73-112 [Journal]
  25. Markus Bläser
    Lower bounds for the multiplicative complexity of matrix multiplication. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:203-226 [Journal]
  26. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation - k-connected versus 1-connected Networks [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:009, pp:- [Journal]
  27. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-Private Environments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:071, pp:- [Journal]
  28. Markus Bläser
    On the Multiplicative Complexity of the Inversion and Division of Hamiltonian Quaternions. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2002, v:2, n:2, pp:191-199 [Journal]
  29. Markus Bläser
    Computing small partial coverings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:327-331 [Journal]
  30. Markus Bläser
    An 8/13-approximation algorithm for the asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:23-48 [Journal]
  31. Markus Bläser
    On the complexity of the multiplication of matrices of small formats. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2003, v:19, n:1, pp:43-60 [Journal]
  32. Markus Bläser
    On the number of multiplications needed to invert a monic power series over fields of characteristic two. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:413-419 [Journal]
  33. Markus Bläser, Bodo Manthey, Jiri Sgall
    An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:623-632 [Journal]
  34. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation: k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:3, pp:341-357 [Journal]
  35. Markus Bläser
    A Complete Characterization of the Algebras of Minimal Bilinear Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:277-298 [Journal]
  36. Markus Bläser
    Uniform computational complexity of the derivatives of Cinfinity-functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:2, pp:199-206 [Journal]
  37. Markus Bläser
    The complexity of bivariate power series arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:65-83 [Journal]
  38. Markus Bläser
    Beyond the Alder-Strassen bound. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:3-21 [Journal]
  39. Markus Bläser, Holger Dell
    Complexity of the Cover Polynomial. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:801-812 [Conf]
  40. Markus Bläser, Andreas Meyer de Voltaire
    Semisimple Algebras of Almost Minimal Rank over the Reals. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:669-680 [Conf]
  41. Markus Bläser, Christian Hoffmann
    On the Complexity of the Interlace Polynomial [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  42. Complexity of the Bollobás-Riordan Polynomial. [Citation Graph (, )][DBLP]


  43. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]


  44. Approximating Multi-criteria Max-TSP. [Citation Graph (, )][DBLP]


  45. Asymptotically Optimal Hitting Sets Against Polynomials. [Citation Graph (, )][DBLP]


  46. On the Complexity of the Interlace Polynomial. [Citation Graph (, )][DBLP]


  47. Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity. [Citation Graph (, )][DBLP]


  48. Approximating Multi-Criteria Max-TSP [Citation Graph (, )][DBLP]


  49. Fast computation of interlace polynomials on graphs of bounded treewidth [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002