On the public citation graph
A novel discrete relaxation architecture
0 signed · 35 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.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
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.1109/2.43523openalex-snapshot
A structured approach for VLSI circuit design
inferredcites →https://doi.org/10.1109/6.48848openalex-snapshot
Multichip modules: next-generation packages
inferredcites →https://doi.org/10.1109/cvpr.1991.139745openalex-snapshot
Parallel algorithms and architectures for discrete relaxation technique
inferredcites →https://doi.org/10.1109/proc.1987.13894openalex-snapshot
Advanced parallel processing with supercomputer architectures
inferredcites →https://doi.org/10.1109/tc.1972.5009071openalex-snapshot
Some Computer Organizations and Their Effectiveness
inferredcites →https://doi.org/10.1109/tc.1985.1676530openalex-snapshot
Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
inferredcites →https://doi.org/10.1109/tcs.1987.1086060openalex-snapshot
A pipelined architecture for parallel image relaxation operations
inferredcites →https://doi.org/10.1109/tpami.1979.4766903openalex-snapshot
The Consistent Labeling Problem: Part I
inferredcites →https://doi.org/10.1109/tpami.1987.4767988openalex-snapshot
A Parallel Architecture for Discrete Relaxation Algorithm
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/66451.66457openalex-snapshot
The future of high performance computers in science and engineering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118659199.ch8openalex-snapshot
Relaxation for Energy Minimization
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-1-4613-0303-9_30openalex-snapshot
Multispace Search for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_17openalex-snapshot
A Minimax αβ Relaxation for Global Optimization
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/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bf03038310openalex-snapshot
A quantitative solution to Constraint Satisfaction Problem (CSP)
inferred← citeshttps://doi.org/10.1007/s11390-005-0002-8openalex-snapshot
Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1023/a:1008287028851openalex-snapshot
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1008294209959openalex-snapshot
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
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.247892openalex-snapshot
Local search for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/43.256919openalex-snapshot
Microword length minimization in microprogrammed controller synthesis
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/92.311634openalex-snapshot
A new, cellular automaton-based, nearest neighbor pattern classifier and its VLSI implementation
inferred← citeshttps://doi.org/10.1109/tcsii.2012.2235738openalex-snapshot
A Flexible and Customizable Architecture for the Relaxation Labeling Algorithm
inferred← citeshttps://doi.org/10.1145/196244.196278openalex-snapshot
A modular partitioning approach for asynchronous circuit synthesis
inferred← citeshttps://doi.org/10.5555/254208.254252openalex-snapshot
A divide-and-conquer approach for asynchronous interface synthesis
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.