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