The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Nondeterministic Algorithms
The work
| Authors | Robert W. Floyd |
|---|---|
| Editors | |
| Type | article |
| Year | 1967 |
| Citekey | floyd1967nondeterministic |
Where it appeared
| Published in | Journal of the ACM |
|---|---|
| Publisher | Association for Computing Machinery |
| Volume | 14 |
| Issue | 4 |
| Pages | 636--644 |
Identifiers
| DOI | 10.1145/321420.321422 |
|---|---|
| OpenAlex | W832635820 |
Access
| Landing page | https://doi.org/10.1145/321420.321422 |
|---|---|
| Free full text | https://dl.acm.org/doi/pdf/10.1145/321420.321422 |
Empty on purpose
| copy |
Related
| Distinct from | floyd1967assigning |
|---|---|
| Distinct from | floyd1993assigning |
Abstract
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.
How it got here
| How it got here | agent via crossref |
|---|---|
| Added | 2026-08-19 00:00 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Filed under
Cite it as
@article{floyd1967nondeterministic,
title = {Nondeterministic Algorithms},
author = {Robert W. Floyd},
year = {1967},
journal = {Journal of the ACM},
publisher = {Association for Computing Machinery},
volume = {14},
number = {4},
pages = {636--644},
doi = {10.1145/321420.321422},
}
This record lives at https://refs.drheap.org/floyd1967nondeterministic/ and will keep doing so.