Parallelism in Random Access Machines

@inproceedings{Fortune1978ParallelismIR,
  title={Parallelism in Random Access Machines},
  author={Steven Fortune and James Wyllie},
  booktitle={STOC},
  year={1978}
}
A model of computation based on random access machines operating in parallel and sharing a common memory is presented. The computational power of this model is related to that of traditional models. In particular, deterministic parallel RAM's can accept in polynomial time exactly the sets accepted by polynomial tape bounded Turing machines; nondeterministic RAM's can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines. Similar results… CONTINUE READING
Highly Influential
This paper has highly influenced 90 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 485 extracted citations

Similar Papers

Loading similar papers…