On the public citation graph

On the maximum tolerable noise for reliable computation by formulas

0 signed · 77 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.1080/00401706.1968.10490555openalex-snapshot
Mathematical Statistics A Decision Theoretic Approach
inferredcites →https://doi.org/10.1090/pspum/050/1067764openalex-snapshot
Developments in “The synthesis of reliable organisms from unreliable components”
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.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/9781118181508.ch18openalex-snapshot
Reliability of Nanoelectronic VLSI
inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_1openalex-snapshot
Introduction
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.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.1016/s0016-0032(02)00025-xopenalex-snapshot
Fault-tolerant computation in groups and semigroups: applications to automata, dynamic systems and Petri nets
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.96.062305openalex-snapshot
Reliable computation from contextual correlations
inferred← citeshttps://doi.org/10.1103/physreve.110.054303openalex-snapshot
Fault-tolerant neural networks from biological error correction codes
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.1103/physrevlett.96.250401openalex-snapshot
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
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.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/ciss.2017.7926139openalex-snapshot
Energy-reliability limits in nanoscale neural networks
inferred← citeshttps://doi.org/10.1109/dac.2002.1012737openalex-snapshot
Reliable and energy-efficient digital signal processing
inferred← citeshttps://doi.org/10.1109/dft.2008.30openalex-snapshot
Exploring Density-Reliability Tradeoffs on Nanoscale Substrates: When Do Smaller Less Reliable Devices Make Sense?
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/iccd.2000.878291openalex-snapshot
Current-mode threshold logic gates
inferred← citeshttps://doi.org/10.1109/iolts.2006.18openalex-snapshot
Contribution of Communications to Dependability in Massively-Defective General-Purpose Nanoarchitectures
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/isit.2019.8849393openalex-snapshot
Broadcasting on Random Networks
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518174openalex-snapshot
Reconstruction on 2D Regular Grids
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/nanoarch.2007.4400853openalex-snapshot
Analysis of defect tolerance in molecular electronics using information-theoretic measures
inferred← citeshttps://doi.org/10.1109/nanoarch.2013.6623053openalex-snapshot
Extending the fundamental error bounds for asymmetric error reliable computation
inferred← citeshttps://doi.org/10.1109/ojsp.2020.2997262openalex-snapshot
Cost-Reliability Tradeoffs in Fusing Unreliable Computational Units
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/sips.2013.6674525openalex-snapshot
Error-resilient systems via statistical signal processing
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.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/tit.2019.2935772openalex-snapshot
Broadcasting on Random Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1109/tit.2022.3177667openalex-snapshot
Broadcasting on Two-Dimensional Regular Grids
inferred← citeshttps://doi.org/10.1109/tit.2024.3486278openalex-snapshot
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise
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.2011.2111460openalex-snapshot
On the Reliability of Computational Structures Using Majority Logic
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2008392openalex-snapshot
Analysis of Defect Tolerance in Molecular Crossbar Electronics
inferred← citeshttps://doi.org/10.1137/22m1520578openalex-snapshot
Circuits Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1145/1837274.1837491openalex-snapshot
Stochastic computation
inferred← citeshttps://doi.org/10.1145/3313776openalex-snapshot
Locating Errors in Faulty Formulas
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/513918.514124openalex-snapshot
Reliable and energy-efficient digital signal processing
inferred← citeshttps://doi.org/10.1201/9781420034783.ch12openalex-snapshot
Fault tolerance and ultimate physical limits of nanocomputation
inferred← citeshttps://doi.org/10.1214/009117904000000153openalex-snapshot
Robust reconstruction on trees is determined by the second eigenvalue
inferred← citeshttps://doi.org/10.1214/aoap/1019487349openalex-snapshot
Broadcasting on trees and the Ising model
inferred← citeshttps://doi.org/10.1214/aoap/1060202828openalex-snapshot
Information flow on trees
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.17760/d10017859openalex-snapshot
Physical/biochemical inspired computing models for reliable nano-technology systems
inferred← citeshttps://doi.org/10.48550/arxiv.0710.4680openalex-snapshot
Energy Bounds for Fault-Tolerant Nanoscale Designs
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.1803.07527openalex-snapshot
Broadcasting on Bounded Degree DAGs
inferred← citeshttps://doi.org/10.5772/16101openalex-snapshot
Information-Theoretic Modeling and Analysis of Stochastic Behaviors in Quantum-Dot Cellular Automata
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.