The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Parallelism in random access machines
Abstract
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 hold for other classes. The effect of limiting the size of the common memory is also considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the power of multiplication in random access machines
Hartmanis, J., & Šimon, J. (1974) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1974.20 · Cited by 126
A characterization of the power of vector machines
Pratt, V., & Stockmeyer, L. J. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80037-2 · Cited by 126
Cited by
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Metadata
- Authors
- Fortune, S., & Wyllie, J.
- Venue
- Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78
- Publisher
- ACM Press
- Published
- 1978
- Pages
- 114-118
- OpenAlex
- W2004618348
- Cited by
- 891
- References
- 2
- FWCI
- 3.73
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallelism in random access machines. https://app.cochat.ai/papers/10.1145/800133.804339
- The paper
- Fortune, S., & Wyllie, J. (1978). Parallelism in random access machines. Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. https://doi.org/10.1145/800133.804339
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.