Konferenzbeiträge

• N. Abe, R. Khardon, T. Zeugmann
  Algorithmic Learning Theory
  Proc. 12th Int. Conf. Algorithmic Learning Theory, (ALT 2001) (Naoki Abe, Roni Khardon and Thomas Zeugmann, Eds.), Springer Lecture Notes in Artificial Intelligence, 2225, 2001, Editors' Introduction. 1-8
• T. Zeugmann
  Stochastic Finite Learning (invited lecture)
  in ``Stochastic Algorithms: Foundations and Applications, International Symposium SAGA 2001, Berlin, Germany, December 13-14, 2001, Proceedings,'' (Kathleen Steinhöfel, Ed.), Lecture Notes in Computer Science 2264, Springer, 2001, 155 - 171
• A. Jakoby, C. Schindelhauer
  Efficient Addition on Field Programmable Gate Arrays
  21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), 2001, 219-231
• M. Bläser
  A 2.5 n²-lower bound for the multiplicative complexity of n x n-matrix multiplication
  Proc. 18th Int. GI-MIMD Symp. on Theoretical Aspects of Computer Science (STACS 2001), Springer Lectures Notes in Computer Science 2010, 2001, 99-110
• A. Jakoby, M. Liskiewicz, R. Reischuk
  Space Efficient Algorithms for Series-Parallel Graphs
  Proc. 18th Int. GI-MIMD Symp. on Theoretical Aspects of Computer Science (STACS 2001), Springer Lectures Notes in Computer Science 2010, 2001, 339-352
• B. Siebert
  Non-Approximability of Weighted Multiple Sequence Alignment
  Proc. 7th Computing and Combinatorics Conference (COCOON 2001), Springer Lecture Notes of Computer Science 2108, 2001, 75-85
• M. Bläser, B. Siebert
  Computing Cycle Covers without Short Cycles
  Proc. 9th European Symposium on Algorithms (ESA 2001), Springer Lecture Notes of Computer Science, 2161, 2001, 368-379
• M. Bläser
  Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical
  Proc. 28th Int. EATCS Coll. on Automata, Languages, and Programming (ICALP 2001), Springer Lecture Notes in Computer Science 2076, 2001, 79-91
• M. Bläser
  Complete Problems for Valiant's Class of qp-computable Families of Polynomials
  Proc. 7th Ann. Int. Computing and Combinatorics Conf. (COCOON 2001), Springer Lecture Notes in Computer Science 2108, 2001, 1-10
• M. Bläser
  Computing Reciprocals of Bivariate Power Series
  Proc. 26th Int. Symp. on Mathematical Foundations of Comput. Sci. (MFCS 2001), Springer Lecture Notes in Computer Science 2136, 2001, 186-197
• S. Jain, E. Kinber, R. Wiehagen, T. Zeugmann
  Learning Recursive Functions Refutably
  Proc. 12th Int. Conf. Algorithmic Learning Theory, (ALT 2001) (Naoki Abe, Roni Khardon and Thomas Zeugmann, Eds.), Springer Lecture Notes in Artificial Intelligence, 2225, 2001, 283 - 298
• A. Jakoby, M. Liskiewicz
  The Complexity of Some Basic Problems for Dynamic Process Graphs
  Proc. 12th Annual Int. Symposium on Algorithms and Computation (ISAAC 2001), LNCS, Springer-Verlag 2001, 562-574

Zeitschriftenbeiträge

• P. Rossmanith, T. Zeugmann
  Stochastic Finite Learning of the Pattern Languages
  Machine Learning Vol. 44, No. 1/2, 2001, 67-91. (Special Issue on Automata Induction, Grammar Inference, and Language Acquisition).
• T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, T. Zeugmann
  Learning One-Variable Pattern Languages very Efficiently on Average, in Parallel, and by Asking Queries
  Theoretical Computer Science 261, 1, 2001, 119-156. (Special Issue for ALT'97)
• A. Jakoby, M. Liskiewicz, R. Reischuk
  Approximating Schedules for Dynamic Graphs Efficiently
  Journal of Discrete Algorithms, to appear.
• R. Wiehagen, T. Zeugmann
  Foreword
  Theor. Comput. Sci. 268,2, 2001: 175-177

Monografien, Editorium, Buchbeiträge

• H. Fiedler, W. Grass, O. Günther, S. Hölldobler, G. Hotz, R. Reischuk, B. Seeger, D. Wagner, Hrs.
  Ausgezeichnete Informatikdissertationen 2000
  Lecture Notes in Informatics, Gesellschaft für Informatik, 2001
• Guest Editors: R. Wiehagen, T. Zeugmann
  Algorithmic Learning Theory,
  Special Issue in Theoretical Computer Science A, 268, 2, 2001
• N. Abe, R. Khardon, T. Zeugmann (Eds.)
  Algorithmic Learning Theory,
  12th Int. Conf. ALT 2001, Proceedings, Springer Lecture Notes in Artificial Intelligence 2225, 2001