The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Parallel Evaluation of General Arithmetic Expressions
Open accessAbstract
It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 n + 10( n - 1)/ p using p ≥ 1 processors which can independently perform arithmetic operations in unit time. This bound is within a constant factor of the best possible. A sharper result is given for expressions without the division operation, and the question of numerical stability is discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
An empirical study of FORTRAN programs
Knuth, D. E. (1971) · Software: Practice and Experience · doi:10.1002/spe.4380010203 · Cited by 680
Kuck, D. J., Muraoka, Y., & Chen, S.-C. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223501 · Cited by 225
A Survey of Parallelism in Numerical Analysis
Miranker, W. L. (1971) · SIAM Review · doi:10.1137/1013094 · Cited by 95
Cited by
Scheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
Cilk: an efficient multithreaded runtime system
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1995) · Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/209936.209958 · Cited by 1,021
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Demystifying Parallel and Distributed Deep Learning: An In-depth Concurrency Analysis
Ben-Nun, T., & Hoefler, T. (2020) · ACM Computing Surveys · doi:10.1145/3320060 · Cited by 577
Bounded Ciphertext Policy Attribute Based Encryption
Goyal, V., Jain, A., Pandey, O., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_47 · Cited by 544
There’s plenty of room at the Top: What will drive computer performance after Moore’s law?
Leiserson, C. E., Thompson, N. C., Emer, J. S., Kuszmaul, B. C., Lampson, B. W., Sanchez, D., & Schardl, T. B. (2020) · Science · doi:10.1126/science.aam9744 · Cited by 469
Parallel tree contraction and its application
Miller, G. L., & Reif, J. H. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.43 · Cited by 404
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
The implementation of the Cilk-5 multithreaded language
Frigo, M., Leiserson, C. E., & Randall, K. H. (1998) · ACM SIGPLAN Notices · doi:10.1145/277652.277725 · Cited by 290
Computing connected components on parallel computers
Hirschberg, D. S., Chandra, A. K., & Sarwate, D. V. (1979) · Communications of the ACM · doi:10.1145/359138.359141 · Cited by 266
Computing Algebraic Formulas Using a Constant Number of Registers
Ben-Or, M., & Cleve, R. (1992) · SIAM Journal on Computing · doi:10.1137/0221006 · Cited by 139
Metadata
- Authors
- Brent, R. P.
- Venue
- Journal of the ACM
- Published
- 1974-04
- Volume
- 21
- Issue
- 2
- Pages
- 201-206
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2130566259
- Cited by
- 814
- References
- 3
- FWCI
- 9.66
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.