The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The Algorithmic Aspects of the Regularity Lemma
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
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
Self-citationOn subsets of abelian groups with no 3-term arithmetic progression
Frankl, P., Graham, R., & Rödl, V. (1987) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(87)90053-7 · Cited by 66
Cited by
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (1998) · Journal of the ACM · doi:10.1145/285055.285060 · Cited by 1,020
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
Metadata
- Authors
- Alon, N., Duke, R. A., Lefmann, H., Rodl, V., & Yuster, R.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 1994-01
- Volume
- 16
- Issue
- 1
- Pages
- 80-109
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2083580384
- Cited by
- 305
- References
- 4
- FWCI
- 6.28
- Type
- journal article
- 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: The Algorithmic Aspects of the Regularity Lemma. https://app.cochat.ai/papers/10.1006/jagm.1994.1005
- The paper
- Alon, N., Duke, R. A., Lefmann, H., Rodl, V., & Yuster, R. (1994). The Algorithmic Aspects of the Regularity Lemma. Journal of Algorithms. https://doi.org/10.1006/jagm.1994.1005
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.
