Konferenzbeiträge

• R. Karp, S. Shenker, C. Schindelhauer, D. Vöcking
  Randomized Rumor Spreading
  Proc. 41st IEEE Symposium on Foundation on Computer Science (FOCS'00), 2000, 565-574
• C. Schindelhauer
  On the Inapproximability of Broadcasting Time
  Proc. 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'00), Springer Lecture Notes in Computer Science, 1913, 2000, 226-237
• A. Jakoby, M. Liskiewicz, R. Reischuk
  The Expressive Power and Complexity of Dynamic Process Graphs
  Proc. 26. Int. Workshop on Graph-Theoretic Concepts in Computer Science, Springer Lecture Notes in Computer Science, 1928, 230-242
• A. Jakoby and R. Reischuk
  Average Complexity of Unbounded Fanin Circuits
  Proc.11. IEEE Conference on Computational Complexity COMPLEXITY'2000, Florenz, Juli 2000, 170-185
• S. Weis and R. Reischuk
  The Complexity of Physical Mapping with Strict Chimerism
  Proc. 6. Int. Symposium on Computing and Combinatorics COCOON'2000, Sydney, Juli 2000, Springer Lecture Notes in Computer Science 1858, 383-395
• F. Stephan, T. Zeugmann
  Average-Case Complexity of Learning Polynomials
  Proc. 13th Annual Conference on Computational Learning Theory - COLT'2000, Morgan Kaufmann Publisher, (N. Cesa-Bianchi and S. Goldman, Eds.) 59 - 68
• G. Grieser, S. Lange, and T. Zeugmann
  Learning Recursive Concepts with Anomalies
  "Algorithmic Learning Theory, 11th International Conference, ALT 2000, Proceedings," Springer, (Hiroki Arimura, Sanjay Jain and Arun Sharma, Eds.), SpringerLecture Notes in Artificial Intelligence 1968, 101 - 115

Zeitschriftenbeiträge

• M. Bläser
  Lower Bound for the Bilinear Complexity of Associative Algebras.
  Comput. Complextiy, 9, 73-112, 2000
• R. Reischuk
  Can Large Fanin Circuits Perform Reliable Computations in the Presence of Faults?
  Theoretical Computer Science, 240, 2, 2000, 319-335
• R. Reischuk, T. Zeugmann
  An Average-Case Optimal One-Variable Pattern Language Learner
  Journal of Computer and System Sciences 60, 2, 2000, 302 - 335, (Special Issue for COLT'98)
• S. Jain, E. Kinber, S. Lange, R. Wiehagen, T. Zeugmann
  Learning Languages and Functions by Erasing
  Theoretical Computer Science 241, 1/2, 2000, 143 - 189, (Special Issue for ALT'96)

Monografien, Editorium, Buchbeiträge

• M. Bläser
  On the number of multiplications needed to invert a monic power series over fields of characteristic two
  Institut für Informatik II, Universität Bonn, January 2000
• M. Bläser
  Searching for matrix multiplication algorithms by numerical minimization
  Institut für Informatik II, Universität Bonn, January 2000