Erweiterungen subrekursiver Programmiersprachen. - Rutger Verbeek (Automatentheorie und Formale Sprachen, 1973)

The Influence of the Data Presentation on the Computational POwer of Machines. - Rutger Verbeek; Klaus Weihrauch (MFCS, 1976)

Data Representation and Computational Complexity. - Rutger Verbeek; Klaus Weihrauch (Theor. Comput. Sci., 1978)

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)

Time-Space Trade-Offs for General Recursion - Rutger Verbeek (FOCS, 1981)

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)

There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator - Marek Karpinski; Rutger Verbeek (Inf. Control., 1985)

On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation - Marek Karpinski; Rutger Verbeek (Inf. Control., 1986)

Randomness, Provability, and the Seperation of Monte Carlo Time and Space. - Marek Karpinski; Rutger Verbeek (Computation Theory and Logic, 1987)

On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes - Marek Karpinski; Rutger Verbeek (Inf. Comput., 1987)

On Randomized versus Deterministic Computation. - Marek Karpinski; Rutger Verbeek (Theor. Comput. Sci., 1996)

Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. - Robert Rettinger; Rutger Verbeek (FCT, 2001)