Konferenzbeiträge

• T. Zeugmann
  Can Learning in the Limit Be Done Efficiently?
  Proc. 14th International Conference on Algorithmic Learning Theory (ALT 2003), Ricard Gavaldà, Klaus P. Jantke and Eiji Takimoto, Eds., LNAI 2842, Springer 2003, 17-38
• J. Case, S. Jain, R. Reischuk, F. Stephan, T. Zeugmann
  Learning a Subclass of Regular Patterns in Polynomial Time.
  Proc. 14th International Conference on Algorithmic Learning Theory (ALT 2003), (Ricard Gavaldà, Klaus P. Jantke and Eiji Takimoto, Eds.), LNAI 2842, Springer 2003, 234-246
• J. Arpe, R. Reischuk
  Robust Inference of Relevant Attributes
  Proc. 14th International Conference on Algorithmic Learning Theory (ALT 2003), (Ricard Gavaldà, Klaus P. Jantke and Eiji Takimoto, Eds.), LNAI 2842, Springer 2003, 99-113
• A. Jakoby, M. Liskiewicz, R. Reischuk
  Private Computation in Networks: Topology versus Randomness
  Proc. 19th Int. Symp. on Theoret. Aspect of Comput. Sci. (STACS 2003),LNCS 2607, Springer 2003, 121-132
• M. Bläser, B. Manthey
  Budget Balanced Mechanisms for the Multicast Pricing Problem with Rates
  Proc. 4th ACM Conf. on Electronic Commerce 2003, 194-195
• M. Bläser
  Algebras of Minimal Rank over Arbitrary Fields
  Proc. 19th Int. Symp. on Theoret. Aspect of Comput. Sci. (STACS 2003),LNCS 2607, Springer 2003, 403-414
• M. Bläser
  A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality
  Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2003), 639-647
• J. Arpe, A. Jakoby, and M. Liskiewicz
  One-Way Communication Complexity of Symmetric Boolean Functions
  Proc. 14th International Symposium on Fundamentals of Computation Theory (FCT 2003), LNCS 2751, Springer 2003, 158-170
• B. Manthey, R. Reischuk
  The Intractability of Computing the Hamming Distanc
  Proc. 14th Ann. Int. Symp. on Algorithms and Computation (ISAAC 2003), LNCS 2906, Springer 2003, 88-97
• F. J. Balbach
  Changing the Inference Type - Keeping the Hypothesis Space
  Proc. 14th International Conference on Algorithmic Learning Theory (ALT 2003), (Ricard Gavaldà, Klaus P. Jantke and Eiji Takimoto, Eds.), LNAI 2842, Springer 2003, 84 - 98

Zeitschriftenbeiträge

• S. Jain, E. B. Kinber, R. Wiehagen, T. Zeugmann
  On learning of functions refutably
  Theor. Comput. Sci. 298 (2003), 111-143
• M. Böhme, B. Manthey
  The Computational Power of Compiling C++
  Bulletin of the European Association for Theoretical Computer Science (EATCS), 81, 2003, 264-270
• M. Liskiewicz, M. Ogihara, and S. Toda
  Counting Self-avoiding Walks in Some Regular Graphs
  SIGACT News, Volume 34(3), 2003, 26-39
• M. Liskiewicz, M. Ogihara, and S. Toda
  The Complexity of Counting Self-avoiding Walks in Subgraphs of Two-dimensional Grids and Hypercubes
  Theoretical Computer Science, 304 (2003), 129-156
• M. Bläser
  On the Complexity of the Multiplication of Matrices of Small Formats
  J. Complexity, 19, 2003, 43-60
• M. Bläser
  The complexity of bivariate power series arithmetic
  Theor. Comput. Sci. 1-3, 2003, 65-83
• M. Bläser
  Computing Small Partial Coverings
  Inform. Proc. Letters, 85(6) 2003, 327-332
• B. Manthey
  Non-approximability of Weighted Multiple Sequence Alignment
  Theoretical Computer Science, 296(1)2003,179-192

Monografien, Editorium, Buchbeiträge

• R. Reischuk
  Planung und Realisation von Informationssystemen: Algorithmische Komplexität
  Taschenbuch der Wirtschaftsinformatik und Wirtschaftsmathematik,Harri Deutsch Verlag, 2003,Kap. 6.2, 246-252
• H. Beilner, H. Fiedler, M. Gross, O. Günther, S. Hölldobler, G. Hotz, K. Löhr, R. Reischuk, D. Wagner (Ed.)
  Ausgezeichnete Informatikdissertationen 2002
  Lecture Notes in Informatics, Gesellschaft für Informatik, 2003