 | 2001 |
|---|
| 16 |       | Robert Rettinger,
Rutger Verbeek:
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.
FCT 2001: 311-322 |
| 1996 |
|---|
| 15 | | Marek Karpinski,
Rutger Verbeek:
On Randomized versus Deterministic Computation.
Theor. Comput. Sci. 154(1): 23-39 (1996) |
| 1995 |
|---|
| 14 | | Marek Karpinski,
Rutger Verbeek:
On Randomized Versus Deterministic Computation
Electronic Colloquium on Computational Complexity (ECCC) 2(21): (1995) |
| 1993 |
|---|
| 13 | | Marek Karpinski,
Rutger Verbeek:
On Randomized Versus Deterministic Computation.
ICALP 1993: 227-240 |
| 1987 |
|---|
| 12 |  | Marek Karpinski,
Rutger Verbeek:
Randomness, Provability, and the Seperation of Monte Carlo Time and Space.
Computation Theory and Logic 1987: 189-207 |
| 11 | | Marek Karpinski,
Rutger Verbeek:
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes
Inf. Comput. 75(2): 178-189 (1987) |
| 1986 |
|---|
| 10 | | Marek Karpinski,
Rutger Verbeek:
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation
Information and Control 71(1/2): 131-142 (1986) |
| 1985 |
|---|
| 9 | | Marek Karpinski,
Rutger Verbeek:
There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator
Information and Control 67(1-3): 158-162 (1985) |
| 1983 |
|---|
| 8 | | Burchard von Braunmühl,
Rutger Verbeek:
Input-Driven Languages are Recognized in log n Space.
FCT 1983: 40-51 |
| 7 | | Burchard von Braunmühl,
Stephen Cook,
Kurt Mehlhorn,
Rutger Verbeek:
The Recognition of Deterministic CFL's in Small Time and Space
Information and Control 56(1/2): 34-51 (1983) |
| 1981 |
|---|
| 6 | | Rutger Verbeek:
Time-Space Trade-Offs for General Recursion
FOCS 1981: 228-234 |
| 1980 |
|---|
| 5 | | Burchard von Braunmühl,
Rutger Verbeek:
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space
FOCS 1980: 411-420 |
| 1979 |
|---|
| 4 | | Burchard von Braunmühl,
Rutger Verbeek:
Finite-Change Automata.
Theoretical Computer Science 1979: 91-100 |
| 1978 |
|---|
| 3 | | Rutger Verbeek,
Klaus Weihrauch:
Data Representation and Computational Complexity.
Theor. Comput. Sci. 7: 99-116 (1978) |
| 1976 |
|---|
| 2 | | Rutger Verbeek,
Klaus Weihrauch:
The Influence of the Data Presentation on the Computational POwer of Machines.
MFCS 1976: 551-558 |
| 1973 |
|---|
| 1 | | Rutger Verbeek:
Erweiterungen subrekursiver Programmiersprachen.
Automatentheorie und Formale Sprachen 1973: 311-318 |
