BTU auf einen Blick
Fakultät 1
Lehrstuhl Theoretische Informatik Prof. Dr.rer.nat. habil. Klaus Meer

Publikationen von R. Gengler

  • X. Zheng, R. Rettinger and R. Gengler: Closure properties of real numbers classes under CBV functions. Theory of Computing Systems, 38, pp 701-729, 2005.
  • X. Zheng, R. Rettinger, and R. Gengler: Ershov’s hierarchy of real numbers. MFCS 2003 August 25 - 29, 2003 , Bratislava Slovak Republic, LNCS 2747, pp 681-690,  Springer 2003.
  • R. Rettinger, X. Zheng, R. Gengler and B. von Braunmühl: Monotonically computable real numbers. Mathematical Logic Quarterly 48(2002), no 3, pp459–479, 2002.
  • R. Rettinger, X. Zheng, R. Gengler and B. von Braunmühl: Monotonically computable real numbers. DMTCS01 July 2-6, , Constantza, Romania, 2001.
  • R. Rettinger, X. Zheng, R. Gengler and B. von Braunmühl: Weakly computable real numbers and total computable real functions. COCOON01 August 2001, Guilin, China. LNCS 2108. pp586-595, 2001.
  • von Braunmuhl and Gengler and Rettinger: The Alternation Hierarchy for Sublogarithmic Space is Infinite  Computational Complexity, Vol. 3, pp207-230, 1993
  • B. von Braunmuhl and R. Gengler and R. Rettinger: The Alternation Hierarchy for Machines with Sublogarithmic Space Is Infinite. STACS 1994, Lecture Notes in Computer Science, Vol. 775, p. 85-94, 1994.
  • R. Gengler: Multicounter automata with sublogarithmic reversal bounds, STACS 1993, Lecture Notes in Computer Science, Vol. 665, pp. 408-417, 1993.
  • P. Gengler: Reversalkomplexität von Mehrbandautomaten unterhalb log, Doktorarbeit, Informatik Berichte Universität Bonn Nr. 84, 1991.
  • R. Gengler: Deterministische Reset-Automaten, Diplomarbeit, Bonn 1984.