The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Open accessAbstract
The goal of this paper is to point out that analyses of parallelism m computational problems have practical implications even when mult~processor machines are not available.This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficsent serial algorithm for another problem A unified framework for cases like this is presented.Particular cases, which axe discussed in this paper, provide motivation for examining parallelism in sorting, selecuon, minimum-spanning-tree, shortest route, max-flow, and matrix multiplication problems, as well as in scheduling and locational problems.
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 Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
An O(logn) parallel connectivity algorithm
Shiloach, Y., & Vishkin, U. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90008-6 · Cited by 592
Combinatorial Optimization with Rational Objective Functions
Megiddo, N. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.414 · Cited by 473
Self-citationFinding Minimum Spanning Trees
Cheriton, D. R., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205051 · Cited by 428
Parallelism in Comparison Problems
Valiant, L. G. (1975) · SIAM Journal on Computing · doi:10.1137/0204030 · Cited by 403
An O(n2log n) parallel max-flow algorithm
Shiloach, Y., & Vishkin, U. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90013-x · Cited by 226
Perl, Y., & Schach, S. R. (1981) · Journal of the ACM · doi:10.1145/322234.322236 · Cited by 90
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Gusfield, D. (1983) · Journal of the ACM · doi:10.1145/2402.322391 · Cited by 90
A Shifting Algorithm for Min-Max Tree Partitioning
Becker, R. I., Schach, S. R., & Perl, Y. (1982) · Journal of the ACM · doi:10.1145/322290.322294 · Cited by 75
Cited by
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90373-1 · Cited by 1,324
Cole, R. (1988) · SIAM Journal on Computing · doi:10.1137/0217049 · Cited by 724
Online team formation in social networks
Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., & Leonardi, S. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187950 · Cited by 325
The Quickest Transshipment Problem
Hoppe, B., & Tardos, É. (2000) · Mathematics of Operations Research · doi:10.1287/moor.25.1.36.15211 · Cited by 310
Metadata
- Authors
- Megiddo, N.
- Venue
- Journal of the ACM
- Published
- 1983-10
- Volume
- 30
- Issue
- 4
- Pages
- 852-865
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2097004206
- Cited by
- 626
- References
- 11
- FWCI
- 11.78
- 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: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. https://app.cochat.ai/papers/10.1145/2157.322410
- The paper
- Megiddo, N. (1983). Applying Parallel Computation Algorithms in the Design of Serial Algorithms. Journal of the ACM. https://doi.org/10.1145/2157.322410
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.