The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Parallel Prefix Computation
Open accessAbstract
The prefix problem is to compute all the products x t o x2 .... o xk for i ~ k .~n, where o is an associative operation A recurstve construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast, small Boolean ctrcmts to simulate fimte-state transducers.By simulating a sequentml adder, a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n Is obtained for n-bit binary addmon The size can be decreased significantly by permitting the depth to increase by an addmve constant KEY WORDS AND PHRASES automaton, binary addmon, clrcmt, combinational complexity, depth, fanout, parallehsm, size, transducer CR CATEGORIES 5.22, 5 25, 6 1, 6 32 X3 o X2.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
A lower bound for the length of addition chains
Schönhage, A. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90008-0 · Cited by 92
On the Algorithmic Complexity of Discrete Functions
Ofman, Y. (1963) · Soviet physics. Doklady · Cited by 86
Cited by
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
A group-theoretic model for symmetric interconnection networks
Akers, S. B., & Krishnamurthy, B. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21148 · Cited by 1,231
A Regular Layout for Parallel Adders
Brent, & Kung (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675982 · Cited by 1,147
Rethinking Attention with Performers
Choromanski, K., Likhosherstov, V., Dohan, D., Song, X., Gane, A., Sarlos, T., Hawkins, P., Davis, J., Mohiuddin, A., Kaiser, L., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.14794 · Cited by 695
“Unidirectional FAVOR+ using fast prefix-sum pre-computation in parallel (Ladner & Fischer, 1980; Cormen et al., 2009) has O(mLd) space complexity to store GPS which can be reduced to O(md+ Ld+mL) by running a simple (though non-parallel in L) aggregation of GPSi,:,: without storing the whole tensor…”
Method
Metadata
- Authors
- Ladner, R. E., & Fischer, M. J.
- Venue
- Journal of the ACM
- Published
- 1980-10-01
- Volume
- 27
- Issue
- 4
- Pages
- 831-838
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2143462372
- Cited by
- 1,281
- References
- 5
- FWCI
- 11.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel Prefix Computation. https://app.cochat.ai/papers/10.1145/322217.322232
- The paper
- Ladner, R. E., & Fischer, M. J. (1980). Parallel Prefix Computation. Journal of the ACM. https://doi.org/10.1145/322217.322232
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.