Konferenzbeiträge

• A. Jakoby, R. Reischuk, C. Schindelhauer
  Circuit Complexity: from the Worst Case to the Average Case
  Proc. 26. ACM Symposium on Theory of Computing STOC, 1994, 58-67
• eingeladener Vortrag: R. Reischuk, M. Liskiewicz
  The Complexity World below Logarithmic Space
  Proc. 9. IEEE Int. Conference on Structure in Complexity Theory, Structures, 1994, 64-78
• A. Jakoby, R. Reischuk, C. Schindelhauer
  The Complexity of Broadcasting in Planar and Decomposable Graphs
  Proc. 14. Int. Workshop on Graph-Theoretic Concepts in Computer Science WG, Springer Lecture Notes in Computer Science, 903, 1995, 219-231
• A. Jakoby, R. Reischuk, C. Schindelhauer, S. Weis
  The Average Case Complexity of the Parallel Prefix Problem
  Proc. 21. Int. Colloquium on Automata, Languages and Programming ICALP, Springer Lecture Notes in Computer Science, 820, 1995, 593-604
• D. Dolev, R. Reischuk, R. Strong
  Observable Clock Synchronization
  Proc. 14. ACM Int. Symposium on Principles of Distributed Computing PODC, 1994, 284-293

Zeitschriftenbeiträge

• M. Dietzfelbinger, M. Kutylowski, R. Reischuk
  Exact Lower Bounds for Computing Boolean Functions on CREW PRAMs,
  Journal of Computer and System Sciences 48, 1994, 231-254
• R. Wiehagen, T. Zeugmann
  Ignoring Data May be the Only Way to Learn Efficiently
  Journal of Experimental & Theoretical Artificial Intelligence 6, 1, 1994, 131 - 144. (Special issue Algorithmic Learning Theory)
• S. Lange, T. Zeugmann
  Characterization of Language Learning from Informant under various Monotonicity Constraints
  Journal of Experimental & Theoretical Artificial Intelligence 6, 1, 1994, 73 - 94. (Special issue Algorithmic Learning Theory