On the public citation graph
Reliable computation by formulas in the presence of noise
0 signed · 102 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.1515/9781400882618-003openalex-snapshot
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470429983openalex-snapshot
Bio‐Inspired and Nanoscale Integrated Computing
inferred← citeshttps://doi.org/10.1002/9780470429983.ch10openalex-snapshot
Fault‐ and Defect‐Tolerant Architectures for Nanocomputing
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/1-4020-8068-9_6openalex-snapshot
Tools and Techniques for Evaluating Reliability Trade-Offs for Nano-Architectures
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/3-540-62592-5_68openalex-snapshot
Design of reliable combinatorial algorithms using certificates
inferred← citeshttps://doi.org/10.1007/978-1-0716-1006-0_100671openalex-snapshot
Optimal Energy Allocation in Reliable Neural Sensory Processing
inferred← citeshttps://doi.org/10.1007/978-1-4020-9829-1_6openalex-snapshot
Fault Tolerant Logic with Error Correcting Codes
inferred← citeshttps://doi.org/10.1007/978-1-4614-7320-6_100671-1openalex-snapshot
Optimal Energy Allocation in Reliable Neural Sensory Processing
inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_2openalex-snapshot
Reliable Combinational Systems Out of Unreliable Components
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_31openalex-snapshot
Securing Circuits against Constant-Rate Tampering
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_23openalex-snapshot
Securing Circuits and Protocols against 1/poly(k) Tampering Rate
inferred← citeshttps://doi.org/10.1007/978-90-481-9644-9openalex-snapshot
Design, Analysis and Test of Logic Circuits Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-90-481-9644-9_2openalex-snapshot
Probabilistic Transfer Matrices
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.jcss.2013.02.001openalex-snapshot
Fault tolerance in cellular automata at low fault rates
inferred← citeshttps://doi.org/10.1016/j.microrel.2010.07.156openalex-snapshot
Maximum error modeling for fault-tolerant computation using maximum a posteriori (MAP) hypothesis
inferred← citeshttps://doi.org/10.1038/s41534-025-00961-xopenalex-snapshot
Noisy quantum trees: infinite protection without correction
inferred← citeshttps://doi.org/10.1080/00207217.2018.1426113openalex-snapshot
Fault tolerant system based on IDDQ testing
inferred← citeshttps://doi.org/10.1088/0957-4484/15/1/037openalex-snapshot
Parallel information and computation with restitution for noise-tolerant nanoscale logic networks
inferred← citeshttps://doi.org/10.1088/1742-6596/233/1/012015openalex-snapshot
On the robustness of random Boolean formulae
inferred← citeshttps://doi.org/10.1090/dimacs/063/12openalex-snapshot
Survey: Information flow on trees
inferred← citeshttps://doi.org/10.1103/physreva.108.052425openalex-snapshot
Limits of fault tolerance on resource-constrained quantum circuits for classical problems
inferred← citeshttps://doi.org/10.1103/physreva.84.042319openalex-snapshot
Information causality and noisy computations
inferred← citeshttps://doi.org/10.1103/physreve.82.041112openalex-snapshot
Noisy random Boolean formulae: A statistical physics perspective
inferred← citeshttps://doi.org/10.1103/physrevlett.103.248701openalex-snapshot
Computing with Noise: Phase Transitions in Boolean Formulas
inferred← citeshttps://doi.org/10.1109/18.30978openalex-snapshot
Reliable computation by networks in the presence of noise
inferred← citeshttps://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferred← citeshttps://doi.org/10.1109/18.669417openalex-snapshot
On the maximum tolerable noise for reliable computation by formulas
inferred← citeshttps://doi.org/10.1109/18.75261openalex-snapshot
On the maximum tolerable noise for reliable computation by formulas
inferred← citeshttps://doi.org/10.1109/18.796377openalex-snapshot
Signal propagation and noisy circuits
inferred← citeshttps://doi.org/10.1109/92.863617openalex-snapshot
Toward achieving energy efficiency in presence of deep submicron noise
inferred← citeshttps://doi.org/10.1109/allerton63246.2024.10735307openalex-snapshot
Contraction Coefficients of Product Symmetric Channels
inferred← citeshttps://doi.org/10.1109/asap.2005.26openalex-snapshot
CONAN - A Design Exploration Framework for Reliable Nano-Electronics
inferred← citeshttps://doi.org/10.1109/ciss.2017.7926139openalex-snapshot
Energy-reliability limits in nanoscale neural networks
inferred← citeshttps://doi.org/10.1109/date.2005.135openalex-snapshot
Energy Bounds for Fault-Tolerant Nanoscale Designs
inferred← citeshttps://doi.org/10.1109/dtis.2006.1708697openalex-snapshot
Defect and fault tolerant cell architecture for feasible nanoelectronic designs
inferred← citeshttps://doi.org/10.1109/focs.2012.69openalex-snapshot
Formulas Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00028openalex-snapshot
Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise
inferred← citeshttps://doi.org/10.1109/hldvt.2003.1252467openalex-snapshot
Nano, quantum, and molecular computing: are we ready for the validation and test challenges?
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397276openalex-snapshot
Probabilistic decision diagrams for exact probabilistic analysis
inferred← citeshttps://doi.org/10.1109/icvd.2004.1261046openalex-snapshot
Evaluating the reliability of defect-tolerant architectures for nanotechnology with probabilistic model checking
inferred← citeshttps://doi.org/10.1109/isit.1995.550443openalex-snapshot
Information theory and noisy computation
inferred← citeshttps://doi.org/10.1109/isit.2007.4557152openalex-snapshot
Noise threshold for universality of 2-input gates
inferred← citeshttps://doi.org/10.1109/isit.2014.6875355openalex-snapshot
Is “Shannon-capacity of noisy computing” zero?
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517787openalex-snapshot
Strong data processing inequality in neural networks with noisy neurons and its implications
inferred← citeshttps://doi.org/10.1109/ita.2016.7888169openalex-snapshot
Energy-reliability limits in nanoscale circuits
inferred← citeshttps://doi.org/10.1109/jproc.2018.2869867openalex-snapshot
Shannon-Inspired Statistical Computing for the Nanoscale Era
inferred← citeshttps://doi.org/10.1109/jsait.2020.2981889openalex-snapshot
Energy-Reliability Limits in Nanoscale Feedforward Neural Networks and Formulas
inferred← citeshttps://doi.org/10.1109/jxcdc.2019.2909912openalex-snapshot
Error-Resilient Spintronics via the Shannon- Inspired Model of Computation
inferred← citeshttps://doi.org/10.1109/lpe.2000.155302openalex-snapshot
Reliable low-power design in the presence of deep submicron noise
inferred← citeshttps://doi.org/10.1109/mm.2006.96openalex-snapshot
MRF Reinforcer: A Probabilistic Element for Space Redundancy in Nanoscale Circuits
inferred← citeshttps://doi.org/10.1109/mwscas.2008.4616812openalex-snapshot
Increased energy efficiency and reliability of ultra-low power arithmetic
inferred← citeshttps://doi.org/10.1109/nano.2006.1717013openalex-snapshot
Probabilistic Error Model for Unreliable Nano-logic Gates
inferred← citeshttps://doi.org/10.1109/ojsp.2020.2997262openalex-snapshot
Cost-Reliability Tradeoffs in Fusing Unreliable Computational Units
inferred← citeshttps://doi.org/10.1109/qest.2010.43openalex-snapshot
On the Theory of Stochastic Processors
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.1993.366827openalex-snapshot
Signal propagation, with application to a lower bound on the depth of noisy formulas
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/sips.2013.6674525openalex-snapshot
Error-resilient systems via statistical signal processing
inferred← citeshttps://doi.org/10.1109/tcad.2005.852033openalex-snapshot
Evaluating the reliability of NAND multiplexing with PRISM
inferred← citeshttps://doi.org/10.1109/tit.2003.818405openalex-snapshot
On the maximum tolerable noise of k-input gates for reliable computation by formulas
inferred← citeshttps://doi.org/10.1109/tit.2004.839491openalex-snapshot
Coding Approaches to Fault Tolerance in Linear Dynamic Systems
inferred← citeshttps://doi.org/10.1109/tit.2008.926459openalex-snapshot
Noise Threshold for Universality of Two-Input Gates
inferred← citeshttps://doi.org/10.1109/tit.2011.2145870openalex-snapshot
Performance of LDPC Codes Under Faulty Iterative Decoding
inferred← citeshttps://doi.org/10.1109/tit.2014.2370638openalex-snapshot
On Reliable Computation by Noisy Random Boolean Formulas
inferred← citeshttps://doi.org/10.1109/tit.2015.2482978openalex-snapshot
Dissipation of Information in Channels With Input Constraints
inferred← citeshttps://doi.org/10.1109/tit.2017.2771417openalex-snapshot
Defect Tolerance: Fundamental Limits and Examples
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.834192openalex-snapshot
Markov Chains and Probabilistic Computation—A General Framework for Multiplexed Nanoelectronic Systems
inferred← citeshttps://doi.org/10.1109/tnano.2005.851289openalex-snapshot
Bifurcations and Fundamental Error Bounds for Fault-Tolerant Computations
inferred← citeshttps://doi.org/10.1109/tnano.2007.891504openalex-snapshot
Comparing Reliability-Redundancy Tradeoffs for Two von Neumann Multiplexing Architectures
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2003167openalex-snapshot
Probabilistic Error Modeling for Nano-Domain Logic Circuits
inferred← citeshttps://doi.org/10.1137/22m1520578openalex-snapshot
Circuits Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1145/1297666.1297674openalex-snapshot
Probabilistic transfer matrices in symbolic reliability analysis of logic circuits
inferred← citeshttps://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferred← citeshttps://doi.org/10.1145/344166.344642openalex-snapshot
Reliable low-power design in the presence of deep submicron noise (embedded tutorial session)
inferred← citeshttps://doi.org/10.1145/3519935.3520007openalex-snapshot
Circuits resilient to short-circuit errors
inferred← citeshttps://doi.org/10.1145/65950.77248openalex-snapshot
Invariance of complexity measures for networks with unreliable gates
inferred← citeshttps://doi.org/10.1155/2010/460312openalex-snapshot
Error Immune Logic for Low-Power Probabilistic Computing
inferred← citeshttps://doi.org/10.1201/9781420034783.ch12openalex-snapshot
Fault tolerance and ultimate physical limits of nanocomputation
inferred← citeshttps://doi.org/10.1214/aoap/1019487349openalex-snapshot
Broadcasting on trees and the Ising model
inferred← citeshttps://doi.org/10.13140/rg.2.1.1191.0645openalex-snapshot
On reliable computation by noisy random Boolean formulas
inferred← citeshttps://doi.org/10.22331/q-2023-08-16-1087openalex-snapshot
A Converse for Fault-tolerant Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.0710.4680openalex-snapshot
Energy Bounds for Fault-Tolerant Nanoscale Designs
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1215openalex-snapshot
Performance of LDPC Codes Under Faulty Iterative Decoding
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1448openalex-snapshot
Testing Information Causality for General Quantum Communication Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02578openalex-snapshot
Defect tolerance: fundamental limits and examples
inferred← citeshttps://doi.org/10.48550/arxiv.1702.06119openalex-snapshot
Shannon-inspired Statistical Computing to Enable Spintronics
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07779openalex-snapshot
Cost-Performance Tradeoffs in Fusing Unreliable Computational Units
inferred← citeshttps://doi.org/10.48550/arxiv.2101.11750openalex-snapshot
Information contraction in noisy binary neural networks and its implications
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.5188/ijsmer.14.1openalex-snapshot
Desigining Circuits from Imperfect Components in VISI Giga-scale Technologies
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95273openalex-snapshot
Variability-aware architectures based on hardware redundancy for nanoscale reliable computation
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.