On the public citation graph

Invariance of complexity measures for networks with unreliable gates

0 signed · 48 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.1002/j.1538-7305.1982.tb03094.xopenalex-snapshot
Comparisons on Blocking Probabilities for Regular Series Parallel Channel Graphs
inferredcites →https://doi.org/10.1016/0022-0000(86)90002-4openalex-snapshot
Reliable computation with cellular automata
inferredcites →https://doi.org/10.1016/0022-0000(88)90024-4openalex-snapshot
A simple three-dimensional real-time reliable cellular array
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0537073-0openalex-snapshot
Majorization on a Partially Ordered Set
inferredcites →https://doi.org/10.1109/18.2628openalex-snapshot
Reliable computation by formulas in the presence of noise
inferredcites →https://doi.org/10.1109/18.30978openalex-snapshot
Reliable computation by networks in the presence of noise
inferredcites →https://doi.org/10.1109/sfcs.1985.41openalex-snapshot
On networks of noisy gates
inferredcites →https://doi.org/10.1109/tec.1956.5219786openalex-snapshot
Complexity in Electronic Switching Circuits
inferredcites →https://doi.org/10.1145/2422.322412openalex-snapshot
Bounding Fan-out in Logical Networks

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcom.1999.0505openalex-snapshot
Stochastic Analog Networks and Computational Complexity
inferred← citeshttps://doi.org/10.1006/jcss.1997.1531openalex-snapshot
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_47openalex-snapshot
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_36openalex-snapshot
Area efficient methods to increase the reliability of circuits
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_55openalex-snapshot
On the computational power of probabilistic and faulty neural networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_347openalex-snapshot
Nanocomputers
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_128openalex-snapshot
Nanocomputers
inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_347openalex-snapshot
Nanocomputers
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_347-2openalex-snapshot
Nanocomputers
inferred← citeshttps://doi.org/10.1007/bfb0045074openalex-snapshot
Can large fanin circuits perform reliable computations in the presence of noise?
inferred← citeshttps://doi.org/10.1007/bfb0054004openalex-snapshot
Neural dynamics with stochasticity
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.02.003openalex-snapshot
Fault tolerance in cellular automata at high fault rates
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.07.001openalex-snapshot
Computing Boolean functions from multiple faulty copies of input bits
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00237-6openalex-snapshot
Can large fanin circuits perform reliable computations in the presence of faults?
inferred← citeshttps://doi.org/10.1063/1.3640747openalex-snapshot
Effective theories for circuits and automata
inferred← citeshttps://doi.org/10.1088/0957-4484/14/2/324openalex-snapshot
A defect- and fault-tolerant architecture for nanocomputers
inferred← citeshttps://doi.org/10.1103/physreva.54.1098openalex-snapshot
Good quantum error-correcting codes exist
inferred← citeshttps://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferred← citeshttps://doi.org/10.1109/18.796377openalex-snapshot
Signal propagation and noisy circuits
inferred← citeshttps://doi.org/10.1109/72.165601openalex-snapshot
A note on the complexity of reliability in neural networks
inferred← citeshttps://doi.org/10.1109/isit.1995.550443openalex-snapshot
Information theory and noisy computation
inferred← citeshttps://doi.org/10.1109/ita.2008.4601020openalex-snapshot
Can the storage capacity of memories built from unreliable components be determined?
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267778openalex-snapshot
Communication on noisy channels: a coding theorem for computation
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365682openalex-snapshot
On the design of reliable Boolean circuits that contain partially unreliable gates
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548464openalex-snapshot
Fault-tolerant quantum computation
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548474openalex-snapshot
Highly fault-tolerant parallel computation
inferred← citeshttps://doi.org/10.1109/tcsi.2007.902611openalex-snapshot
An Information Theoretical Framework for Analysis and Design of Nanoscale Fault-Tolerant Memories Based on Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/telsks.2013.6704419openalex-snapshot
Taylor-Kuznetsov fault-tolerant memories: A survey and results under correlated gate failures
inferred← citeshttps://doi.org/10.1109/tnano.2002.807393openalex-snapshot
A system architecture solution for unreliable nanoelectronic devices
inferred← citeshttps://doi.org/10.1109/tnano.2004.824034openalex-snapshot
Fault-Tolerance in Nanocomputers: A Cellular Array Approach
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2008392openalex-snapshot
Analysis of Defect Tolerance in Molecular Crossbar Electronics
inferred← citeshttps://doi.org/10.1142/s0129183104006327openalex-snapshot
FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
inferred← citeshttps://doi.org/10.1145/1255456.1255466openalex-snapshot
Probabilistic system-on-a-chip architectures
inferred← citeshttps://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferred← citeshttps://doi.org/10.1162/089976698300017359openalex-snapshot
On the Effect of Analog Noise in Discrete-Time Analog Computations
inferred← citeshttps://doi.org/10.1162/089976699300016656openalex-snapshot
Analog Neural Nets with Gaussian or Other Common Noise Distributions Cannot Recognize Arbitrary Regular Languages
inferred← citeshttps://doi.org/10.21629/jsee.2018.04.21openalex-snapshot
On redundancy-modified NAND multiplexing
inferred← citeshttps://doi.org/10.48550/arxiv.math/0311045openalex-snapshot
A Phase Transition and Stochastic Domination in Pippenger's Probabilistic Failure Model for Boolean Networks with Unreliable Gates
inferred← citeshttps://doi.org/10.5772/16101openalex-snapshot
Information-Theoretic Modeling and Analysis of Stochastic Behaviors in Quantum-Dot Cellular Automata
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.