Zwei-Zähler-Automaten mit gekoppelten Bewegungen. - Burchard von Braunmühl (GI Jahrestagung, 1975)

Supercounter Machines. - Burchard von Braunmühl; Eckehart Hotzel (ICALP, 1979)

Finite-Change Automata. - Burchard von Braunmühl; Rutger Verbeek (Theoretical Computer Science, 1979)

A Recognition Algorithm for Deterministic CFLS optimal in Time and Space - Burchard von Braunmühl; Rutger Verbeek (FOCS, 1980)

Input-Driven Languages are Recognized in log n Space. - Burchard von Braunmühl; Rutger Verbeek (FCT, 1983)

The Recognition of Deterministic CFL's in Small Time and Space - Burchard von Braunmühl; Stephen A. Cook; Kurt Mehlhorn; Rutger Verbeek (Inf. Control., 1983)

Alternation for Two-way Machines with Sublogarithmic Space. - Burchard von Braunmühl (STACS, 1993)

The Alternation Hierarchy for Sublogarithmic Space is Infinite. - Burchard von Braunmühl; Romain Gengler; Robert Rettinger (Comput. Complex., 1993)

The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite. - Burchard von Braunmühl; Romain Gengler; Robert Rettinger (STACS, 1994)

Weakly Computable Real Numbers and Total Computable Real Functions. - Robert Rettinger; Xizhong Zheng; Romain Gengler; Burchard von Braunmühl (COCOON, 2001)

Effectively Absolute Continuity and Effective Jordan Decomposability. - Xizhong Zheng; Robert Rettinger; Burchard von Braunmühl (CCA, 2002)

Monotonically Computable Real Numbers. - Robert Rettinger; Xizhong Zheng; Romain Gengler; Burchard von Braunmühl (Math. Log. Q., 2002)

On the Effective Jordan Decomposability. - Xizhong Zheng; Robert Rettinger; Burchard von Braunmühl (STACS, 2003)