On the public citation graph
Parallel consistent labeling algorithms
0 signed · 61 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(85)90041-4openalex-snapshot
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(86)90083-4openalex-snapshot
Arc and path consistency revisited
inferredcites →https://doi.org/10.1016/0020-0255(74)90008-5openalex-snapshot
Networks of constraints: Fundamental properties and applications to picture processing
inferredcites →https://doi.org/10.1016/0020-0255(78)90043-9openalex-snapshot
Reduction operations for constraint satisfaction
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0373371-6openalex-snapshot
Estimating the efficiency of backtrack programs
inferredcites →https://doi.org/10.1109/tsmc.1976.4309519openalex-snapshot
Scene Labeling by Relaxation Operations
inferredcites →https://doi.org/10.1142/s021800148800025xopenalex-snapshot
PARALLEL SPLIT-LEVEL RELAXATION
inferredcites →https://doi.org/10.1145/322108.322119openalex-snapshot
Time Bounded Random Access Machines with Parallel Processing
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.1002/9781118574522.ch8openalex-snapshot
Distributed Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_113openalex-snapshot
Static Parallel Arc Consistency in constraint satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_91openalex-snapshot
Fast parallel constraint satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_50openalex-snapshot
Partiality and approximation schemes for local consistency in networks of constraints
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_14openalex-snapshot
The Propagation Depth of Local Consistency
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_16openalex-snapshot
Optimal Distributed Arc-Consistency
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_16openalex-snapshot
On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-75234-6_3openalex-snapshot
Parallelization of Computational Physics Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_27openalex-snapshot
Transforming Constraint Relaxation Networks into Boltzmann Machines
inferred← citeshttps://doi.org/10.1007/bf01018694openalex-snapshot
CONSAT: A parallel constraint satisfaction system
inferred← citeshttps://doi.org/10.1007/bf01407817openalex-snapshot
Comments on Samal and Henderson: ?Parallel consistent labeling algorithms?
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bfb0038484openalex-snapshot
Performance of parallel consistency algorithms
inferred← citeshttps://doi.org/10.1007/s10458-018-9388-xopenalex-snapshot
A new distributed algorithm for efficient generalized arc-consistency propagation
inferred← citeshttps://doi.org/10.1016/0004-3702(90)90009-oopenalex-snapshot
On the parallel complexity of discrete relaxation in constraint satisfaction networks
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90008-lopenalex-snapshot
Arc consistency: parallelism and domain dependence
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90063-hopenalex-snapshot
Fast parallel constraint satisfaction
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90085-xopenalex-snapshot
Local consistency in parallel constraint satisfaction networks
inferred← citeshttps://doi.org/10.1016/0010-4655(89)90082-9openalex-snapshot
Parallelization of a cluster algorithm
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90137-xopenalex-snapshot
Parallelization of the Ising model and its performance evaluation
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90045-oopenalex-snapshot
A tagging method for parallel constraint satisfaction
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50019-3openalex-snapshot
Parallel Algorithms and Architectures for Consistent Labeling
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50013-0openalex-snapshot
A distributed realization for constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.003openalex-snapshot
On the speed of constraint propagation and the time complexity of arc consistency testing
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00012-9openalex-snapshot
A distributed arc-consistency algorithm
inferred← citeshttps://doi.org/10.1023/a:1009864716588openalex-snapshot
On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints
inferred← citeshttps://doi.org/10.1023/a:1020594125144openalex-snapshot
Optimal Distributed Arc-Consistency
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/82.661652openalex-snapshot
An asynchronous weightless neural network for discrete relaxation problems
inferred← citeshttps://doi.org/10.1109/annes.1993.323090openalex-snapshot
Relational connectionist networks
inferred← citeshttps://doi.org/10.1109/asap.1991.238884openalex-snapshot
Parallel implementations of discrete relaxation technique on fixed size processor arrays
inferred← citeshttps://doi.org/10.1109/cvpr.1991.139745openalex-snapshot
Parallel algorithms and architectures for discrete relaxation technique
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89462openalex-snapshot
An optimal lookahead processor to prune search space
inferred← citeshttps://doi.org/10.1109/icpp.1993.137openalex-snapshot
Parallel Implementations of a Scalable Consistent Labeling Technique on Distributed Memory Multi-Processor Systems
inferred← citeshttps://doi.org/10.1109/icpr.1988.28210openalex-snapshot
Parallel split-level relaxation
inferred← citeshttps://doi.org/10.1109/icpr.1990.119417openalex-snapshot
Design of a dynamically reconfigurable, integrated, parallel vision system
inferred← citeshttps://doi.org/10.1145/2732409openalex-snapshot
Bounds for the Quantifier Depth in Finite-Variable Logics
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.1504/ijcse.2005.009703openalex-snapshot
Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study
inferred← citeshttps://doi.org/10.2307/2669348openalex-snapshot
Natural Law, Theology, and Morality in Locke
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5867openalex-snapshot
A Relaxation Scheme for Mesh Locality in Computer Vision.
inferred← citeshttps://doi.org/10.48550/arxiv.1303.7077openalex-snapshot
On the speed of constraint propagation and the time complexity of arc consistency testing
inferred← citeshttps://doi.org/10.70675/652e5f60z5df2z451dz87d6z1734c2bd6d86openalex-snapshot
Intégration des problèmes de satisfaction de contraintes distribués et sécurisés dans les systèmes d'aide à la décision à base de connaissances
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.