The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Backtrack Programming
Open accessAbstract
A widely used method of efftcient search is examined in detail.This examination provides the opportunity to formulate its scope and methods in their full generality.In addL tion to a general exposition of the basic process, some important refinemertts are indicated.Examples are given which illustrate the salient features of this searching process.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The ability to pass exceptions up to an enclosing context is convenient because it is quite natural to deal with an exception first locally and then more globally [19].”
From Exception handling: issues and a proposed notation (1975) · cites this paper as [19]
Experimental — accuracy not yet measured
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
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,065
Mann, H., & Peterson, W. W. (1961) · Technometrics · doi:10.2307/1266564 · Cited by 905
Golomb, S. W., Gordon, B., & Welch, L. R. (1958) · Canadian Journal of Mathematics · doi:10.4153/cjm-1958-023-9 · Cited by 222
Self-citationNetto, E., Brun, V., & Brun, V. (1902) · Monatshefte für Mathematik · doi:10.1007/bf01703364 · Cited by 169
Discovery of an Hadamard matrix of order 92
Baumert, L. D., Golomb, S. W., & Hall, M. (1962) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1962-10761-7 · Cited by 79
Self-citationRegent Results in Comma-Free Codes
Jiggs, B. H. (1963) · Canadian Journal of Mathematics · doi:10.4153/cjm-1963-021-1 · Cited by 50
Coding and decoding for time-discrete amplitude-continuous memoryless channels
Ziv, J. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057754 · Cited by 12
Research works printed but not linked: 8
- GINSBURG , J. Gauss's arithmetization of tile problem of 8 queens . Scripta Math. 5 ( 1939 ) 63 - 66 . GINSBURG, J. Gauss's arithmetization of tile problem of 8 queens. Scripta Math. 5 (1939) 63-66.
- HALL , M. , AND KNU rm, D. E. Combinatorial analysis and computers, tterbert Ellsworth Slaught Memorial Papers, No. 10 (Suppl ., Amer. Math. Mort. , 1965 ). HALL, M., AND KNUrm, D.E. Combinatorial analysis and computers, tterbert Ellsworth Slaught Memorial Papers, No. 10 (Suppl., Amer. Math. Mort., 1965).
- SALIE , It . Zur verteilung naturliche zahlen auf elementfremde klassen . Bet. Verb. Sachs. Akad. Wiss. Leipzig. MaCh.-Natur Kl. 101 , 4 ( 1954 ). SALIE, It. Zur verteilung naturliche zahlen auf elementfremde klassen. Bet. Verb. Sachs. Akad. Wiss. Leipzig. MaCh.-Natur Kl. 101, 4 (1954).
- SCOTT , J. Programming a combinatorial puzzle. Dept. of Elec. Eng ., Princeton U. , June 1958 . SCOTT, J. Programming a combinatorial puzzle. Dept. of Elec. Eng., Princeton U., June 1958.
- SWIFT , J.D . Isomorph reiection in exhaustive search techniques . Amer. Math. Soc. Proc. Syrup. Appl. Math. 10 ( 1960 ), 195 - 200 . SWIFT, J.D. Isomorph reiection in exhaustive search techniques. Amer. Math. Soc. Proc. Syrup. Appl. Math. 10 (1960), 195-200.
- WALKER , P. L . An emmerative technique for a class of combinatorial problems . Amer. Math. Soc. Proc. Syrup. Appl. Math. 10 ( 1960 ), 91 - 94 . WALKER, P. L. An emmerative technique for a class of combinatorial problems. Amer. Math. Soc. Proc. Syrup. Appl. Math. 10 (1960), 91-94.
- WOZENCRAFT , J. M. , AND REIFFEN , B. Sequential Decoding , Technology Press , New YTork , 1961 WOZENCRAFT, J. M., AND REIFFEN, B. Sequential Decoding, Technology Press, New YTork, 1961
- Ziv, J. coding and coding for time-discrete ampliutute-cnotinous memoiryless channels.sc.D,., Thesis, Elec.eng. dewpt ., MIT , 1962 Ziv, J. coding and coding for time-discrete ampliutute-cnotinous memoiryless channels.sc.D,., Thesis, Elec.eng. dewpt., MIT, 1962
Cited by
Sorted by citations
Exception handling: issues and a proposed notation
Goodenough, J. B. (1975) · Communications of the ACM · doi:10.1145/361227.361230 · Cited by 496
Metadata
- Authors
- Golomb, S. W., & Baumert, L. D.
- Affiliations
- University of Southern California (US)
- Jet Propulsion Laboratory (US)
- Venue
- Journal of the ACM
- Published
- 1965-10
- Volume
- 12
- Issue
- 4
- Pages
- 516-524
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2295268496
- Cited by
- 498
- References
- 7
- Citations by year
- 2026: 4 · 2025: 4 · 2024: 5 · 2023: 4 · 2022: 10 · 2021: 33 · 2020: 13 · 2019: 8 · 2018: 10 · 2017: 8 · 2016: 14 · 2015: 11 · 2014: 6 · 2013: 18 · 2012: 9
- FWCI
- 21.05
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Journal of the ACM (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- backtracking, search algorithms, combinatorial search, search space exploration
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
