default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRutger Verbeek
Person information
- affiliation: University of Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[c9]Robert Rettinger, Rutger Verbeek:
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case. FCT 2001: 311-322
1990 – 1999
- 1996
- [j6]Marek Karpinski, Rutger Verbeek:
On Randomized versus Deterministic Computation. Theor. Comput. Sci. 154(1): 23-39 (1996) - 1995
- [i1]Marek Karpinski, Rutger Verbeek:
On Randomized Versus Deterministic Computation. Electron. Colloquium Comput. Complex. TR95 (1995) - 1993
- [c8]Marek Karpinski, Rutger Verbeek:
On Randomized Versus Deterministic Computation. ICALP 1993: 227-240
1980 – 1989
- 1987
- [j5]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) - [c7]Marek Karpinski, Rutger Verbeek:
Randomness, Provability, and the Seperation of Monte Carlo Time and Space. Computation Theory and Logic 1987: 189-207 - 1986
- [j4]Marek Karpinski, Rutger Verbeek:
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation. Inf. Control. 71(1/2): 131-142 (1986) - 1985
- [j3]Marek Karpinski, Rutger Verbeek:
There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator. Inf. Control. 67(1-3): 158-162 (1985) - 1983
- [j2]Burchard von Braunmühl, Stephen A. Cook, Kurt Mehlhorn, Rutger Verbeek:
The Recognition of Deterministic CFL's in Small Time and Space. Inf. Control. 56(1/2): 34-51 (1983) - [c6]Burchard von Braunmühl, Rutger Verbeek:
Input-Driven Languages are Recognized in log n Space. FCT 1983: 40-51 - 1981
- [c5]Rutger Verbeek:
Time-Space Trade-Offs for General Recursion. FOCS 1981: 228-234 - 1980
- [c4]Burchard von Braunmühl, Rutger Verbeek:
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space. FOCS 1980: 411-420
1970 – 1979
- 1979
- [c3]Burchard von Braunmühl, Rutger Verbeek:
Finite-Change Automata. Theoretical Computer Science 1979: 91-100 - 1978
- [j1]Rutger Verbeek, Klaus Weihrauch:
Data Representation and Computational Complexity. Theor. Comput. Sci. 7: 99-116 (1978) - 1976
- [c2]Rutger Verbeek, Klaus Weihrauch:
The Influence of the Data Presentation on the Computational POwer of Machines. MFCS 1976: 551-558 - 1973
- [c1]Rutger Verbeek:
Erweiterungen subrekursiver Programmiersprachen. Automatentheorie und Formale Sprachen 1973: 311-318
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
