50 Jahre Uni Lübeck

Institut für Theoretische Informatik

Publikationen 2005


  • M. Hinkelmann, A. Jakoby
    Communications in Unknown Networks: Preserving the Secret of Topology
    Proc. 12th Int. Colloquium (SIROCCO 2005), LNCS 3499, Springer-Verlag 2005, 155-169
  • M. Liskiewicz, U.Wölfel
    On the Intractability of Inverting Geometric Distortions in Watermarking Schemes
    Proc. 7th Information Hiding Workshop (IH 2005), LNCS 3727, Springer-Verlag 2005, 176-188
  • A. Jakoby, M. Liskiewicz
    Revealing Additional Information in Two-party Computations
    Proc. of the 11th Ann. Int. Conf. on the Theory and Application of Cryptology and Information Security ASIACRYPT, LNCS 3788, Springer-Verlag 2005, 121-135
  • F. J. Balbach, T. Zeugmann
    Teaching Learners with Restricted Mind Changes
    Proc. of the 16th Int. Conference on Algorithmic Learning Theory (ALT 2005), S. Jain, H. U. Simon, and E. Tomita (Eds.), LNAI 3734, Springer-Verlag 2005, 474-489
  • B. Manthey, R. Reischuk
    Smoothed Analysis of Binary Search Trees
    Proc. of the 16th Ann. Int. Symposium on Algorithms and Computation (ISAAC 2005), Lecture Notes in Computer Science 3827, 483-492
  • H. Völzer
    On Conspiracies and Hyperfairness in Distributed Computing
    Proc. of the 19th Int. Symposium on Distributed Computing (DISC 2005), LNCS 3724, Springer Verlag 2005, 33-47
  • H. Völzer, D. Varacca, E. Kindler
    Defining Fairness
    Proc. of the 16th Int. Conference on Concurrency Theory (CONCUR 2005), LNCS 3653, Springer-Verlag 2005, 458-472, ausgezeichnet mit dem "Best Paper Award CONCUR 2005"
  • F. J. Balbach
    Teaching Classes with High Teaching Dimension Using Few Examples
    P. Auer and R. Meir (Eds.)
    Proc. of the 18th Annual Conference on Learning Theory (COLT 2005), LNAI 3559, Springer-Verlag 2005, 668 - 683


  • J. Arpe, A. Jakoby, M. Liskiewicz
    One-way Communication Complexity of Symmetric Boolean Functions
    Theoretical Informatics and Applications, 39,2005, 687-706
  • M. Bläser, B. Manthey
    Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
    Algorithmica, 42(2), 2005, 121-139
  • B. Manthey
    Non-Approximability of Weighted Multiple Sequence Alignment for Arbitrary Metrics
    Information Processing Letters, Vol. 95, No. 3, 2005, 389-395
  • B. Manthey, R. Reischuk
    The Intractability of Computing the Hamming Distance
    Theoretical Computer Science 337(1-3) 2005, 331-346
  • M. Bläser
    Beyond the Alder-Strassen Bound
    Theoretical Computer Science 331(1), 2005, 3-21

Monografien, Editorium, Buchbeiträge

  • M. Liskiewicz, R. Reischuk (Ed.)
    Fundamentals of Computation Theory , 15th International Symposium, Proceedings, LNCS 3623, Springer-Verlag 2005
  • T. Dreier, O. Günther, S. Hölldobler, K. Löhr, P. Molitor, R. Reischuk, D. Saupe, D. Wagner
    Ausgezeichnete Informatikdissertationen 2004
    Lecture Notes in Informatics, Gesellschaft für Informatik, 2005


  • F. J. Balbach, T.Zeugmann
    Teaching Learners that can only Perform Restricted Mind Changes
    TCS Technical Report TCS-TR-A-05-5, Division of Computer Science, Report Series A, Hokkaido University, Graduate School of Information Science and Technology, July 18, 2005