Rutger Verbeek

16 papers A* 3B 3Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2001 B conf
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.
FCT
Robert Rettinger, Rutger Verbeek
1996 J jnl
On Randomized versus Deterministic Computation.
Theor. Comput. Sci.
Marek Karpinski, Rutger Verbeek
1995 J jnl
On Randomized Versus Deterministic Computation
Electron. Colloquium Comput. Complex.
Marek Karpinski, Rutger Verbeek
1993 A* conf
On Randomized Versus Deterministic Computation.
ICALP
Marek Karpinski, Rutger Verbeek
1987 J jnl
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes
Inf. Comput.
Marek Karpinski, Rutger Verbeek
1987 — conf
Randomness, Provability, and the Seperation of Monte Carlo Time and Space.
Computation Theory and Logic
Marek Karpinski, Rutger Verbeek
1986 J jnl
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation
Inf. Control.
Marek Karpinski, Rutger Verbeek
1985 J jnl
There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator
Inf. Control.
Marek Karpinski, Rutger Verbeek
1983 B conf
Input-Driven Languages are Recognized in log n Space.
FCT
Burchard von Braunmühl, Rutger Verbeek
1983 J jnl
The Recognition of Deterministic CFL's in Small Time and Space
Inf. Control.
Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek
1981 A* conf
Time-Space Trade-Offs for General Recursion
FOCS
Rutger Verbeek
1980 A* conf
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space
FOCS
Burchard von Braunmühl, Rutger Verbeek
1979 — conf
Finite-Change Automata.
Theoretical Computer Science
Burchard von Braunmühl, Rutger Verbeek
1978 J jnl
Data Representation and Computational Complexity.
Theor. Comput. Sci.
Rutger Verbeek, Klaus Weihrauch
1976 B conf
The Influence of the Data Presentation on the Computational POwer of Machines.
MFCS
Rutger Verbeek, Klaus Weihrauch
1973 — conf
Erweiterungen subrekursiver Programmiersprachen.
Automatentheorie und Formale Sprachen
Rutger Verbeek