Burchard von Braunmühl

14 papers A* 2A 3B 1C 1Misc 1Journal 3Unranked 3
YearRankTypeTitle / Venue / Authors
2003 A conf
On the Effective Jordan Decomposability.
STACS
Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
2002 C conf
Effectively Absolute Continuity and Effective Jordan Decomposability.
CCA
Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
2002 J jnl
Monotonically Computable Real Numbers.
Math. Log. Q.
Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
2001 — conf
Monotonically Computable Real Numbers.
DMTCS
Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
2001 Misc conf
Weakly Computable Real Numbers and Total Computable Real Functions.
COCOON
Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
1994 A conf
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.
STACS
Burchard von Braunmühl, Romain Gengler, Robert Rettinger
1993 A conf
Alternation for Two-way Machines with Sublogarithmic Space.
STACS
Burchard von Braunmühl
1993 J jnl
The Alternation Hierarchy for Sublogarithmic Space is Infinite.
Comput. Complex.
Burchard von Braunmühl, Romain Gengler, Robert Rettinger
1983 B conf
Input-Driven Languages are Recognized in log n Space.
FCT
Burchard von Braunmühl, Rutger Verbeek
1983 J jnl
The Recognition of Deterministic CFL's in Small Time and Space
Inf. Control.
Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek
1980 A* conf
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space
FOCS
Burchard von Braunmühl, Rutger Verbeek
1979 — conf
Finite-Change Automata.
Theoretical Computer Science
Burchard von Braunmühl, Rutger Verbeek
1979 A* conf
Supercounter Machines.
ICALP
Burchard von Braunmühl, Eckehart Hotzel
1975 — conf
Zwei-Zähler-Automaten mit gekoppelten Bewegungen.
GI Jahrestagung
Burchard von Braunmühl