On the public citation graph

On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates

0 signed · 26 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.1007/3-540-18740-5_101openalex-snapshot
Reliable networks from unreliable gates with almost minimal complexity
inferredcites →https://doi.org/10.1007/3-540-50647-0_131openalex-snapshot
Reliable networks for boolean functions with small complexity
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.312190openalex-snapshot
Lower bounds for the complexity of reliable Boolean circuits with noisy gates
inferredcites →https://doi.org/10.1109/18.79921openalex-snapshot
On a lower bound for the redundancy of reliable networks with noisy gates
inferredcites →https://doi.org/10.1109/sfcs.1985.41openalex-snapshot
On networks of noisy gates
inferredcites →https://doi.org/10.1109/sfcs.1991.185425openalex-snapshot
Reliable computation with noisy circuits and decision trees-a general n log n lower bound
inferredcites →https://doi.org/10.1109/sfcs.1993.366827openalex-snapshot
Signal propagation, with application to a lower bound on the depth of noisy formulas
inferredcites →https://doi.org/10.1109/tc.1985.1676584openalex-snapshot
Wafer-Scale Integration of Systolic Arrays
inferredcites →https://doi.org/10.1137/0404042openalex-snapshot
Fault Tolerant Sorting Networks
inferredcites →https://doi.org/10.1145/65950.77248openalex-snapshot
Invariance of complexity measures for networks with unreliable gates
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.1007/978-3-662-48054-0_8openalex-snapshot
Almost All Functions Require Exponential Energy
inferred← citeshttps://doi.org/10.1007/s00365-004-0561-xopenalex-snapshot
Digital Sums and Divide-and-Conquer Recurrences: Fourier Expansions and Absolute Convergence
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00595-2openalex-snapshot
Kleitman and Combinatorics: A Celebration
inferred← citeshttps://doi.org/10.1109/igcc.2014.7039142openalex-snapshot
Complexity-theoretic obstacles to achieving energy savings with near-threshold computing
inferred← citeshttps://doi.org/10.1109/sfcs.2005.48openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferred← citeshttps://doi.org/10.1137/060654864openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferred← citeshttps://doi.org/10.1137/22m1520578openalex-snapshot
Circuits Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1137/s0097539796305298openalex-snapshot
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.1145/3519935.3520007openalex-snapshot
Circuits resilient to short-circuit errors
inferred← citeshttps://doi.org/10.1145/3538390openalex-snapshot
Optimal Short-Circuit Resilient Formulas
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a018openalex-snapshot
inferred← citeshttps://doi.org/10.5555/1070432.1070520openalex-snapshot
Rounds vs queries trade-off in noisy 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.