50 Jahre Uni Lübeck

Institut für Theoretische Informatik

Publikationen 2002


  • A. Jakoby, M. Liskiewicz
    Paths Problems in Symmetric Logarithmic Space.
    Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP 2002), LNCS 2380, Springer 2002, 269-280.
  • M. Bläser, B. Manthey
    Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.
    Proc. of the 13th Ann. Int. Symp. on Algorithms and Computation (ISAAC 2002), LNCS 2518, Springer 2002, 187-198.
  • M. Bläser, B. Manthey
    Two Approximation Algorithms for 3-Cycle Cover
    Proc. of the 5th Int. Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), LNCS 2462, Springer 2002, 40-50.
  • M. Bläser, A. Jakoby, M. Liskiewicz, B. Siebert
    Private Computation - k-connected versus 1-connected Networks
    Proc. of the 22nd Ann. Int. Cryptology Conf. (CRYPTO 2002), Springer Lecture Notes in Computer Science 2442, Springer, 2002, 194-209.
  • M. Bläser
    A 8/13-approximation algorithm for the asymmetric maximum TSP
    Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), 2002, 64-73
  • M. Bläser
    Algebras of minimal rank over perfect fields
    Proc. 17th Ann. IEEE Computational Complexity Conference (CCC 2002),113-122


  • M. Bläser
    Uniform Computational Complexity of the Derivatives of Coo-Functions
    Theoretical Computer Science, 284(2) 2002, 199-205
  • M. Liskiewicz, M. Ogihara, S. Toda
    The Complexity of Counting Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.
    Theoretical Computer Science, 2002, to appear
  • M. Bläser, P. Kirrinnis, D. Lauer
    On the multiplicative complexity of the inversion and division of Hamiltonian quaternions
    Found. Comput. Math., 2, 2002, 191-199
  • F. Stephan, T. Zeugmann
    Learning Classes of Approximations to Non-Recursive Functions
    Theoretical Computer Science 288, 2, 2002, 309-341
  • A. Jakoby, M. Liskiewicz, R. Reischuk
    Space Efficient Algorithms for Directed Series-Parallel Graphs
    ECCC TR 02-021, 2002

Monografien, Editorium, Buchbeiträge

  • N. Cesa-Bianchi, M. Numao, R. Reischuk
    Proc. of the 13. Int. Conference on Algorithmic Learning Theory,
    ALT 2002,Springer 2002, LNCS 2533
  • H. Beilner, H. Fiedler, O. Günther, S. Hölldobler, G. Hotz, P. Liggesmeyer, K. Löhr, R. Reischuk, D. Wagner
    Ausgezeichnete Informatikdissertationen 2001
    Lecture Notes in Informatics, Gesellschaft für Informatik, 2002
  • R. Reischuk
    Average-case Computational Complexity
    Encyclopaedia of Mathematics, Suppl. III (M. Hazewinkel Ed.), Kluwer Academic Publishers, 2002, 49-52