 | 2003 |
|---|
| 13 |       | Xizhong Zheng,
Robert Rettinger,
Burchard von Braunmühl:
On the Effective Jordan Decomposability.
STACS 2003: 167-178 |
| 2002 |
|---|
| 12 | | Xizhong Zheng,
Robert Rettinger,
Burchard von Braunmühl:
Effectively Absolute Continuity and Effective Jordan Decomposability.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 11 | | Robert Rettinger,
Xizhong Zheng,
Romain Gengler,
Burchard von Braunmühl:
Monotonically Computable Real Numbers.
Math. Log. Q. 48(3): 459-479 (2002) |
| 2001 |
|---|
| 10 | | Robert Rettinger,
Xizhong Zheng,
Romain Gengler,
Burchard von Braunmühl:
Weakly Computable Real Numbers and Total Computable Real Functions.
COCOON 2001: 586-595 |
| 1994 |
|---|
| 9 | | Burchard von Braunmühl,
Romain Gengler,
Robert Rettinger:
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.
STACS 1994: 85-96 |
| 1993 |
|---|
| 8 | | Burchard von Braunmühl:
Alternation for Two-way Machines with Sublogarithmic Space.
STACS 1993: 5-15 |
| 7 |  | Burchard von Braunmühl,
Romain Gengler,
Robert Rettinger:
The Alternation Hierarchy for Sublogarithmic Space is Infinite.
Computational Complexity 3: 207-230 (1993) |
| 1983 |
|---|
| 6 | | Burchard von Braunmühl,
Rutger Verbeek:
Input-Driven Languages are Recognized in log n Space.
FCT 1983: 40-51 |
| 5 | | Burchard von Braunmühl,
Stephen Cook,
Kurt Mehlhorn,
Rutger Verbeek:
The Recognition of Deterministic CFL's in Small Time and Space
Information and Control 56(1/2): 34-51 (1983) |
| 1980 |
|---|
| 4 | | Burchard von Braunmühl,
Rutger Verbeek:
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space
FOCS 1980: 411-420 |
| 1979 |
|---|
| 3 | | Burchard von Braunmühl,
Eckehart Hotzel:
Supercounter Machines.
ICALP 1979: 58-72 |
| 2 | | Burchard von Braunmühl,
Rutger Verbeek:
Finite-Change Automata.
Theoretical Computer Science 1979: 91-100 |
| 1975 |
|---|
| 1 | | Burchard von Braunmühl:
Zwei-Zähler-Automaten mit gekoppelten Bewegungen.
GI Jahrestagung 1975: 280-289 |
