On the public citation graph

Formulas Resilient to Short-Circuit Errors

0 signed · 37 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.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferredcites →https://doi.org/10.1007/11761679_19openalex-snapshot
Private Circuits II: Keeping Secrets in Tamperable Circuits
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_15openalex-snapshot
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_21openalex-snapshot
Cryptography with Tamperable and Leaky Memory
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/18.312190openalex-snapshot
Lower bounds for the complexity of reliable Boolean circuits with noisy gates
inferredcites →https://doi.org/10.1109/18.669417openalex-snapshot
On the maximum tolerable noise for reliable computation by formulas
inferredcites →https://doi.org/10.1109/18.75261openalex-snapshot
On the maximum tolerable noise for reliable computation by formulas
inferredcites →https://doi.org/10.1109/18.796377openalex-snapshot
Signal propagation and noisy circuits
inferredcites →https://doi.org/10.1109/focs.2011.51openalex-snapshot
Efficient and Explicit Coding for Interactive Communication
inferredcites →https://doi.org/10.1109/fscs.1990.89546openalex-snapshot
Fault tolerant sorting network
inferredcites →https://doi.org/10.1109/sct.1995.514728openalex-snapshot
Fault tolerant circuits and probabilistically checkable proofs
inferredcites →https://doi.org/10.1109/sfcs.1985.41openalex-snapshot
On networks of noisy gates
inferredcites →https://doi.org/10.1109/sfcs.1994.365682openalex-snapshot
On the design of reliable Boolean circuits that contain partially unreliable gates
inferredcites →https://doi.org/10.1109/tit.2003.818405openalex-snapshot
On the maximum tolerable noise of k-input gates for reliable computation by formulas
inferredcites →https://doi.org/10.1109/tit.2008.926459openalex-snapshot
Noise Threshold for Universality of Two-Input Gates
inferredcites →https://doi.org/10.1137/0214009openalex-snapshot
On Fault-Tolerant Networks for Sorting
inferredcites →https://doi.org/10.1145/100216.100230openalex-snapshot
Computing with unreliable information
inferredcites →https://doi.org/10.1145/167088.167279openalex-snapshot
Deterministic coding for interactive communication
inferredcites →https://doi.org/10.1145/1993636.1993659openalex-snapshot
Towards coding for maximum errors in interactive communication
inferredcites →https://doi.org/10.1145/2090236.2090250openalex-snapshot
Towards deterministic tree code constructions
inferredcites →https://doi.org/10.1145/62212.62265openalex-snapshot
Monotone circuits for connectivity require super-logarithmic depth
inferredcites →https://doi.org/10.1515/9781400882618-003openalex-snapshot
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
inferredcites →https://doi.org/10.26421/qic10.5-6-1openalex-snapshot
Upper bounds on the noise threshold for fault-tolerant quantum computing

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-031-48621-0_5openalex-snapshot
Efficiently Testable Circuits Without Conductivity
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-3-662-44371-2_26openalex-snapshot
On the Impossibility of Cryptography with Tamperable Randomness
inferred← citeshttps://doi.org/10.1007/s00453-016-0219-7openalex-snapshot
On the Impossibility of Cryptography with Tamperable Randomness
inferred← citeshttps://doi.org/10.1109/tit.2016.2582176openalex-snapshot
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
inferred← citeshttps://doi.org/10.1137/1.9781611975994.144openalex-snapshot
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
inferred← citeshttps://doi.org/10.1137/22m1520578openalex-snapshot
Circuits Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1145/2591796.2591861openalex-snapshot
Circuits resilient to additive attacks with applications to secure computation
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.1561/0400000079openalex-snapshot
Coding for Interactive Communication: A Survey
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.