The second machine class: models of parallelism
Parallel computers and computations
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computation: finite and infinite machines
Computation: finite and infinite machines
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pipelined Decomposable BSP Computers
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The problem of space invariance for sequential machines
Information and Computation
Robust information-theoretic private information retrieval
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
| Hi-index | 0.00 |
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.