Konferenzbeiträge

• A. Jakoby, M. Liskiewicz, R. Reischuk
  Scheduling Dynamic Graphs
  Proc. 16. Symposium on Theoretical Aspects of Computer Science STACS '99, Springer Lecture Notes in Computer Science 1563, 1999, 383-392
• R. Reischuk, T. Zeugmann
  A Complete and Tight Average-Case Analysis of Learning Monomials
  Proc. 16. Symposium on Theoretical Aspects of Computer Science STACS '99, Springer Lecture Notes in Computer Science, 1563, 1999, 397-406
• A. Jakoby
  The Average Time Complexity to Compute Prefix Functions in Processor Networks
  Proc. 16. Symposium on Theoretical Aspects of Computer Science STACS '99, Springer Lecture Notes in Computer Science 1563, 1999, 78-89
• C. Schindelhauer, A. Jakoby
  The Non-Recursive Power of Erroneous Computation
  Proc. 19. Conference on Foundations of Software Technology and Theoretical Computer Science FST & TCS'99, Springer Lecture Notes in Computer Science, 1738, 394-406
• F. Stephan, T. Zeugmann
  On the Uniform Learnability of Approximations to Non-Recursive Functions
  Proc. 10th Int. Conference on Algorithmic Learning Theory - ALT'99, (O. Watanabe and T. Yokomori, Eds.) Springer Lecture Notes in Artificial Intelligence 1720, 276 - 290
• M. Bläser
  A 2.5 n²-lower bound for the rank of n x n-matrix multiplication over arbitrary fields
  Proc. 40. IEEE Symposium on Foundations of Computer Sciences FOCS'99, 45-50

Zeitschriftenbeiträge

• A. Jakoby, R. Reischuk, C. Schindelhauer
  Malign Distributions for Average Case Circuit Complexity
  Information & Computation 150, 1999, 187-208
• M. Liskiewicz, R. Reischuk
  On Small Space Complexity Classes of Stochastic Turing Machines and Arthur-Merlin-Games
  Computational Complexity 8, 1999, 273-307
• J. Case, S. Jain, S. Lange and T. Zeugmann
  Incremental Concept Learning for Bounded Data Mining
  Information & Computation 152, 1, 1999, 74-110
• M. Bläser
  Lower bounds for the multiplicative complexity of matrix multiplication
  Computational Complexity 8, 1999, 203-226

Monografien, Editorium, Buchbeiträge

• H. Fiedler, P. Gorny, W. Grass, S. Hölldobler, G. Hotz, R. Reischuk, (Hrsg)
  Ausgezeichnete Informatikdissertationen 1998
  Teubner Verlag, Stuttgart, 1999
• D. Barrington, R. Reischuk, I. Wegener, (Hrsg)
  Dagstuhl Seminar No. 99441: Complexity of Boolean Functions
  Int. Begegnungs- und Forschungszentrum für Informatik IBFI, Schloss Dagstuhl, 1999
• A. Jakoby, M. Liskiewicz, R. Reischuk
  On Dynamic Process Graphs
  D. Barrington, R. Reischuk, I. Wegener, (Hrsg) Dagstuhl Seminar No. 99441: Complexity of Boolean Functions, Int. Begegnungs- und Forschungszentrum für Informatik IBFI, Schloss Dagstuhl, 1999

Forschungsberichte

• F. Stephan, T. Zeugmann
  Learning Classes of Approximations to Non-Recursive Function
  DOI Technical Report DOI-TR-166, Department of Informatics, Kyushu University, July 1999