Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cees F. Slot

dblp:36/6090 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational complexity · 40% Algorithms and data structures · 32% Automata and formal languages · 28%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata
sequential machines
0.011988
The Problem of Space Invariance for Sequential Machines · Inf. Comput. 1988
Computational complexity
space complexity
0.021988
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984
The Problem of Space Invariance for Sequential Machines · Inf. Comput. 1988
Algorithms and data structures › data structure design › search structures › hashing
hash functions
0.011984
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984
Algorithms and data structures › data structure design › search structures › hashing
perfect hashing
0.011984
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984
Computational complexity › computational models
random access machine simulation
0.011984
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space · STOC 1984

Methods — techniques the papers use, named apart from their topics

simulation · 0.0perfect hashing · 0.0
YearPublicationVenuePosition
1988 The Problem of Space Invariance for Sequential Machines
Cees F. Slot, Peter van Emde Boas
Inf. Comput.1
1984 On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space
abstract
In Complexity Theory the use of informal estimates can be justified by appealing to the Invariance thesis which states that all standard models of computing devices are sufficiently equivalent. This thesis would require, among others, that a RAM can be simulated by a Turingmachine with constant factor overhead in space. Such a simulation is hard to obtain if the traditional spacemeasure for RAM-space is used. The simulation uses a new method for condensing space, based on perfect hashing.
Cees F. Slot, Peter van Emde Boas
STOC1