Burchard von Braunmühl

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Monotonically Computable Real Numbers.

[BibT_eX]

[DOI]

Math. Log. Q., 2002

Effectively Absolute Continuity and Effective Jordan Decomposability.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

2001

Weakly Computable Real Numbers and Total Computable Real Functions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1994

The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1993

The Alternation Hierarchy for Sublogarithmic Space is Infinite.

[BibT_eX]

[DOI]

Comput. Complex., 1993

Alternation for Two-way Machines with Sublogarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

1983

The Recognition of Deterministic CFL's in Small Time and Space

[BibT_eX]

[DOI]

Stephen A. Cook

Kurt Mehlhorn

Inf. Control., 1983

Input-Driven Languages are Recognized in log n Space.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1980

A Recognition Algorithm for Deterministic CFLS optimal in Time and Space

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Finite-Change Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

Supercounter Machines.

[BibT_eX]

[DOI]

Eckehart Hotzel

Proceedings of the Automata, 1979

1975

Zwei-Zähler-Automaten mit gekoppelten Bewegungen.

[BibT_eX]

[DOI]