The DOI matches its Crossref record.
Nondeterministic Algorithms
Open accessAbstract
Programs to solve combinatorial search problems may often be simply written by using multiple-valued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs. The process is illustrated with algorithms to find all solutions to the eight queens problem on the chessboard, and to find all simple cycles in a network.
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
Cited by
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 600
Colmerauer, A., & Roussel, P. (1993) · The second ACM SIGPLAN conference on History of programming languages · doi:10.1145/154766.155362 · Cited by 108
An ego-centric citation analysis of the works of Michael O. Rabin based on multiple citation indexes
Bar-Ilan, J. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2006.03.019 · Cited by 57
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Metadata
- Authors
- Floyd, R. W.
- Venue
- Journal of the ACM
- Published
- 1967-10
- Volume
- 14
- Issue
- 4
- Pages
- 636-644
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W832635820
- Cited by
- 368
- References
- 0
- FWCI
- 7.20
- 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: Nondeterministic Algorithms. https://app.cochat.ai/papers/10.1145/321420.321422
- The paper
- Floyd, R. W. (1967). Nondeterministic Algorithms. Journal of the ACM. https://doi.org/10.1145/321420.321422
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.
