The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rutger Verbeek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002