On the public citation graph

Computing in fault tolerance broadcast networks

0 signed · 35 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.1968.tb01087.xopenalex-snapshot
Reliable Information Storage in Memories Designed from Unreliable Components*
inferredcites →https://doi.org/10.1002/rsa.3240050306openalex-snapshot
On boolean decision trees with faulty nodes
inferredcites →https://doi.org/10.1016/0022-0000(86)90002-4openalex-snapshot
Reliable computation with cellular automata
inferredcites →https://doi.org/10.1016/c2009-1-28569-8openalex-snapshot
A First Course in Stochastic Processes
inferredcites →https://doi.org/10.1016/s0020-0190(00)00002-8openalex-snapshot
Finding OR in a noisy broadcast network
inferredcites →https://doi.org/10.1109/18.2626openalex-snapshot
Finding parity in a simple broadcast network
inferredcites →https://doi.org/10.1109/sfcs.1985.41openalex-snapshot
On networks of noisy gates
inferredcites →https://doi.org/10.1109/sfcs.1991.185424openalex-snapshot
Lower bounds for the complexity of reliable Boolean circuits with 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.1992.267778openalex-snapshot
Communication on noisy channels: a coding theorem for computation
inferredcites →https://doi.org/10.1109/sfcs.1996.548474openalex-snapshot
Highly fault-tolerant parallel computation
inferredcites →https://doi.org/10.1137/s0097539791195877openalex-snapshot
Computing with Noisy Information
inferredcites →https://doi.org/10.1137/s0895480103434063openalex-snapshot
Computation in Noisy Radio Networks
inferredcites →https://doi.org/10.1145/167088.167279openalex-snapshot
Deterministic coding for interactive communication
inferredcites →https://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferredcites →https://doi.org/10.1145/237814.238013openalex-snapshot
Lower bounds for noisy Boolean decision trees

What points at this work

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

inferred← citeshttps://doi.org/10.1109/allerton.2008.4797694openalex-snapshot
Finding the K largest metrics in a noisy broadcast network
inferred← citeshttps://doi.org/10.1109/focs.2008.72openalex-snapshot
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2019.00030openalex-snapshot
Radio Network Coding Requires Logarithmic Overhead
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462023openalex-snapshot
Towards Efficient Designs for In-network Computing with Noisy Wireless Channels
inferred← citeshttps://doi.org/10.1109/itwnit.2009.5158545openalex-snapshot
Distributed computation of symmetric functions with binary inputs
inferred← citeshttps://doi.org/10.1109/sfcs.2005.48openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferred← citeshttps://doi.org/10.1109/tit.2013.2293214openalex-snapshot
On Distributed Function Computation in Structure-Free Random Wireless Networks
inferred← citeshttps://doi.org/10.1109/tit.2017.2725267openalex-snapshot
Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network
inferred← citeshttps://doi.org/10.1109/tmc.2010.59openalex-snapshot
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
inferred← citeshttps://doi.org/10.1109/tnet.2015.2445835openalex-snapshot
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975994.131openalex-snapshot
Instance-Optimality in the Noisy Value-and Comparison-Model
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a006openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.10openalex-snapshot
Erasure Correction for Noisy Radio Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02290openalex-snapshot
How Hard is Computing Parity with Noisy Communications?
inferred← citeshttps://doi.org/10.48550/arxiv.1503.00321openalex-snapshot
A Sampling Technique of Proving Lower Bounds for Noisy Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08182openalex-snapshot
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00838openalex-snapshot
Algorithms for Noisy Broadcast under Erasures
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.