Rutger Verbeek

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

1996

On Randomized versus Deterministic Computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1987

On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes

[BibT_eX]

[DOI]

Inf. Comput., November, 1987

Randomness, Provability, and the Seperation of Monte Carlo Time and Space.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation

[BibT_eX]

[DOI]

Inf. Control., 1986

1985

There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator

[BibT_eX]

[DOI]

Inf. Control., 1985

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

1981

Time-Space Trade-Offs for General Recursion

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

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

1978

Data Representation and Computational Complexity.

[BibT_eX]

[DOI]

Klaus Weihrauch

Theor. Comput. Sci., 1978

1976

The Influence of the Data Presentation on the Computational POwer of Machines.

[BibT_eX]

[DOI]

Klaus Weihrauch

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1973

Erweiterungen subrekursiver Programmiersprachen.

[BibT_eX]

[DOI]