On the public citation graph

Backtracking with multi-level dynamic search rearrangement

https://doi.org/10.1007/bf00288958
0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0004-3702(76)90008-4openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0031-3203(76)90020-0openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1090/psapm/006/0080380openalex-snapshot
Machine attacks on problems whose variables are permutations
inferredcites →https://doi.org/10.1090/psapm/015/0180910openalex-snapshot
Computer investigation of orthogonal Latin squares of order ten
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0373371-6openalex-snapshot
Estimating the efficiency of backtrack programs
inferredcites →https://doi.org/10.1126/science.194.4271.1235openalex-snapshot
Mathematics and Computer Science: Coping with Finiteness
inferredcites →https://doi.org/10.1137/0207038openalex-snapshot
Tree Size by Partial Backtracking
inferredcites →https://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.2307/2005469openalex-snapshot
Estimating the Efficiency of Backtrack Programs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-28423-7_6openalex-snapshot
Evaluating Branching Heuristics in Interval Constraint Propagation for Satisfiability
inferred← citeshttps://doi.org/10.1007/bf02022102openalex-snapshot
A logic language for combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02219227openalex-snapshot
Branch & sample: A simple strategy for constraint satisfaction
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90068-xopenalex-snapshot
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/0954-1810(91)90001-5openalex-snapshot
A survey of constraint based scheduling systems using an artificial intelligence approach
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50019-8openalex-snapshot
Complementary Approaches to CNF Boolean Equations
inferred← citeshttps://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferred← citeshttps://doi.org/10.1023/a:1018944814355openalex-snapshot
Backtracking and random constraint satisfaction
inferred← citeshttps://doi.org/10.1109/21.179839openalex-snapshot
Reasons for the effects of bounded look-ahead search
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/69.317698openalex-snapshot
Efficient local search with conflict minimization: a case study of the n-queens problem
inferred← citeshttps://doi.org/10.1109/tc.1985.1676530openalex-snapshot
Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
inferred← citeshttps://doi.org/10.1109/tpami.1982.4767249openalex-snapshot
Comments on "A Counterexample to a Diameter Algorithm for Convex Polygons
inferred← citeshttps://doi.org/10.1109/tpami.1982.4767250openalex-snapshot
An Empirical Comparison of Backtracking Algorithms
inferred← citeshttps://doi.org/10.1109/tpami.1984.4767555openalex-snapshot
Solving Satisfiability with Less Searching
inferred← citeshttps://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferred← citeshttps://doi.org/10.1137/0212049openalex-snapshot
An Analysis of Backtracking with Search Rearrangement
inferred← citeshttps://doi.org/10.1137/0214067openalex-snapshot
The Pure Literal Rule and Polynomial Average Time
inferred← citeshttps://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferred← citeshttps://doi.org/10.1137/0222023openalex-snapshot
Average Time Analysis of Clause Order Backtracking
inferred← citeshttps://doi.org/10.1137/s0097539792230484openalex-snapshot
A Variational Method for Analysing Unit Clause Search
inferred← citeshttps://doi.org/10.1145/22145.22195openalex-snapshot
The complexity of backtrack searches
inferred← citeshttps://doi.org/10.1145/51909.52120openalex-snapshot
A dynamic constraint-directed ordered search algorithm for solving constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/800171.809596openalex-snapshot
Integrating knowledge in problem solving search procedures
inferred← citeshttps://doi.org/10.1147/rd.314.0464openalex-snapshot
Efficient search techniques—An empirical study of the N-Queens Problem
inferred← citeshttps://doi.org/10.1609/aimag.v13i1.976openalex-snapshot
Algorithms for constraint-satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1613/jair.1openalex-snapshot
Dynamic Backtracking
inferred← citeshttps://doi.org/10.5555/324493.324615openalex-snapshot
Intelligent backtracking using symmetry
inferred← citeshttps://doi.org/10.5555/642150.642151openalex-snapshot
Backtrack searching in the presence of symmetry
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.